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...
Сохранить в:
| Главный автор: | |
|---|---|
| Другие авторы: | |
| Язык: | Undetermined English |
| Опубликовано: |
Amsterdam
Morgan Kaufmann, is an imprint of Elsevier
|
| Предметы: | |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Trà Vinh |
|---|
| Итог: | 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 |
|---|---|
| Объем: | xiv, 319 p. ill. 24 cm |
| Библиография: | Includes bibliographical references (pages 305-312) and index |
| ISBN: | 0124045782 9780124045781 |