程序设计13概要1.pptVIP

Copyright ? 2006 Shujuan Jiang. All rights reserved. 1-* Cooperation Synchronization Accomplished by using the wait and notify methods that are defined in Object wait: placed in a loop that tests the condition for legal access Notify:called to tell one waiting thread that the thing it was waiting for has happened. wait and notify can only be called from within a synchronized method because they use the lock placed on an object by such a method. P549-551 Example Copyright ? 2006 Shujuan Jiang. All rights reserved. 1-* Evaluation Javas support for concurrency is relatively simple but effective. Both monitors and semaphores can be constructed easily in Java. Copyright ? 2006 Shujuan Jiang. All rights reserved. 1-* summary Concurrent execution can be at the subprogram, or unit level or the statement level Two of the primary facilities that concurrent languages must provide are mutually exclusive access to shared data structures (competition synchronization) and cooperation among tasks. Semaphores can be used to provide both competition and cooperation synchronization among concurrent tasks Monitors are data abstractions that provide a natural way of allowing mutually exclusive access to data shared among tasks. Copyright ? 2006 Shujuan Jiang. All rights reserved. 1-* Summary(cont.) Ada provides complex but effective constructs, based on the message passing model, for concurrency Java provides concurrent units in a rather simple but effective way Copyright ? 2006 Shujuan Jiang. All rights reserved. 1-* Exercises P556 Problem set 9 Copyright ? 2006 Shujuan Jiang. All rights reserved. 1-* Monitors(管程) Copyright ? 2006 Shujuan Jiang. All rights reserved. 1-* Cooperation Synchronization(cont.) An example: a shared buffer is implemented as a logically circular list of 100 integers (531—533) Copyright ? 2006 Shujuan Jiang. All rights reserved. 1-* Evaluation Monitors are a better way to provide competition synchronization than semaphores. The use of