Distributed computing through combinatorial topology
著者
書誌事項
Distributed computing through combinatorial topology
Morgan Kaufmann is an imprint of Elsevier, c2014
大学図書館所蔵 件 / 全9件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
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.
Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further.
目次
I. Fundamentals1. Introduction2. Two-Process Systems3. Elements of Combinatorial Topology
II. Colorless Tasks4. Colorless Wait-free Computation5. Solvability of Colorless Tasks6. Byzantine Colorless Computation7. Simulations and Reductions
III. General Tasks8. Read-Write Protocols for General Tasks9. Manifold Protocols10. Connectivity11. Wait-Free Computability for General Tasks
IV. Advanced Topics12. Renaiming and Oriented Manifolds13. Task Solvability in Different Communication Models14. Colored Simulations and Reductions15. Classifying Loop Agreement Tasks16. Immediate Snapshot Subdivisions
「Nielsen BookData」 より
