Cooperative task-oriented computing
Subtitle: algorithms and complexity
By: Chryssis Georgiou, Alexander A. Shvartsman
Contributors: Shvartsman, Alex Allister
Series: Synthesis lectures on distributed computing theory -- # 7
Publisher: Morgan & Claypool
Published: 2011
Place of publication: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA)
Language: eng
Format: [electronic resource] :
Number of pages: 155
ISBN-13: 9781608452880; 9781608452873
Subjects: Electronic data processing; Distributed processing; Mathematical models
Other titles: Synthesis digital library of engineering and computer science.
Description: Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions.
Notes: Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (p. 141-148) and index.

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Also available in print.

Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.
Table of contents: title: 1. Introduction; title: 1.1 Motivation and landscape; title: 1.2 Book roadmap and conventions; title: 1.2.1 Roadmap; title: 1.2.2 Conventions; title: 2. Distributed cooperation and adversity; title: 2.1 Distributed computing and efficiency; title: 2.2 Cooperation problem: do-all computing; title: 2.3 Computation and adversarial settings; title: 2.4 Fault tolerance, efficiency, and lower bounds; title: 2.5 Bibliographic notes; title: 3. Paradigms and techniques; title: 3.1 Algorithmic paradigms; title: 3.1.1 Global allocation paradigm; title: 3.1.2 Local allocation paradigm; title: 3.1.3 Hashed allocation paradigm; title: 3.2 Algorithmic techniques in the shared-memory model; title: 3.2.1 Basic techniques for implementing allocation paradigms; title: 3.2.2 Techniques for improving algorithm efficiency; title: 3.3 Algorithmic techniques in the message-passing model; title: 3.3.1 Basic techniques for implementing allocation paradigms; title: 3.3.2 Techniques for improving algorithm efficiency; title: 3.4 Exercises; title: 3.5 Bibliographic notes; title: 4. Shared-memory algorithms; title: 4.1 Algorithm W; title: 4.1.1 Description of algorithm W; title: 4.1.2 Analysis of algorithm W; title: 4.1.3 Improving efficiency with oversaturation; title: 4.2 Algorithm X; title: 4.2.1 Description of algorithm X; title: 4.2.2 Analysis of algorithm X; title: 4.3 Algorithm Groote; title: 4.3.1 A high-level view of the algorithm; title: 4.3.2 The algorithm for p = 2k and n = mk; title: 4.4 Algorithm AWt; title: 4.4.1 Contention of permutations; title: 4.4.2 Description of algorithm AWt; title: 4.4.3 Analysis of algorithm AWt; title: 4.5 Algorithm TwoLevelAW; title: 4.5.1 Description of algorithm TLAW(q, t); title: 4.5.2 Analysis of algorithm TLAW(q, t); title: 4.6 Exercises; title: 4.7 Bibliographical notes; title: 5. Message-passing algorithms; title: 5.1 Solving do-all through shared-memory; title: 5.1.1 Message-passing setting, quorums, and adversity; title: 5.1.2 Shared-memory emulation service AM; title: 5.1.3 The message-passing algorithm Xmp; title: 5.1.4 Algorithm analysis; title: 5.2 Algorithm AN; title: 5.2.1 Data structures and phases of algorithm AN; title: 5.2.2 Details of algorithm AN; title: 5.2.3 Analysis of algorithm AN; title: 5.3 Algorithm GKS; title: 5.3.1 The gossip problem; title: 5.3.2 Combinatorial tools; title: 5.3.3 The gossip algorithm; title: 5.3.4 The do-all algorithm; title: 5.4 Algorithms KSaw and KSpa; title: 5.4.1 Adversarial model, complexity and lower bounds; title: 5.4.2 Family of deterministic algorithms KSaw; title: 5.4.3 Algorithm KSpa; title: 5.5 Exercises; title: 5.6 Bibliographical notes; title: 6. The do-all problem in other settings; title: 6.1 Do-all with Byzantine processors; title: 6.2 Do-all with broadcast channels; title: 6.3 Do-all in partitionable networks; title: 6.4 Do-all in the absence of communication; title: Bibliography; title: Authors' biographies; title: Index.