Concurrent and Distributed Computing in Java

Concurrent 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. Concurrent 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. Mutual Exclusion Problem -- Synchronization Primitives -- Consistency Conditions -- Wait-free Synchronization -- Distributed Programming -- Models And Clocks -- Resource Allocation -- Global Snapshot -- Global Properties -- Detecting Termination And Deadlocks -- Message Ordering -- Leader Election -- Synchronizers -- Agreement -- Transactions -- Recovery -- Self-stabilization. Vijay K. Garg. Includes Bibliographical References (p. 297-304) And Index. Also Available In An Electronic Version. Mode Of Access: World Wide Web. Cover......Page 1 Contents......Page 10 Preface......Page 22 1. Introduction......Page 24 2. Mutual Exclusion Problem......Page 40 3. Synchronization Primitives......Page 54 4. Consistency Conditions......Page 76 5. Wait-Free Synchronization......Page 88 6. Distributed Programming......Page 112 7. Models and Clocks......Page 134 8. Resource Allocation......Page 152 9. Global Snapshot......Page 172 10. Global Properties......Page 186 11. Detecting Termination and Deadlocks......Page 200 12. Message Ordering......Page 214 13. Leader Election......Page 232 14. Synchronizers......Page 244 15. Agreement......Page 256 16. Transactions......Page 276 17. Recovery......Page 286 18. Self- Stabilization......Page 302 A. Various Utility Classes......Page 314 Bibliography......Page 320 Index......Page 328 Parallel and distributed computing systems are now widely available.