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...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Övriga upphovsmän: | |
| Språk: | Undetermined English |
| Publicerad: |
Amsterdam
Morgan Kaufmann, is an imprint of Elsevier
|
| Ämnen: | |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Trà Vinh |
|---|
| Sammanfattning: | 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 |
|---|---|
| Fysisk beskrivning: | xiv, 319 p. ill. 24 cm |
| Bibliografi: | Includes bibliographical references (pages 305-312) and index |
| ISBN: | 0124045782 9780124045781 |