Cover image for Distributed computing through combinatorial topology
Title:
Distributed computing through combinatorial topology
Personal Author:
Publication Information:
Amsterdam : Morgan Kaufmann, is an imprint of Elsevier, 2014
Physical Description:
xiv, 319 pages : illustrations ; 24 cm.
ISBN:
9780124045781

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010329063 QA76.9.D5 H47 2014 Open Access Book Book
Searching...
Searching...
33000000017578 QA76.9.D5 H47 2014 Open Access Book Book
Searching...

On Order

Summary

Summary

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.


Author Notes

Maurice Herlihy received an A.B. in Mathematics from Harvard University, and a Ph.D. in Computer Science from M.I.T. He has served on the faculty of Carnegie Mellon University, on the staff of DEC Cambridge Research Lab, and is currently a Professor in the Computer Science Department at Brown University. Maurice Herlihy is an ACM Fellow, and is the recipient of the 2003 Dijkstra Prize in Distributed Computing. He shared the 2004 G#65533;del Prize with Nir Shavit, the highest award in theoretical computer science. In 2012 he shared the Edsger W. Dijkstra Prize In Distributed Computing with Nir Shavit.

Prof. Dmitry Kozlov is recipient of the Wallenberg Prize of the Swedish Mathematics Society (2003), the Gustafsson Prize of the Goran Gustafsson Foundation (2004), and the European Prize in Combinatorics (2005). He has been a Senior Lecturer at the Royal Institute of Technology, Stockholm, and an Assistant Professor at ETH Zurich. Currently he holds the Chair of Algebra and Geometry at the University of Bremen, Germany. He is the author of the book Combinatorial Algebraic Topology published by Springer Verlag in 2008.

Prof. Sergio Rajsbaum is a member of the Institute of Mathematics at UNAM, where he is now a Full Professor. He has spent postdoctoral and sabbatical stays at the Massachusetts Institute of Technology and HP Research Labs. His main research interests are in the theory of distributed computing, and has about 100 publications in prestigious conferences and journals, and has been Program Committee member, and Program Chair of main forums in the area, such as the ACM Principles of Distributed Computing.


Table of Contents

I Fundamentals
1 Introduction
2 Two-Process Systems
3 Elements of Combinatorial Topology
II Colorless Tasks
4 Colorless Wait-free Computation
5 Solvability of Colorless Tasks
6 Byzantine Colorless Computation
7 Simulations and Reductions
III General Tasks
8 Read-Write Protocols for General Tasks
9 Manifold Protocols
10 Connectivity
11 Wait-Free Computability for General Tasks
IV Advanced Topics
12 Renaiming and Oriented Manifolds
13 Task Solvability in Different Communication Models
14 Colored Simulations and Reductions
15 Classifying Loop Agreement Tasks
16 Immediate Snapshot Subdivisions