| << Chapter < Page | Chapter >> Page > |
Monitors are a high-level data abstraction tool combining three features:
They are especially convenient for synchronization involving lots of state.
Existing implementations of monitors are embedded in programming languages. Best existing implementations are the Java programminglanguage from Sun and the Mesa language from Xerox.
There is one binary semaphore associated with each monitor, mutual exclusion is implicit: P on entry to any routine, V on exit.This synchronization is automatically done by the compiler (because he makes automatic calls to the OS), and the programmer does not seem them. They come forfree when the programmer declares a module to be a monitor.
Monitors are a higher-level concept than P and V. They are easier and safer to use, but less flexible, at least in raw form asabove.
Probably the best implementation is in the Mesa language, which extends the simple model above with several additions toincrease the flexibility and efficiency.
Do an example: implement a producer/consumer pair.
The "classic" Hoare-style monitor (using C++ style syntax):
class QueueHandler {
private:static int BUFFSIZE = 200;
int first;int last;
int buff[BUFFSIZE];
condition full;condition empty;
int ModIncr(int v) {return (v+1)%BUFFSIZE;
}public:
void QueueHandler (int);void AddToQueue (int);
int RemoveFromQueue ();};
voidQueueHandler::QueueHandler (int val)
{first = last = 0;
}void
QueueHandler::AddToQueue (int val) {{
while (ModIncr(last) == first) {full.wait();
}buff[last] = val;last = ModIncr(last);
empty.notify();}
intQueueHandler::RemoveFromQueue ();
{while (first == last) {
empty.wait();}
int ret = buff[first];
first = ModIncr(first);full.notify();
return ret;}
Java only allows one condition variable (implicit) per object. Here is the same solution in Java:
class QueueHandler {
final static int BUFFSIZE = 200;private int first;
private int last;private int buff[BUFFSIZE];private int ModIncr(int v) {
return (v+1)%BUFFSIZE;}
public QueueHandler (int val){
first = last = 0;}
public synchronized void AddToQueue (int val) {{
while (ModIncr(last) == first) {try { wait(); }
catch (InterruptedException e) {}}
buff[last]= val;
last = ModIncr(last);notify();
}public synchronized int RemoveFromQueue ();
{while (first == last) {
try { wait(); }catch (InterruptedException e) {}
}int ret = buff[first];first = ModIncr(first);
notify();return ret;
}
Condition variables: things to wait on. Two types: (1) classic Hoare/Mesa condition variables and (2) Java condition variables.
Hoare/Mesa condition variables:
Notification Switch
Would you like to follow the 'Operating systems' conversation and receive update notifications?
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|