Ebook: Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity
- Tags: Computer Communication Networks, Operating Systems, Theory of Computation, Algorithm Analysis and Problem Complexity, Computer Systems Organization and Communication Networks, Input/Output and Data Communications
- Year: 2008
- Publisher: Springer US
- Edition: 1
- Language: English
- pdf
The ability to cooperatively perform a collection of tasks in a distributed system is key to solving a broad array of computation problems ranging from distributed search, to distributed simulation, and multi-agent collaboration. Practical solutions to such cooperation problems must effectively marshal the available computing resources in performing large sets of tasks. This is challenging due to the failures and asynchrony of the involved processors, and due to the delays and connectivity failures in the underlying network.
Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity is the first book that presents an in depth study of cooperation problems, abstracted in terms of the Do-All problem, where a collection of processors cooperatively perform a collection of independent tasks in the presence of adversity.
This book presents several significant advances in algorithms designed to solve the Do-All problem in distributed message-passing settings under various models of adversity, including processor crashes, asynchrony, message delays, network partitions, and malicious processor behaviors. Upper and lower bounds are presented, demonstrating the extent to which efficiency can be combined with fault-tolerance. This book contains the recent advances in the principles of efficient and fault-tolerant cooperative computing, narrowing the gap between abstract models of dependable network computing and realistic distributed systems.
Do-All Computing in 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 as a reference or secondary text for advanced-level students in computer science and engineering.
The ability to cooperatively perform a collection of tasks in a distributed system is key to solving a broad array of computation problems ranging from distributed search, to distributed simulation, and multi-agent collaboration. Practical solutions to such cooperation problems must effectively marshal the available computing resources in performing large sets of tasks. This is challenging due to the failures and asynchrony of the involved processors, and due to the delays and connectivity failures in the underlying network.
Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity is the first book that presents an in depth study of cooperation problems, abstracted in terms of the Do-All problem, where a collection of processors cooperatively perform a collection of independent tasks in the presence of adversity.
This book presents several significant advances in algorithms designed to solve the Do-All problem in distributed message-passing settings under various models of adversity, including processor crashes, asynchrony, message delays, network partitions, and malicious processor behaviors. Upper and lower bounds are presented, demonstrating the extent to which efficiency can be combined with fault-tolerance. This book contains the recent advances in the principles of efficient and fault-tolerant cooperative computing, narrowing the gap between abstract models of dependable network computing and realistic distributed systems.
Do-All Computing in 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 as a reference or secondary text for advanced-level students in computer science and engineering.
The ability to cooperatively perform a collection of tasks in a distributed system is key to solving a broad array of computation problems ranging from distributed search, to distributed simulation, and multi-agent collaboration. Practical solutions to such cooperation problems must effectively marshal the available computing resources in performing large sets of tasks. This is challenging due to the failures and asynchrony of the involved processors, and due to the delays and connectivity failures in the underlying network.
Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity is the first book that presents an in depth study of cooperation problems, abstracted in terms of the Do-All problem, where a collection of processors cooperatively perform a collection of independent tasks in the presence of adversity.
This book presents several significant advances in algorithms designed to solve the Do-All problem in distributed message-passing settings under various models of adversity, including processor crashes, asynchrony, message delays, network partitions, and malicious processor behaviors. Upper and lower bounds are presented, demonstrating the extent to which efficiency can be combined with fault-tolerance. This book contains the recent advances in the principles of efficient and fault-tolerant cooperative computing, narrowing the gap between abstract models of dependable network computing and realistic distributed systems.
Do-All Computing in 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 as a reference or secondary text for advanced-level students in computer science and engineering.
Content:
Front Matter....Pages i-xxv
Introduction....Pages 1-9
Distributed Cooperation Problems: Models and Definitions....Pages 11-20
Synchronous Do-All with Crashes: Using Perfect Knowledge and Reliable Multicast....Pages 21-46
Synchronous Do-All with Crashes and Point-to-Point Messaging....Pages 47-75
Synchronous Do-All with Crashes and Restarts....Pages 77-93
Synchronous Do-All with Byzantine Failures....Pages 95-113
Asynchrony and Delay-Sensitive Bounds....Pages 115-143
Analysis of Omni-Do in Asynchronous Partitionable Networks....Pages 145-167
Competitive Analysis of Omni-Do in Partitionable Networks....Pages 169-182
Cooperation in the Absence of Communication....Pages 183-193
Related Cooperation Problems and Models....Pages 195-203
Back Matter....Pages 205-219
The ability to cooperatively perform a collection of tasks in a distributed system is key to solving a broad array of computation problems ranging from distributed search, to distributed simulation, and multi-agent collaboration. Practical solutions to such cooperation problems must effectively marshal the available computing resources in performing large sets of tasks. This is challenging due to the failures and asynchrony of the involved processors, and due to the delays and connectivity failures in the underlying network.
Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity is the first book that presents an in depth study of cooperation problems, abstracted in terms of the Do-All problem, where a collection of processors cooperatively perform a collection of independent tasks in the presence of adversity.
This book presents several significant advances in algorithms designed to solve the Do-All problem in distributed message-passing settings under various models of adversity, including processor crashes, asynchrony, message delays, network partitions, and malicious processor behaviors. Upper and lower bounds are presented, demonstrating the extent to which efficiency can be combined with fault-tolerance. This book contains the recent advances in the principles of efficient and fault-tolerant cooperative computing, narrowing the gap between abstract models of dependable network computing and realistic distributed systems.
Do-All Computing in 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 as a reference or secondary text for advanced-level students in computer science and engineering.
Content:
Front Matter....Pages i-xxv
Introduction....Pages 1-9
Distributed Cooperation Problems: Models and Definitions....Pages 11-20
Synchronous Do-All with Crashes: Using Perfect Knowledge and Reliable Multicast....Pages 21-46
Synchronous Do-All with Crashes and Point-to-Point Messaging....Pages 47-75
Synchronous Do-All with Crashes and Restarts....Pages 77-93
Synchronous Do-All with Byzantine Failures....Pages 95-113
Asynchrony and Delay-Sensitive Bounds....Pages 115-143
Analysis of Omni-Do in Asynchronous Partitionable Networks....Pages 145-167
Competitive Analysis of Omni-Do in Partitionable Networks....Pages 169-182
Cooperation in the Absence of Communication....Pages 183-193
Related Cooperation Problems and Models....Pages 195-203
Back Matter....Pages 205-219
....