An Introduction to Distributed Algorithms takes up some of the main concepts and algorithms, ranging from basic to advanced techniques and applications, that underlie the programming of distributed-memory systems such as computer networks, networks of workstations, and multiprocessors. Written from the broad perspective of distributed-memory systems in general it includes topics such as algorithms for maximum flow, program debugging, and simulation that do not appear in more orthodox texts on distributed algorithms.
Moving from fundamentals to advances and applications, ten chapters—with exercises and bibliographic notes—cover a variety of topics. These include models of distributed computation, information propagation, leader election, distributed snapshots, network synchronization, self- stability, termination detection, deadlock detection, graph algorithms, mutual exclusion, program debugging, and simulation.
All of the algorithms are presented in a clear, template- based format for the description of message-passing computations among the nodes of a connected graph. Such a generic setting allows the treatment of problems originating from many different application areas.
The main ideas and algorithms are described in a way that balances intuition and formal rigor—most are preceded by a general intuitive discussion and followed by formal statements as to correctness complexity or other properties.
"synopsis" may belong to another edition of this title.
Valmir C. Barbosa is Associate Professor of Computer Science at Federal University of Rio de Janeiro.
"Barbosa makes the otherwise difficult subject of distributed algorithms very enjoyable and attractive to both students and researchers. The leading intuitive discussion of each algorithm is so very well organized and clearly written that a reader can, without the slightest effort, have a clear picture of it. An ideal textbook for an one-semester distributed algorithms course."
—Mamoru Maekawa, Professor, Graduate School of Information Systems, University of Electro-Communications, Tokyo
"The strength of this book is its focus on practical problems in distributed computing. The book is very accessible—-I would use it teaching a senior level course on distributed algorithms."
—David Nicol, Department of Computer Science, Dartmouth College
"About this title" may belong to another edition of this title.
FREE shipping within U.S.A.
Destination, rates & speedsSeller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.8. Seller Inventory # G0262024128I3N00
Quantity: 1 available
Seller: Midtown Scholar Bookstore, Harrisburg, PA, U.S.A.
Hardcover. Condition: Very Good. No dust jacket as issued Standard-sized. Seller Inventory # mon0000058596
Quantity: 1 available
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Seller Inventory # Z1-J-014-01562
Quantity: 1 available
Seller: G. & J. CHESTERS, TAMWORTH, United Kingdom
Hardcover. Condition: Fine. 1st Edition. 366p, a Fine hardback with pictorial paper-covered boards so no dust-jacket called for [0262024128]. Seller Inventory # 74282
Quantity: 1 available
Seller: Kloof Booksellers & Scientia Verlag, Amsterdam, Netherlands
Condition: as new. Cambridge, MA: The MIT Press, 1996. Hardcover. 392 pp.- An Introduction to Distributed Algorithms takes up some of the main concepts and algorithms, ranging from basic to advanced techniques and applications, that underlie the programming of distributed-memory systems such as computer networks, networks of workstations, and multiprocessors. Written from the broad perspective of distributed-memory systems in general it includes topics such as algorithms for maximum flow, program debugging, and simulation that do not appear in more orthodox texts on distributed algorithms. Moving from fundamentals to advances and applications, ten chapters--with exercises and bibliographic notes--cover a variety of topics. These include models of distributed computation, information propagation, leader election, distributed snapshots, network synchronization, self- stability, termination detection, deadlock detection, graph algorithms, mutual exclusion, program debugging, and simulation. English text. Condition : as new. Condition : as new copy. ISBN 9780262024129. Keywords : , Electronic data processing. Seller Inventory # 263321
Quantity: 1 available
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN:9780262024129. Seller Inventory # 8959805
Quantity: 1 available
Seller: NEPO UG, Rüsselsheim am Main, Germany
Condition: Sehr gut. 376 Seiten ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 969 23,5 x 18,4 x 2,6 cm, Gebundene Ausgabe. Seller Inventory # 367842
Quantity: 1 available
Seller: dsmbooks, Liverpool, United Kingdom
hardcover. Condition: Good. Good. book. Seller Inventory # D8S0-3-M-0262024128-6
Quantity: 1 available