Introduction to distributed algorithms / Gerard Tel.

(Visualizza formato Marc21)    (visualizza in BIBRAME 2.0)

Creatore:	Tel, Gerard
Titolo:	Introduction to distributed algorithms / Gerard Tel.
Link to work:	Introduction to distributed algorithms
Pubblicazione:	Cambridge [England] ; New York : Cambridge University Press, 2000
Edizione:	2nd ed.
Estensione:	1 online resource (xii, 596 pages)
Tipo formato:	computer
Tipo contenuto:	text
Tipo supporto:	online resource
Disciplina:	005.2/76
Genere/Forma:	Electronic books
Classificazione LOC:	QA76.9.D5 T44 2000eb
Contenuto supplementare:	Includes bibliographical references (pages 572-586) and index.
Nota di contenuto:	1 Introduction: distributed systems -- 1.2 Architecture and languages -- 1.3 Distributed algorithms -- 1.4 Outline of the book -- Part 1 Protocols -- 2 Model -- 2.1 Transition systems and algorithms -- 2.2 Proving properties of transition systems -- 2.3 Causal order of events and logical clocks -- 2.4 Additional assumptions, complexity -- 3 Communication protocols -- 3.1 Balanced sliding-window protocol -- 3.2 A timer-based protocol -- 4 Routing algorithms -- 4.1 Destination-based routing -- 4.2 All-pairs shortest-path problem -- 4.3 Netchange algorithm -- 4.4 Routing with compact routing tables -- 4.5 Hierarchical routing -- 5 Deadlock-free packet switching -- 5.2 Structured solutions -- 5.3 Unstructured solutions -- Part 2 Fundamental algorithms -- 6 Wave and traversal algorithms -- 6.1 Definition and use of wave algorithms -- 6.2 A collection of wave algorithms -- 6.3 Traversal algorithms -- 6.4 Time complexity: depth-first search -- 7 Election algorithms -- 7.2 Ring networks -- 7.3 Arbitrary networks -- 7.4 Korach-Kutten-Moran algorithm -- 8 Termination detection -- 8.2 Computation trees and forests -- 8.3 Wave-based solutions -- 9 Anonymous networks -- 9.2 Deterministic algorithms -- 9.3 A probabilistic election algorithm -- 9.4 Computing the network size -- 10 Snapshots -- 10.2 Two snapshot algorithms -- 10.3 Using snapshot algorithms -- 10.4 Application: deadlock detection -- 11 Sense of direction and orientation -- 11.2 Election in rings and chordal rings -- 11.3 Computing in hypercubes -- 11.4 Complexity-related issues -- 12 Synchrony in networks -- 12.2 Election in synchronous networks -- 12.3 Synchronizer algorithms -- 12.4 Application: breadth-first search -- 12.5 Archimedean assumption -- Part 3 Fault tolerance -- 13 Fault tolerance in distributed systems -- 13.1 Reasons for using fault-tolerant algorithms -- 13.2 Robust algorithms -- 13.3 Stabilizing algorithms -- 14 Fault tolerance in asynchronous systems -- 14.1 Impossibility of consensus -- 14.2 Initially dead processes -- 14.3 Deterministically achievable cases -- 14.4 Probabilistic consensus algorithms -- 14.5 Weak termination -- 15 Fault tolerance in synchronous systems -- 15.1 Synchronous decision protocols -- 15.2 Authenticating protocols -- 15.3 Clock synchronization -- 16 Failure detection -- 16.2 Solving consensus with a weakly accurate detector -- 16.3 Eventually weakly accurate detectors -- 16.4 Implementation of failure detectors -- 17 Stabilization -- 17.2 Graph algorithms -- 17.3 Methodology for stabilization -- A pseudocode conventions -- B Graphs and networks.
Restrizioni accesso:	Access is restricted to users affiliated with licensed institutions.
Sommario/riassunto:	"The second edition of this textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers." "The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications and fault tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still developing topics."--Jacket.
ISBN:	9781139168724
	113916872X
	0521794838
	9780521794831
Formato:	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione:	Inglese
Record Nr.:	004816628
Localizzazioni e accesso elettronico	https://ebookcentral.proquest.com/lib/nyulibrary-ebooks/detail.action?docID=3004765
Collocazione:	Electronic access
Lo trovi qui:	New York University

Altra ed. diverso supporto: Print version: Tel, Gerard. Introduction to distributed algorithms. 2nd ed. Cambridge [England] ; New York : Cambridge University Press, 2000 0521794838 (DLC) 00036292 (OCoLC)43729081