Introduction to Distributed Algorithms - Info and Reading Options
By Gerard Tel
"Introduction to Distributed Algorithms" was published by Cambridge University Press in 2012 - West Nyack, it has 1 pages and the language of the book is English.
“Introduction to Distributed Algorithms” Metadata:
- Title: ➤ Introduction to Distributed Algorithms
- Author: Gerard Tel
- Language: English
- Number of Pages: 1
- Publisher: Cambridge University Press
- Publish Date: 2012
- Publish Location: West Nyack
“Introduction to Distributed Algorithms” Subjects and Themes:
- Subjects: Computer algorithms - Electronic data processing - Distributed processing - Congresses - Electronic data processing, distributed processing
Edition Identifiers:
- The Open Library ID: OL34478384M - OL3479197W
- ISBN-13: 9781139168724
- All ISBNs: 9781139168724
AI-generated Review of “Introduction to Distributed Algorithms”:
Snippets and Summary:
This chapter gives reasons for the study of distributed algorithms by briefly introducing the types of hardware and software systems for which distributed algorithms have been developed.
"Introduction to Distributed Algorithms" Description:
Open Data:
Cover -- Title -- Copyright -- Contents -- Preface -- 1 Introduction: Distributed Systems -- 1.1 What is a Distributed System? -- 1.2 Architecture and Languages -- 1.3 Distributed Algorithms -- 1.4 Outline of the Book -- Part One: Protocols -- 2 The 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 -- Exercises to Chapter 2 -- 3 Communication Protocols -- 3.1 The Balanced Sliding-window Protocol -- 3.2 A Timer-based Protocol -- Exercises to Chapter 3 -- 4 Routing Algorithms -- 4.1 Destination-based Routing -- 4.2 The All-pairs Shortest-path Problem -- 4.3 The Netchange Algorithm -- 4.4 Routing with Compact Routing Tables -- 4.5 Hierarchical Routing -- Exercises to Chapter 4 -- 5 Deadlock-free Packet Switching -- 5.1 Introduction -- 5.2 Structured Solutions -- 5.3 Unstructured Solutions -- 5.4 Further Issues -- Exercises to Chapter 5 -- Part Two: Fundamental Algorithms -- 6 Wave and Traversal Algorithms -- 6.1 Definition and Use of Wave Algorithms -- 6.2 A Collection o f Wave Algorithms -- 6.3 Traversal Algorithms -- 6.4 Time Complexity: Depth-first Search -- 6.5 Remaining Issues -- Exercises to Chapter 6 -- 7 Election Algorithms -- 7.1 Introduction -- 7.2 Ring Networks -- 7.3 Arbitrary Networks -- 7.4 The Korach-Kutten-Moran Algorithm -- Exercises to Chapter 7 -- 8 Termination Detection -- 8.1 Preliminaries -- 8.2 Computation Trees and Forests -- 8.3 Wave-based Solutions -- 8.4 Other Solutions -- Exercises to Chapter 8 -- 9 Anonymous Networks -- 9.1 Preliminaries -- 9.2 Deterministic Algorithms -- 9.3 A Probabilistic Election Algorithm -- 9.4 Computing the Network Size -- Exercises to Chapter 9 -- 10 Snapshots -- 10.1 Preliminaries -- 10.2 Two Snapshot Algorithms -- 10.3 Using Snapshot Algorithms
Read “Introduction to Distributed Algorithms”:
Read “Introduction to Distributed Algorithms” by choosing from the options below.
Search for “Introduction to Distributed Algorithms” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Introduction to Distributed Algorithms” in Libraries Near You:
Read or borrow “Introduction to Distributed Algorithms” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Introduction to Distributed Algorithms” at a library near you.
Buy “Introduction to Distributed Algorithms” online:
Shop for “Introduction to Distributed Algorithms” on popular online marketplaces.
- Ebay: New and used books.
