Concurrent and Distributed Computing in JavaConcurrent and Distributed Computing in Java addresses fundamental concepts in concurrent computing with Java examples. The book consists of two parts. The first part deals with techniques for programming in shared-memory based systems. The book covers concepts in Java such as threads, synchronized methods, waits, and notify to expose students to basic concepts for multi-threaded programming. It also includes algorithms for mutual exclusion, consensus, atomic objects, and wait-free data structures. The second part of the book deals with programming in a message-passing system. This part covers resource allocation problems, logical clocks, global property detection, leader election, message ordering, agreement algorithms, checkpointing, and message logging. Primarily a textbook for upper-level undergraduates and graduate students, this thorough treatment will also be of interest to professional programmers. |
Contents
1 Introduction | 1 |
List of Figures | 2 |
2 Mutual Exclusion Problem | 17 |
3 Synchronization Primitives | 31 |
4 Consistency Conditions | 53 |
5 WaitFree Synchronization | 65 |
6 Distributed Programming | 89 |
7 Models and Clocks | 111 |
12 Message Ordering | 191 |
13 Leader Election | 209 |
14 Synchronizers | 221 |
15 Agreement | 233 |
16 Transactions | 253 |
17 Recovery | 263 |
18 SelfStabilization | 279 |
A Various Utility Classes | 291 |
8 Resource Allocation | 129 |
9 Global Snapshot | 149 |
10 Global Properties | 163 |
11 Detecting Termination and Deadlocks | 177 |
| 297 | |
| 305 | |
Other editions - View all
Common terms and phrases
algorithm application assume atomic become boolean busy wait called causal channel Chapter checkpoint complexity computation concurrent condition consensus consider consistent construction coordinator critical section detection discussed distributed algorithm distributed system edges equals example execution extends failure false first fork Give given global implementation import initial interface Java knows lock machine method monitor multiple mutual exclusion myId neighbors node object operation parent philosopher predicate problem processor protocol provides public class public synchronized void public void pulse queue reader received record remote request requires result round sent sequential sequential consistency server shared shown in Figure simple single snapshot socket static takes termination thread timestamp token transaction tree true turn Util variable vector clock wait write