Distributed computing through combinatorial topology
Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, su...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Autres auteurs: | |
| Langue: | Undetermined English |
| Publié: |
Amsterdam
Morgan Kaufmann, is an imprint of Elsevier
|
| Sujets: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Trà Vinh |
|---|
| Résumé: | Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols |
|---|---|
| Description matérielle: | xiv, 319 p. ill. 24 cm |
| Bibliographie: | Includes bibliographical references (pages 305-312) and index |
| ISBN: | 0124045782 9780124045781 |