Concurrent and Distributed Computing in Java

Features

• Cover Type: Hard Cover with 336 pages
• Published by: Wiley-IEEE Press
• Edition: 1st Edition February 4, 2004
• Written in: English
• ISBN 10 Number: 047143230X
• ISBN 13 Number: 978-0471432302
• Book Dimensions: 7.4 x 5.4 x 0.6 inches
• Weighs: 5 ounces

Product Review
"…a detailed yet readable introduction to concurrency and distributed computing." (Computing Reviews.com, April 9, 2004)

"well-written and accuratea good book for anyone who'd like hands-on training in the concepts of concurrent and distributed systems." (IEEE Distributed Systems Online, November 2004)

Product Review
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.

Reader Reviews
I bought this book a couple of years ago now. Although it has some interesting discussion of distributed algorithms its big let-down is the abysmal Java code that it contains. I cannot believe for one moment that any of this compiles, let alone works - it all generally looks like pseduo-code written for the purposes of illustration rather being of any practical value. Likewise I didn't find the material particularly helpfully structured or consistent in its level of detail. I would have liked to see more quantitive analysis of the suitability of different algorithms in practical applications and broader coverage of well-known distributed algorithms (for instance paxos and virtual synchrony are conspicuous in their absence).