Introduction to Distributed Algorithms

Gerard Tel

• Publisher: Cambridge University Press
• Year: 2000
• Print ISBN: 9780521794831
• eBook ISBN: 9781107299399
• Edition: 2
• Topic: Informatique
• Subtopic: Sciences générales de l'informatique

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.

Table of contents

• Cover
• Title
• Copyright
• Contents
• Preface
• 1 Introduction: Distributed Systems
• Part One: Protocols
• Part Two: Fundamental Algorithms
• Part Three: Fault Tolerance
• Part Four: Appendices
• References
• Index