說明 
1 electronic text (ix, 155 p.) : ill., digital file 
系列 
Synthesis lectures on distributed computing theory, 21551634 ; # 7


Synthesis digital library of engineering and computer science


Synthesis lectures on distributed computing theory, 21551634 ; # 7

附註 
Part of: Synthesis digital library of engineering and computer science 

Series from website 

Includes bibliographical references (p. 141148) and index 

1. Introduction  1.1 Motivation and landscape  1.2 Book roadmap and conventions  1.2.1 Roadmap  1.2.2 Conventions  

2. Distributed cooperation and adversity  2.1 Distributed computing and efficiency  2.2 Cooperation problem: doall computing  2.3 Computation and adversarial settings  2.4 Fault tolerance, efficiency, and lower bounds  2.5 Bibliographic notes  

3. Paradigms and techniques  3.1 Algorithmic paradigms  3.1.1 Global allocation paradigm  3.1.2 Local allocation paradigm  3.1.3 Hashed allocation paradigm  3.2 Algorithmic techniques in the sharedmemory model  3.2.1 Basic techniques for implementing allocation paradigms  3.2.2 Techniques for improving algorithm efficiency  3.3 Algorithmic techniques in the messagepassing model  3.3.1 Basic techniques for implementing allocation paradigms  3.3.2 Techniques for improving algorithm efficiency  3.4 Exercises  3.5 Bibliographic notes  

4. Sharedmemory algorithms  4.1 Algorithm W  4.1.1 Description of algorithm W  4.1.2 Analysis of algorithm W  4.1.3 Improving efficiency with oversaturation  4.2 Algorithm X  4.2.1 Description of algorithm X  4.2.2 Analysis of algorithm X  4.3 Algorithm Groote  4.3.1 A highlevel view of the algorithm  4.3.2 The algorithm for p = 2k and n = mk  4.4 Algorithm AWt  4.4.1 Contention of permutations  4.4.2 Description of algorithm AWt  4.4.3 Analysis of algorithm AWt  4.5 Algorithm TwoLevelAW  4.5.1 Description of algorithm TLAW(q, t)  4.5.2 Analysis of algorithm TLAW(q, t)  4.6 Exercises  4.7 Bibliographical notes  

5. Messagepassing algorithms  5.1 Solving doall through sharedmemory  5.1.1 Messagepassing setting, quorums, and adversity  5.1.2 Sharedmemory emulation service AM  5.1.3 The messagepassing algorithm Xmp  5.1.4 Algorithm analysis  5.2 Algorithm AN  5.2.1 Data structures and phases of algorithm AN  5.2.2 Details of algorithm AN  5.2.3 Analysis of algorithm AN  5.3 Algorithm GKS  5.3.1 The gossip problem  5.3.2 Combinatorial tools  5.3.3 The gossip algorithm  5.3.4 The doall algorithm  5.4 Algorithms KSaw and KSpa  5.4.1 Adversarial model, complexity and lower bounds  5.4.2 Family of deterministic algorithms KSaw  5.4.3 Algorithm KSpa  5.5 Exercises  5.6 Bibliographical notes  

6. The doall problem in other settings  6.1 Doall with Byzantine processors  6.2 Doall with broadcast channels  6.3 Doall in partitionable networks  6.4 Doall in the absence of communication  

Bibliography  Authors' biographies  Index 

Abstract freely available; fulltext restricted to subscribers or individual document purchasers 

Compendex 

INSPEC 

Google scholar 

Google book search 

Mode of access: World Wide Web 

System requirements: Adobe Acrobat Reader 

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. Largescale 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 peertopeer solutions 

Also available in print 
主題 
Electronic data processing  Distributed processing  Mathematical models


distributed computing


algorithmics


cooperative computing


faulttolerance


complexity and lower bounds

Alt Author 
Shvartsman, Alex Allister

