Concurrent and Distributed Computing in Java

Inbunden, Engelska, 2004

1 773 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2004-03-05
Mått:164 x 240 x 24 mm
Vikt:611 g
Format:Inbunden
Språk:Engelska
Serie:IEEE Press
Antal sidor:336
Förlag:John Wiley & Sons Inc
ISBN:9780471432302

Utforska kategorier

Nätverk och kommunikation inom Data och IT

Mer om författaren

VIJAY K. GARG, PHD, is a professor in the Electrical and Computer Engineering Department and director of the Parallel and Distributed Systems Laboratory at the University of Texas at Austin, and a leading researcher in distributed computing systems.

Recensioner i media

"…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)

Innehållsförteckning

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.