Concurrency: State Models and Java ProgramsWiley, 16. 6. 2006 - 413 strán (strany) Concurrency provides a thoroughly updated approach to the basic concepts and techniques behind concurrent programming. Concurrent programming is complex and demands a much more formal approach than sequential programming. In order to develop a thorough understanding of the topic Magee and Kramer present concepts, techniques and problems through a variety of forms: informal descriptions, illustrative examples, abstract models and concrete Java examples. These combine to provide problem patterns and associated solution techniques which enable students to recognise problems and arrive at solutions. New features include:
|
Iné vydania - Zobraziť všetky
Časté výrazy a frázy
acquireRead acquireWrite action labels allocator alphabet analysis applet architecture assert behavior blocked blue cars bounded buffer Büchi automaton car park catch InterruptedException Chapter CHUTE class diagram clearSpeed client composite process compute concurrent programs const consumer cruise control system deadlock defined depicted in Figure described Dining Philosophers problem display DOUBLECLICK engineOff engineOn example execution filter fluent fork golf balls implementation interaction interface Java labeled transition system linear temporal logic listed in Program liveness properties LTSA message-passing MUTEX mutual exclusion node notify notifyAll object occur operation output parallel composition parcel player port priority private int problem producer progress properties public void run re-labeling reader Readers-Writers problem receive red cars releaseRead releaseWrite resource Runnable safety property semaphore sender server Software Space Invaders specified speed sprite supervisor switch terminal set thread throws InterruptedException tick ticket timeout trace tuple space TupleSpace update variable wait worker writing