Distributed algorithms
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 algorithm...
Autor principal: | |
---|---|
Formato: | Libro electrónico |
Idioma: | Inglés |
Publicado: |
San Francisco :
Morgan Kaufmann Publishers
c1996.
|
Edición: | 1st edition |
Colección: | Morgan Kaufmann series in data management systems.
|
Materias: | |
Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009627592406719 |
Sumario: | 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 |
---|---|
Notas: | Description based upon print version of record. |
Descripción Física: | 1 online resource (899 p.) |
Bibliografía: | Includes bibliographical references (p. [829]-856) and index. |
ISBN: | 9781281035288 9786611035280 9780080504704 |