Distributed algorithms / Nancy A Lynch

Public ISBD Titre : Distributed algorithms Type de document : texte imprimé Auteurs : Nancy A Lynch (1918-1984), Auteur Editeur : San Francisco : Morgan Kaufmann Année de publication : cop. 1997 Collection : The Morgan Kaufmann series in data management systems ISBN/ISSN/EAN : 978-1-55860-348-6 Langues : Anglais (eng) Catégories : Informatique Informatique:programmes Informatique:programmes:Programmation Mots-clés : Computer algorithms  Electronic data processing  Distributed processing  Traitement réparti  Algorithmes  Programmation Index. décimale : 005.1 Programmation Résumé : In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others. Distributed algorithms [texte imprimé] / Nancy A Lynch (1918-1984), Auteur . - San Francisco : Morgan Kaufmann, cop. 1997. - (The Morgan Kaufmann series in data management systems) . ISBN : 978-1-55860-348-6 Langues : Anglais (eng) Catégories : Informatique Informatique:programmes Informatique:programmes:Programmation Mots-clés : Computer algorithms  Electronic data processing  Distributed processing  Traitement réparti  Algorithmes  Programmation Index. décimale : 005.1 Programmation Résumé : In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others.

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
9781558603486MIT001	005.1/041	Livre	Maths&Informatique	Fonds informatique	Disponible

---

1 (1 - 1 / 1)