Apress

Do-All Computing in Distributed Systems

Cooperation in the Presence of Adversity

By Chryssis Georgiou

Do-All Computing in Distributed Systems Cover Image

This book studies algorithmic issues associated with cooperative execution of multiple independent tasks by distributed computing agents including partitionable networks. It is the first monograph that deals with do-all computing for distributed systems.

Full Description

  • ISBN13: 978-0-3873-0918-7
  • 245 Pages
  • User Level: Science
  • Publication Date: November 27, 2007
  • Available eBook Formats: PDF
  • eBook Price: $149.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
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.
Table of Contents

Table of Contents

  1. List of Figures.
  2. List of Symbols.
  3. Foreword by Michel Raynal.
  4. Authors’ Preface.
  5. Introduction.
  6. Distributed Cooperation Problems: Models and Definitions.
  7. Synchronous Do
  8. All with Crashes: Using Perfect: Knowledge and Reliable Multicast.
  9. Synchronous Do
  10. All with Crashes and Point
  11. to
  12. Point Messaging.
  13. Synchronous Do
  14. All with Crashes and Restarts.
  15. Synchronous Do
  16. All with Byzantine Failures.
  17. Asynchrony and Delay
  18. Sensitive Bounds.
  19. Analysis of Omni
  20. Do in Asynchronous Partitionable Networks.
  21. Competitive Analysis of Omni
  22. Do in Partitionable Networks.
  23. Cooperation in the Absence of Communication.
  24. Related Cooperation Problems and Models.
  25. References.
  26. Index.
Errata

If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.

* Required Fields

No errata are currently published