An edition of Cooperative task-oriented computing (2011)

Cooperative task-oriented computing

algorithms and complexity

by Chryssis Georgiou

0 Ratings
0 Want to read
0 Currently reading
0 Have read

Not in Library

My Reading Lists:

Use this Work

Create a new list

0 Ratings
0 Want to read
0 Currently reading
0 Have read

Check nearby libraries

Buy this book

Last edited by MARC Bot

March 6, 2023 | History

Edit

An edition of Cooperative task-oriented computing (2011)

Cooperative task-oriented computing

algorithms and complexity

by Chryssis Georgiou

0 Ratings
0 Want to read
0 Currently reading
0 Have read

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.

Publish Date

2011

Publisher

Morgan & Claypool

Language

English

Pages

155

Check nearby libraries

Buy this book

Previews available in: English

Showing 2 featured editions. View all 2 editions?

Edition	Availability
1 Cooperative task-oriented computing: algorithms and complexity 2011, Morgan & Claypool electronic resource : in English 1608452883 9781608452880	aaaa Not in Library Libraries near you: WorldCat
2 Cooperative Task-Oriented Computing: Algorithms and Complexity 2011, Springer International Publishing AG in English 3031008774 9783031008771	zzzz Not in Library Libraries near you: WorldCat

Add another edition?

Book Details

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: do-all 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 shared-memory model

3.2.1 Basic techniques for implementing allocation paradigms

3.2.2 Techniques for improving algorithm efficiency

3.3 Algorithmic techniques in the message-passing 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. Shared-memory 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 high-level 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. Message-passing algorithms

5.1 Solving do-all through shared-memory

5.1.1 Message-passing setting, quorums, and adversity

5.1.2 Shared-memory emulation service AM

5.1.3 The message-passing 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 do-all 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 do-all problem in other settings

6.1 Do-all with Byzantine processors

6.2 Do-all with broadcast channels

6.3 Do-all in partitionable networks

6.4 Do-all in the absence of communication

Bibliography

Authors' biographies

Index.

Edition 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.

Published in: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA)
Series: Synthesis lectures on distributed computing theory -- # 7
Other Titles: Synthesis digital library of engineering and computer science.

Classifications

Dewey Decimal Class: 004.36
Library of Congress: QA76.9.D5 G463 2011, QA76.9.D5 G46 2011

The Physical Object

Format: [electronic resource] :
Number of pages: 155

ID Numbers

Open Library: OL25568168M
Internet Archive: cooperativetasko00geor
ISBN 13: 9781608452880, 9781608452873
OCLC/WorldCat: 759114691

Source records

Internet Archive item record
Better World Books record
Better World Books record
marc_nuls MARC record
Internet Archive item record

Community Reviews (0)

Feedback?

No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Created July 30, 2014
3 revisions

Download catalog record: RDF / JSON

March 6, 2023	Edited by MARC Bot	import existing book
February 25, 2022	Edited by ImportBot	import existing book
July 30, 2014	Created by ImportBot	import new book

Cooperative task-oriented computing

algorithms and complexity

by Chryssis Georgiou