About The Book
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.
Contents
List of Figures. Preface. 1. Introduction. 2. Mutual Exclusion Problem. 3. Synchronization Primitives. 4. Consistency Conditions. 5. Wait-Free Synchronization. 6. Distributed Programming. 7. Models and Clocks. 8. Resource Allocation. 9. Global Snapshot. 10. Global Properties. 11. Detecting Termination and Deadlocks. 12. Message Ordering. 13. Leader Election. 14. Synchronizers. 15. Agreement. 16. Transactions. 17. Recovery. 18. Self-Stabilization. Appendix: Various Utility Classes. Bibliography. Index.
Excerpts from Inner Flap (Front)
An in-depth introduction to concurrent and distributed computing with Java Combining the two key types of Java programming, Concurrent and Distributed Computing in Java offers both professionals and students a comprehensive guide to fundamental concepts necessary for mastering Java programming. The text is presented in two parts. The first deals with techniques for programming in shared-memory based systems and covers concepts in Java such as: *Threads *Synchronized methods *Waits and notify *Multi-threaded programming *Algorithms for mutual exclusion, consensus, atomic objects, and wait-free data structures The second half of the text deals with programming in a message-passing system, and covers: *Resource allocation problems *Logical clocks *Global property detection *Leader election *Message ordering *Agreement algorithms *Checkpointing *Message logging Avoiding excessive mathematical notation while explaining important concepts with both rigor and clarity, this up-to-date text will prove a valuable resource for interested professionals and students alike.
Review
" a detailed yet readable introduction to concurrency and distributed computing." ( Computing Reviews.com , April 9, 2004) "...well-written and accurate...a good book for anyone who'd like hands-on training in the concepts of concurrent and distributed systems." ( IEEE Distributed Systems Online , November 2004)
Extracts
" a detailed yet readable introduction to concurrency and distributed computing." ( Computing Reviews.com , April 9, 2004) "...well-written and accurate...a good book for anyone who'd like hands-on training in the concepts of concurrent and distributed systems." ( IEEE Distributed Systems Online , November 2004)
Endorsements
Vijay K. Garg introduces concepts, models and algorithms suited to distributed computing and presents them in Java. This way, the reader can see that these algorithms can be effectively implemented (and that there is no "hidden mystery" within the model or the algorithms). The approach used by the author is very appealing as it demystifies concepts that could be considered "too theoretical" to be useful. This book successfully takes up the challenge to nicely merge theory and practice. It can consequently benefit both communities. I stronlgy recommend the book to people interested in the design and implementation of distributed systems. --Michel Raynal, Professor, University of Rennes, France.