| Monitor (synchronization) |
Article Index for Monitor |
Website Links For Monitor |
Information AboutMonitor (synchronization) |
|
Invented by Per Brinch Hansen , first implemented in the Concurrent Pascal language and used to structure Inter-process Communication in the Solo Operating System . MUTUAL EXCLUSION A monitor consists of:
A monitor procedure takes the lock before doing anything else, and holds it until it either finishes or waits for a condition (explained below). If every procedure guarantees that the invariant is true before it releases the lock, then no task can ever find the resource in a state that might lead to a race condition. As a simple example, consider a monitor for performing transactions on a Bank Account . monitor account { ''int'' balance := 0 function withdraw(''int'' amount) { if amount < 0 '''then''' '''error''' "Amount may not be negative" else if balance < amount '''then''' '''error''' "Insufficient funds" else balance := balance - amount } function deposit(''int'' amount) { if amount < 0 '''then''' '''error''' "Amount may not be negative" else balance := balance + amount } } The Monitor Invariant in this case simply says that the balance must reflect all past operations before another operation can begin. It is usually not stated in the code but may be mentioned in Comment s. There are however programming languages like Eiffel , which can check invariants. The lock is added by the Compiler . This makes monitors safer and more reliable than approaches that require the programmer to insert locking and unlocking operations by hand, since the programmer can forget them. CONDITION VARIABLES To avoid entering a Busy Waiting state, processes must be able to signal each other about events of interest. Monitors provide this capability through condition variables. When a monitor function requires a particular condition to be true before it can proceed, it waits on an associated condition variable. By waiting, it gives up the lock and is removed from the set of runnable processes. Any process that subsequently causes the condition to be true may then use the condition variable to notify a process waiting for the condition. A process that has been notified regains the lock and can proceed. The following monitor uses condition variables to implement an interprocess communication Channel that can store only one integer value at a time. monitor channel { ''int'' contents ''boolean'' full := false ''condition'' snd ''condition'' rcv function send(''int'' message) { if full '''then''' wait(rcv) Semantics: See Explanation Below contents := message full := true notify(snd) } function receive() { var ''int'' received if '''not''' full '''then''' wait(snd) Semantics: See Explanation Below received := contents full := false notify(rcv) return received } } Hoare vs. Mesa semantics Note that since waiting on a condition forfeits the lock, the waiter must make sure the monitor invariant is satisfied before it waits. In the example above, the same is true for notifying. In early style monitor implementations (known as Hoare semantics), notifying a condition variable caused a waiting process to receive the lock and run immediately, thereby guaranteeing that the condition would still be true. Implementing this behavior is complicated and has a high overhead. It is also incompatible with Scheduler s that can interrupt a process arbitrarily. For these reasons, researchers have considered various other semantics for condition variables. In most modern implementations (known as Mesa semantics), notifying does not take control away from the running process, but merely makes some waiting process runnable. The notifying process continues to hold the lock until it leaves the monitor function. The side effects of this approach are that the notifying process does not have to set up the monitor invariant before notifying, and the waiting process must double-check the condition it was waiting for. Specifically, if a monitor function includes the expression if ''test'' '''then''' wait(cv), another process could enter the monitor after the notification and make the condition untrue again before the waiting process runs. The expression must be rewritten as '''while''' ''test'' '''do''' wait(cv) so that the condition is re-checked before the process continues. Implementations also provide a "notifyAll" or "broadcast" operation that notifies every process waiting on a given condition. This operation is useful, for example, when several processes are waiting for different amounts of storage to become available. Releasing storage can enable any number of these processes to proceed, but the scheduler does not know which ones. A sample implementation for a condition variable is as follows: conditionVariable { int queueSize = 0; semaphore lock; semaphore waiting; wait() { lock.acquire(); queueSize++; lock.release(); waiting.down(); } signal() { lock.acquire(); if (queueSize > 0){ queueSize--; waiting.up(); } lock.release(); } } HISTORY Per Brinch Hansen was the first to describe and implement monitors, basing them on ideas from C. A. R. Hoare . Hoare subsequently developed the theoretical framework and demonstrated their equivalence to Semaphores (when using the original semantics). Programming languages that have supported monitors include
SEE ALSO BIBLIOGRAPHY
EXTERNAL LINKS
|
|
|