Introduction to Distributed Algorithms

By: No Information Available

Write A Review

Paperback | 15 November 2000 | Edition Number 2

At a Glance

Paperback
612 Pages

Edition Type
Revised

Dimensions(cm)
24.61 x 18.9 x 3.15

Paperback

RRP $131.95

$125.99

or 4 interest-free payments of $31.50 with

or

Ships in 5 to 7 business days

Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful 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 (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), 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.

Industry Reviews

"...an excellent overview of available techniques." Computing Reviews "The book provides an up-to-date introduction to both distributed algorithms, and to the theory behind these algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, while the coverage is sufficiently deep to make it useful for practising engineers and researchers." Mathematical Reviews "Provides a very decent interesting to significant topics of the theory of Distributed Computing, and it is especially suitable as both a reference book and a textbook." SIGACT News "...a nice textbook...I recommend this book for readers who are interested in a theoretical view of distributed control algorithms." IEEE Parallel & Distributed Technology

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

More in Mathematical Theory of Computation

Crypto Engine Design : Cyber Shorts - Wen-Long Chin

$81.75

38%
OFF

Discrete Mathematics for Computing

Grassroots

Paperback

RRP $130.00

$117.75

Effective Machine Learning Teams

Best Practices for ML Practitioners

Paperback

RRP $152.00

$73.75

51%
OFF

AI Engineering : Building Applications with Foundation Models - Chip Huyen

$73.75

51%
OFF

Mathematics for Artificial Intelligence

Textbooks in Mathematics

Paperback

RRP $90.99

$82.75

Unveiling the Art of Steganography

A Modern Approach

Hardcover

RRP $231.00

$202.75

12%
OFF

Introduction to Modern Cryptography

Chapman & Hall/Crc Cryptography and Network Security

Hardcover

RRP $242.00

$233.75

Introduction to Modern Cryptography : Revised Third Edition - Jonathan Katz

$73.75

51%
OFF

Hands-On Generative AI with Transformers and Diffusion Models

Paperback

RRP $152.00

$73.75

51%
OFF

Machine Learning Pocket Reference

Working with Structured Data in Python

Paperback

RRP $57.00

$30.75

46%
OFF

Preface	p. xi
Introduction: Distributed Systems	p. 1
What is a Distributed System?	p. 2
Architecture and Languages	p. 18
Distributed Algorithms	p. 26
Outline of the Book	p. 36
Protocols	p. 41
The Model	p. 43
Transition Systems and Algorithms	p. 44
Proving Properties of Transition Systems	p. 50
Causal Order of Events and Logical Clocks	p. 54
Additional Assumptions, Complexity	p. 64
Exercises to Chapter 2	p. 71
Communication Protocols	p. 74
The Balanced Sliding-window Protocol	p. 76
A Timer-based Protocol	p. 85
Exercises to Chapter 3	p. 101
Routing Algorithms	p. 103
Destination-based Routing	p. 105
The All-pairs Shortest-path Problem	p. 110
The Netchange Algorithm	p. 123
Routing with Compact Routing Tables	p. 132
Hierarchical Routing	p. 149
Exercises to Chapter 4	p. 153
Deadlock-free Packet Switching	p. 155
Introduction	p. 156
Structured Solutions	p. 158
Unstructured Solutions	p. 167
Further Issues	p. 171
Exercises to Chapter 5	p. 176
Fundamental Algorithms	p. 179
Wave and Traversal Algorithms	p. 181
Definition and Use of Wave Algorithms	p. 182
A Collection of Wave Algorithms	p. 190
Traversal Algorithms	p. 202
Time Complexity: Depth-first Search	p. 208
Remaining Issues	p. 217
Exercises to Chapter 6	p. 224
Election Algorithms	p. 227
Introduction	p. 228
Ring Networks	p. 232
Arbitrary Networks	p. 245
The Korach-Kutten-Moran Algorithm	p. 260
Exercises to Chapter 7	p. 266
Termination Detection	p. 268
Preliminaries	p. 270
Computation Trees and Forests	p. 276
Wave-based Solutions	p. 284
Other Solutions	p. 299
Exercises to Chapter 8	p. 305
Anonymous Networks	p. 307
Preliminaries	p. 309
Deterministic Algorithms	p. 317
A Probabilistic Election Algorithm	p. 323
Computing the Network Size	p. 327
Exercises to Chapter 9	p. 332
Snapshots	p. 335
Preliminaries	p. 336
Two Snapshot Algorithms	p. 340
Using Snapshot Algorithms	p. 344
Application: Deadlock Detection	p. 349
Exercises to Chapter 10	p. 355
Sense of Direction and Orientation	p. 356
Introduction and Definitions	p. 357
Election in Rings and Chordal Rings	p. 364
Computing in Hypercubes	p. 374
Complexity-related Issues	p. 386
Conclusions and Open Questions	p. 392
Exercises to Chapter 11	p. 394
Synchrony in Networks	p. 396
Preliminaries	p. 397
Election in Synchronous Networks	p. 404
Synchronizer Algorithms	p. 408
Application: Breadth-first Search	p. 414
The Archimedean Assumption	p. 420
Exercises to Chapter 12	p. 421
Fault Tolerance	p. 425
Fault Tolerance in Distributed Systems	p. 427
Reasons for Using Fault-tolerant Algorithms	p. 427
Robust Algorithms	p. 429
Stabilizing Algorithms	p. 435
Fault Tolerance in Asynchronous Systems	p. 437
Impossibility of Consensus	p. 437
Initially Dead Processes	p. 442
Deterministically Achievable Cases	p. 445
Probabilistic Consensus Algorithms	p. 451
Weak Termination	p. 462
Exercises to Chapter 14	p. 466
Fault Tolerance in Synchronous Systems	p. 469
Synchronous Decision Protocols	p. 470
Authenticating Protocols	p. 481
Clock Synchronization	p. 493
Exercises to Chapter 15	p. 502
Failure Detection	p. 505
Model and Definitions	p. 506
Solving Consensus with a Weakly Accurate Detector	p. 510
Eventually Weakly Accurate Detectors	p. 511
Implementation of Failure Detectors	p. 515
Exercises to Chapter 16	p. 518
Stabilization	p. 520
Introduction	p. 521
Graph Algorithms	p. 526
Methodology for Stabilization	p. 535
Exercises to Chapter 17	p. 547
Appendices	p. 549
Pseudocode Conventions	p. 551
Graphs and Networks	p. 556
References	p. 572
Index	p. 587
Table of Contents provided by Syndetics. All Rights Reserved.

Introduction to Distributed Algorithms

At a Glance

Paperback

Industry Reviews

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematical Theory of Computation

Crypto Engine Design

Cyber Shorts

Crypto Engine Design

Cyber Shorts

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Discrete Mathematics for Computing

Grassroots

Effective Machine Learning Teams

Best Practices for ML Practitioners

AI Engineering

Building Applications with Foundation Models

Machine Learning Interviews

Kickstart Your Machine Learning Career

Mathematics for Artificial Intelligence

Textbooks in Mathematics

Unveiling the Art of Steganography

A Modern Approach

Introduction to Modern Cryptography

Chapman & Hall/Crc Cryptography and Network Security

Introduction to Modern Cryptography

Revised Third Edition

AI Value Creators

Beyond the Generative AI User Mindset

Hands-On Generative AI with Transformers and Diffusion Models

Machine Learning Pocket Reference

Working with Structured Data in Python

A Mathematical Introduction to Data Science with Python

Exploring Computational Geometry

Theory and Python Implementations

Quantum Minds: Exploring Quantum Computing and AI Synergy

From Qubits to Neural Nets-A Journey into Intelligent Computation

Risk Measures

An Introduction to the Mathematical Theory

Risk Measures

An Introduction to the Mathematical Theory

Quantum Computing Cloth

Foundations and Practice

BIM Geometry with Julia Plasm—Functional Language for CAD Programming

Volume 1: Mathematics and Software Engineering

Computer Vision

Cognitive Models for Visual Commonsense

First Course in Algorithms Through Puzzles

This product is categorised by