Scribd
Upload
7 views2 pages

# NoLockTest - Java

The document contains a Java program that demonstrates a simple producer-consumer model using a shared counter without explicit locking. The Producer increments the counter while the Consumer decrements it, running in separate threads. The program measures and prints the total time taken for the operations and the final count value after execution.

Uploaded by

hoangtu112201
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
7 views2 pages

# NoLockTest - Java

The document contains a Java program that demonstrates a simple producer-consumer model using a shared counter without explicit locking. The Producer increments the counter while the Consumer decrements it, running in separate threads. The program measures and prints the total time taken for the operations and the final count value after execution.

Uploaded by

hoangtu112201
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

# NoLockTest.

java

import [Link];
import [Link];

public class NoLockTest {

public static void main(String[] args) {


CounterLock c_lock = new CounterLock();
int inc_num = 10001234;
int dec_num = 10000000;

long start = [Link]();


Thread p = new Thread (new Producer(c_lock, inc_num));
[Link]();

Thread c = new Thread (new Consumer(c_lock, dec_num));


[Link]();
try {
[Link]();
} catch (InterruptedException e) {}

try {
[Link]();
} catch (InterruptedException e) {}
long finish = [Link]();
[Link](inc_num+" inc() calls, "+dec_num+" dec() calls = " +
c_lock.getCount());
[Link]("No-Lock time: "+(finish-start)+"ms");
}
}

class Producer implements Runnable{

private CounterLock myCounter;


int num;

public Producer(CounterLock x, int Num) {


[Link]=Num;
[Link] = x;
}

@Override
public void run() {
for (int i = 0; i < num; i++) {
[Link]();
}
}
}

class Consumer implements Runnable{

private CounterLock myCounter;


int num;

public Consumer(CounterLock x, int Num) {


[Link]=Num;
[Link] = x;
}
@Override
public void run() {
for (int i = 0; i < num; i++) {
[Link]();
}
}
}

class CounterLock {

private long count = 0;

public void inc() {


[Link]++;
}

public void dec() {


[Link]--;
}

public long getCount() {


return [Link];
}
}
Beta
0 / 0
used queries
1

You might also like