Concurrent and Distributed Computing in Java

Combining the two key types of Java programming, Garg (Electrical and Computer Engineering Department, University of Texas) offers both professionals and students a guide to fundamental concepts necessary for mastering Java programming. Early chapters deal with techniques for programming in shared-memory based systems and cover concepts in Java such as threads and synchronized methods. Later chapters look at programming in a message-passing system, covering resource allocation problems, logical clocks, global property detection, leader election, and message ordering and logging. Treatment avoids excessive mathematical notation while explaining important concepts. Chapter problems are included. The book is copublished with IEEE Press. 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. 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. Parallel and distributed computing systems are now widely available.