Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
Introduction to Distributed Algorithms
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

Introduction to Distributed Algorithms

Introduction to Distributed Algorithms

Gerard Tel

596 pages, parution le 12/02/2002

Résumé

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.

Contents

  • Preface
  • 1. Introduction: distributed systems

Part I. Protocols:

  • 2. The model
  • 3. Communication protocols
  • 4. Routing algorithms
  • 5. Deadlock-free packet switching

Part II. Fundamental Algorithms:

  • 6. Waves and traversal algorithms
  • 7. Election algorithms
  • 8. Termination detection
  • 9. Anonymous networks
  • 10. Snapshots
  • 11. Sense of direction and orientation
  • 12. Synchrony in networks

Part III. Fault Tolerance:

  • 13. Fault tolerance in distributed systems
  • 14. Fault tolerance in asynchronous systems
  • 15. Fault tolerance in synchronous systems
  • 16. Failure detection
  • 17. Stabilization

Part IV. Appendices:

  • A. Pseudocode conventions
  • B. Graphs and networks
  • References
  • Index.

Caractéristiques techniques

  PAPIER
Éditeur(s) Cambridge University Press
Auteur(s) Gerard Tel
Parution 12/02/2002
Nb. de pages 596
Format 17,3 x 24,6
Couverture Broché
Poids 1152g
Intérieur Noir et Blanc
EAN13 9780521794831
ISBN13 978-0-521-79483-1

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.
Inscription