Concurrency Mutual Exclusion and Synchronization互斥和同步.pptVIP

* A classical problem similar to a real operating system for the access of different resources. Problem definition: Three chairs. Three barbers. Waiting area having capacity for four seats and additional space for customers to stand and wait. Fire code limits the total number of customers (seating +standing). Customer cannot enter if pack to capacity. When a barber is free, customer waiting longest on the sofa can be served. If there are any standing customer, he can now occupy the seat on the sofa. Once a barber finished haircut, any barber can take the payment. As there is only one casher, so payment from one customer is accepted at a time. Barber(s) time is divided into haircut, accepting payment and waiting for customers (sleeping). Barber Shop Problem * Message Passing Enforce mutual exclusion Exchange information send (destination, message) receive (source, message) * Synchronization Sender and receiver may or may not be blocking (waiting for message) Blocking send, blocking receive Both sender and receiver are blocked until message is delivered Called a rendezvous * Synchronization Nonblocking send, blocking receive Sender continues on Receiver is blocked until the requested message arrives Nonblocking send, nonblocking receive Neither party is required to wait * Addressing Direct addressing Send primitive includes a specific identifier of the destination process Receive primitive could know ahead of time which process a message is expected Receive primitive could use source parameter to return a value when the receive operation has been performed * Addressing Indirect addressing Messages are sent to a shared data structure consisting of queues Queues are called mailboxes One process sends a message to the mailbox and the other process picks up the message from the mailbox * * Message Format * Mutual Exclusion: OS and Programming Languages Mechanisms Semaphore An integer value used for signaling among processes. Only three operations may be