Elements of Distributed Computing

Features

• Cover Type: Hard Cover with 423 pages
• Published by: Wiley-IEEE Press May 23, 2002
• Written in: English
• ISBN 10 Number: 0471036005
• ISBN 13 Number: 978-0471036005
• Book Dimensions: 9.6 x 6.2 x 1.1 inches
• Weighs: 1.4 pounds

Product Description
A lucid and up-to-date introduction to the basics of distributed computing systems

As distributed systems become increasingly available, the need for a fundamental discussion of the subject has grown. Designed for first-year graduate students and advanced undergraduates as well as practicing computer engineers seeking a solid grounding in the subject, this well-organized text covers the fundamental concepts in distributed computing systems such as time, state, simultaneity, order, knowledge, failure, and agreement in distributed systems.

Departing from the focus on shared memory and synchronous systems commonly taken by other texts, this is the first useful reference based on an asynchronous model of distributed computing, the most widely used in academia and industry. The emphasis of the book is on developing general mechanisms that can be applied to a variety of problems. Its examples-clocks, locks, cameras, sensors, controllers, slicers, and synchronizers-have been carefully chosen so that they are fundamental and yet useful in practical contexts.

The text's advantages include:

• Emphasizes general mechanisms that can be applied to a variety of problems
• Uses a simple induction-based technique to prove correctness of all algorithms
• Includes a variety of exercises at the end of each chapter
• Contains material that has been extensively class tested
• Gives instructor flexibility in choosing appropriate balance between practice and theory of distributed computing

Book Info
A lucid and up to date introduction to the basics of distributed computing systems. Covers the fundamental concepts in distributed computing systems such as time, state, order, simultaneity, knowledge, failure, and agreement in distributed systems.

Reader Reviews
This is one of the best books on distributed computing I have read. Distributed algorithms by Tel comes next. This book is elegantly simple in description. It covers a broad range of topics (including new stuff like Slicing) (at least it had everything I wanted and more. The chapters are small and the author says they are equivalent to one classroom lecture, which makes for easy reading. The algorithms are all pseudo code (I like the style) though unfortunately there is no real code (though I found the actual Java code on the author's site). The approach is might be a bit too formal for some people though it was exactly what I was looking for.