|
|
|
|
| LEADER |
03153nmm a2200541 u 4500 |
| 001 |
EB001918186 |
| 003 |
EBX01000000000000001081088 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210123 ||| eng |
| 020 |
|
|
|a 9780080504704
|
| 050 |
|
4 |
|a QA76.9.D5
|
| 100 |
1 |
|
|a Lynch, Nancy A.
|
| 245 |
0 |
0 |
|a Distributed algorithms
|c Nancy A. Lynch
|
| 260 |
|
|
|a San Francisco, Calif.
|b Morgan Kaufmann Publishers
|c 1996
|
| 300 |
|
|
|a xxiii, 872 pages
|b illustrations
|
| 505 |
0 |
|
|a Front Cover; Distributed Algorithms; Copyright Page; Contents; Preface; Chapter 1. Introduction; 1.1 The Subject Matter; 1.2 Our Viewpoint; 1.3 Overview of Chapters 2-25; 1.4 Bibliographic Notes; 1.5 Notation; Part I: Synchronous Network Algorithms; Chapter 2. Modelling I: Synchronous Network Model; Chapter 3. Leader Election in a Synchronous Ring; Chapter 4. Algorithms in General Synchronous Networks; Chapter 5. Distributed Consensus with Link Failures; Chapter 6. Distributed Consensus with Process Failures; Chapter 7. More Consensus Problems; Part II: Asynchronous Algorithms
|
| 505 |
0 |
|
|a Includes bibliographical references (pages 829-856) and index
|
| 653 |
|
|
|a Computer algorithms / fast
|
| 653 |
|
|
|a Traitement réparti
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Algorithms / fast
|
| 653 |
|
|
|a Computer algorithms / http://id.loc.gov/authorities/subjects/sh91000149
|
| 653 |
|
|
|a Electronic data processing / Distributed processing / fast
|
| 653 |
|
|
|a Algorithms / http://id.loc.gov/authorities/subjects/sh85003487
|
| 653 |
|
|
|a Computer Communication Networks
|
| 653 |
|
|
|a Algorithmes
|
| 653 |
|
|
|a Réseaux d'ordinateurs
|
| 653 |
|
|
|a Gedistribueerde gegevensverwerking / gtt
|
| 653 |
|
|
|a Electronic data processing / Distributed processing / http://id.loc.gov/authorities/subjects/sh85042293
|
| 653 |
|
|
|a algorithms / aat
|
| 653 |
|
|
|a Computer networks / fast
|
| 653 |
|
|
|a COMPUTERS / Client-Server Computing / bisacsh
|
| 653 |
|
|
|a Algoritmos e estruturas de dados / larpcal
|
| 653 |
|
|
|a Computer networks / http://id.loc.gov/authorities/subjects/sh85029513
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 490 |
0 |
|
|a The Morgan Kaufmann series in data management systems
|
| 015 |
|
|
|a GBB6H3856
|
| 776 |
|
|
|z 9781558603486
|
| 776 |
|
|
|z 0080504701
|
| 776 |
|
|
|z 1558603484
|
| 776 |
|
|
|z 9780080504704
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781558603486/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 384
|
| 082 |
0 |
|
|a 331
|
| 082 |
0 |
|
|a 004/.36
|
| 520 |
|
|
|a 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 pr
|