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
|
| Θέματα: | |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
| 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 |