Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity

Cover
Springer Science & Business Media, 27.11.2007 - 219 Seiten

Do-All Computing for Distributed Systems: Cooperation in the Presence of Adversity studies algorithmic issues associated with cooperative execution of multiple independent tasks by distributed computing agents including partitionable networks.

Recent results have shed light on the understanding of how adversity affects efficiency, by presenting failure-sensitive upper and lower bounds for Do-All in several models for computation. The ability to cooperatively perform a collection of tasks is key to solving a broad array of computation problems ranging from distributed search to distributed simulation and multi-agent collaboration which is introduced within this book.

Do-All Computing for Distributed Systems: Cooperation in the Presence of Adversity is structured to meet the needs of a professional audience composed of researchers and practitioners in industry. This volume is also suitable for graduate-level students in computer science.

 

Inhalt

Competitive Analysis of OmniDo in Partitionable
9
3
21
Synchronous DoAll with Crashes and PointtoPoint
47
Synchronous DoAll with Crashes and Restarts 77
76
Synchronous DoAll with Byzantine Failures
95
Asynchrony and DelaySensitive Bounds 115
114
8
145
Cooperation in the Absence of Communication
183
Related Cooperation Problems and Models
195
References 205
204
Index
213
Urheberrecht

Andere Ausgaben - Alle anzeigen

Häufige Begriffe und Wortgruppen

Beliebte Passagen

Seite 204 - Trends in Electronic Government: Managing Distributed Knowledge". In the proceedings of the 11th International Workshop on Database and Expert Systems Applications.
Seite 206 - GV Chockler, I. Keidar, and R. Vitenberg. Group Communication Specifications: A Comprehensive Study.
Seite 204 - Proceedings of the 9th ACM Symposium on Principles of Distributed Computing," 1990, pp. 1-13. 3. M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts, A theory of competitive analysis for distributed algorithms, in "Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science,

Bibliografische Informationen