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...
Đã lưu trong:
| Tác giả chính: | |
|---|---|
| Tác giả khác: | |
| Ngôn ngữ: | Undetermined English |
| Được phát hành: |
Amsterdam
Morgan Kaufmann, is an imprint of Elsevier
|
| Những chủ đề: | |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Trà Vinh |
|---|
| LEADER | 01236nam a2200265Ia 4500 | ||
|---|---|---|---|
| 001 | TVU_20738 | ||
| 008 | 210423s9999 xx 000 0 und d | ||
| 020 | |a 0124045782 | ||
| 020 | |a 9780124045781 | ||
| 041 | |a eng | ||
| 082 | |a 4.36 | ||
| 082 | |b H206 | ||
| 100 | |a Herlihy, Maurice | ||
| 245 | 0 | |a Distributed computing through combinatorial topology | |
| 245 | 0 | |c Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum | |
| 260 | |a Amsterdam | ||
| 260 | |b Morgan Kaufmann, is an imprint of Elsevier | ||
| 300 | |a xiv, 319 p. | ||
| 300 | |b ill. | ||
| 300 | |c 24 cm | ||
| 504 | |a Includes bibliographical references (pages 305-312) and index | ||
| 520 | |a 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 | ||
| 650 | |a Electronic data processing; Combinatorial topology | ||
| 700 | |a Maurice Herlihy; Dmitry Kozlov; Sergio Rajsbaum | ||
| 980 | |a Trung tâm Học liệu Trường Đại học Trà Vinh | ||