When we use Semaphore in the consumer and producer buffer
I am working on a BoundedBuffer class for consumer and producer, we want to use Semaphore in this class, we did it, but there is an error every time we use acquire () rerror:
unregistered exception java.lang.InterruptedException; must be caught or declared abandoned
Here is the code:
import java.util.concurrent.Semaphore;
public class BoundedBuffer implements Buffer {
private static final int BUFFER_SIZE = 4;
/**
* volatile does not appear in the printed text. A discussion of
* volatile is in chapter 7.
*/
private volatile int count;
private Object[] buffer;
private int in; // points to the next free position in the buffer
private int out; // points to the next full position in the buffer
private Semaphore mutex;
private Semaphore empty;
private Semaphore full;
public BoundedBuffer() { //constractur
// buffer is initially empty
//count = 0;
in = 0;
out = 0;
buffer = new Object[BUFFER_SIZE];
mutex = new Semaphore(1);
empty = new Semaphore(BUFFER_SIZE);
full = new Semaphore(0);
}
// producer calls this method
public void insert(Object item) {
//while (count == BUFFER_SIZE)
// ; // do nothing the brach full
// add an item to the buffer
// ++count;
empty.acquire();
mutex.acquire();
buffer[in] = item;
in = (in + 1) % BUFFER_SIZE;//that to do cyrcle or to go to the begining againe
/*
if (count == BUFFER_SIZE)
System.out.println("Baker put " + item + " Shelf FULL");
else
System.out.println("Baker put " + item + " Shelf Size = " + count);
*/
mutex.release();
full.release();
}
// consumer calls this method
public Object remove() {
//Object item;
full.acquire();
mutex.acquire();
//while (count == 0)
; // do nothing the buffer is empty
// remove an item from the buffer
//--count;
Object item = buffer[out];
out = (out + 1) % BUFFER_SIZE;
mutex.release();
empty.release();
return item;
}
}
I may not fully understand your application, but could you please use the limited buffer class that is already provided in the java.util.concurrent package ( ArrayBlockingQueue )?
This is a classic "bounded buffer" that has a fixed array of elements inserted by producers and retrieved by consumers. Once created, the capacity cannot be increased. Attempting to put an item on a full queue will result in a blocking input operation; attempts to get an item from an empty queue will be similar to a block.
a source to share