Introduction to Distributed Algorithms

Gerard Tel (Universiteit Utrecht, The Netherlands)

$114.95

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Cambridge University Pres
15 November 2000

Mathematics & Sciences; Computer programming & software development; Computer networking & communications; Mathematical theory of computation

The second edition of this successful textbook provides an up-to-date introduction both to distributed algorithms and to the theory behind them. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, while the coverage is sufficiently deep to make it useful for practicing engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model and includes algorithms for the implementation of computer communication networks. Two new chapters on sense of direction and failure detectors are state of the art and will provide an entry to research in these still-developing topics.

By: Gerard Tel (Universiteit Utrecht The Netherlands)
Imprint: Cambridge University Pres
Country of Publication: United Kingdom
Edition: 2nd Revised edition
Dimensions: Height: 244mm, Width: 191mm, Spine: 33mm
Weight: 1.228kg
ISBN: 9780521794831
ISBN 10: 0521794838
Pages: 612
Publication Date: 15 November 2000
Audience: College/higher education , Professional and scholarly , Primary , Undergraduate
Format: Paperback
Publisher's Status: Active

Preface; 1. Introduction: distributed systems; Part I. Protocols: 2. The model; 3. Communication protocols; 4. Routing algorithms; 5. Deadlock-free packet switching; Part II. Fundamental Algorithms: 6. Wave and traversal algorithms; 7. Election algorithms; 8. Termination detection; 9. Anonymous networks; 10. Snapshots; 11. Sense of direction and orientation; 12. Synchrony in networks; Part III. Fault Tolerance: 13. Fault tolerance in distributed systems; 14. Fault tolerance in asynchronous systems; 15. Fault tolerance in synchronous systems; 16. Failure detection; 17. Stabilization; Part IV. Appendix A: pseudocode conventions; Appendix B: graphs and networks; References; Index.

Reviews for Introduction to Distributed Algorithms

"""...an excellent overview of available techniques."" Computing Reviews ""The book provides an up-to-date introduction to both distributed algorithms, and to the theory behind these algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, while the coverage is sufficiently deep to make it useful for practising engineers and researchers."" Mathematical Reviews ""Provides a very decent interesting to significant topics of the theory of Distributed Computing, and it is especially suitable as both a reference book and a textbook."" SIGACT News ""...a nice textbook...I recommend this book for readers who are interested in a theoretical view of distributed control algorithms."" IEEE Parallel & Distributed Technology"