Distributed Computing Through Combinatorial Topology (Paperback)

Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum

  • 出版商: Morgan Kaufmann
  • 出版日期: 2013-12-05
  • 售價: $3,080
  • 貴賓價: 9.5$2,926
  • 語言: 英文
  • 頁數: 336
  • 裝訂: Paperback
  • ISBN: 0124045782
  • ISBN-13: 9780124045781
  • 海外代購書籍(需單獨結帳)

買這商品的人也買了...

商品描述

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.

  • Named a 2013 Notable Computer Book for Computing Methodologies by Computing Reviews
  • Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understanding
  • Presents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols
  • Synthesizes and distills material into a simple, unified presentation with examples, illustrations, and exercises

商品描述(中文翻譯)

《通過組合拓撲進行分散計算》描述了基於獲獎的組合拓撲研究的分散算法分析技術。作者們提供了一個堅實的理論基礎,適用於許多依賴於並行性和不可預測延遲的實際系統,例如多核微處理器、無線網絡、分散系統和互聯網協議。

如今,新的學生或研究人員必須收集一系列分散的會議論文,這些論文通常簡潔並使用不同的符號和術語。本書為具有計算機科學背景的讀者提供了數學的自包含解釋,同時也向應用數學背景的讀者解釋了計算機科學概念。第一部分介紹了數學概念和模型,包括消息傳遞和共享內存系統、故障和時間模型。下一部分在兩章中介紹了核心概念:首先證明一個簡單的結果,並通過例子和圖片建立讀者的直覺;然後將概念推廣以證明一個更複雜的結果。整體結果以逐漸且直觀吸引人的方式編織和發展了該領域的基本概念。本書的最後一部分討論了高級主題,通常在研究生課程中出現,供希望進一步探索的讀者使用。

- 2013年被《Computing Reviews》評為重要的計算方法學計算機書籍
- 以一致的符號和標準方法收集散落在研究和會議論文中的知識,以促進理解
- 提供適用於多個計算領域的獨特見解,包括多核微處理器、無線網絡、分散系統和互聯網協議
- 將材料綜合並提煉成簡單、統一的呈現方式,並附有例子、插圖和練習題