Normal view MARC view ISBD view

Do-All Computing in Distributed Systems [electronic resource] :Cooperation in the Presence of Adversity / by Chryssis Georgiou, Alexander A. Shvartsman.

by Georgiou, Chryssis [author.]; Shvartsman, Alexander A [author.]; SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: Boston, MA : Springer US, 2008.Description: online resource.ISBN: 9780387690452.Subject(s): Computer science | Data transmission systems | Computer network architectures | Computer Communication Networks | Operating systems (Computers) | Information theory | Computer software | Computer Science | Computer Communication Networks | Operating Systems | Theory of Computation | Algorithm Analysis and Problem Complexity | Computer Systems Organization and Communication Networks | Input/Output and Data CommunicationsDDC classification: 004.6 Online resources: Click here to access online
Contents:
Distributed Cooperation Problems: Models and Definitions -- Synchronous Do-All with Crashes: Using Perfect Knowledge and Reliable Multicast -- Synchronous Do-All with Crashes and Point-to-Point Messaging -- Synchronous Do-All with Crashes and Restarts -- Synchronous Do-All with Byzantine Failures -- Asynchrony and Delay-Sensitive Bounds -- Analysis of Omni-Do in Asynchronous Partitionable Networks -- Competitive Analysis of Omni-Do in Partitionable Networks -- Cooperation in the Absence of Communication -- Related Cooperation Problems and Models.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode
MAIN LIBRARY
TK5105.5-5105.9 (Browse shelf) Available

Distributed Cooperation Problems: Models and Definitions -- Synchronous Do-All with Crashes: Using Perfect Knowledge and Reliable Multicast -- Synchronous Do-All with Crashes and Point-to-Point Messaging -- Synchronous Do-All with Crashes and Restarts -- Synchronous Do-All with Byzantine Failures -- Asynchrony and Delay-Sensitive Bounds -- Analysis of Omni-Do in Asynchronous Partitionable Networks -- Competitive Analysis of Omni-Do in Partitionable Networks -- Cooperation in the Absence of Communication -- Related Cooperation Problems and Models.

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.

There are no comments for this item.

Log in to your account to post a comment.
@ Jomo Kenyatta University Of Agriculture and Technology Library

Powered by Koha