Scribd
Upload
2 views2 pages

# SemaphoreTest.java

The document is a Java program that demonstrates the use of semaphores for thread synchronization in a counter application. It includes a Producer that increments a counter and a Consumer that decrements it, both running in separate threads. The program measures the time taken for the operations and outputs the final count and execution time.

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
2 views2 pages

# SemaphoreTest.java

The document is a Java program that demonstrates the use of semaphores for thread synchronization in a counter application. It includes a Producer that increments a counter and a Consumer that decrements it, both running in separate threads. The program measures the time taken for the operations and outputs the final count and execution time.

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
You are on page 1/ 2

# SemaphoreTest.

java
import java.util.concurrent.*;

public class SemaphoreTest {

public static void main(String[] args) {


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

long start = System.currentTimeMillis();


Thread p = new Thread (new Producer(c_lock, inc_num));
p.start();
Thread c = new Thread (new Consumer(c_lock, dec_num));
c.start();
try {
p.join();
} catch (InterruptedException e) {}

try {
c.join();
} catch (InterruptedException e) {}
long finish = System.currentTimeMillis();
System.out.println(inc_num+" inc() calls, "+dec_num+" dec() calls = " +
c_lock.getCount());
System.out.println("With-Lock Time: "+(finish-start)+"ms");
}
}

class Producer implements Runnable{

private CounterLock myCounter;


int num;

public Producer(CounterLock x, int Num) {


this.num=Num;
this.myCounter = x;
}

@Override
public void run() {
for (int i = 0; i < num; i++) {
myCounter.inc();
}
}
}

class Consumer implements Runnable{

private CounterLock myCounter;


int num;

public Consumer(CounterLock x, int Num) {


this.num=Num;
this.myCounter = x;
}

@Override
public void run() {
for (int i = 0; i < num; i++) {
myCounter.dec();
}
}
}

class CounterLock {

private long count = 0;

private Semaphore sema = new Semaphore(1);

public void inc() {


try {
sema.acquire();
this.count++;
} catch(InterruptedException e) {
} finally {
sema.release();
}
}

public void dec() {


try {
sema.acquire();
this.count--;
} catch(InterruptedException e) {
} finally {
sema.release();
}
}

public long getCount() {


try {
sema.acquire();
return this.count;
} catch(InterruptedException e) {
return -1;
} finally {
sema.release();
}
}
}
Beta
0 / 0
used queries
1

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy