Distributed Computing Through Combinatorial Topology, 1st Edition,Maurice Herlihy,Dmitry Kozlov,Sergio Rajsbaum,ISBN9780124045781
Add to Wish List
 
 
 

Distributed Computing Through Combinatorial Topology, 1st Edition

Print Book

Author(s) :   &      &      

Expected Release Date:

Imprint: Morgan Kaufmann

ISBN: 9780124045781

Pages: 320

Dimensions: 235 X 191

Award-winning techniques to analyze distributed algorithms, with applications across a range of today's top computing fields

Buy print & eBook together
and save 40%

Add to Cart

Print Book Estimated Delivery Time

Paperback

USD 89.95
USD 67.46

Not Yet Available

 
 

Key Features

  • Leaders in distributed computing present unique insights that prove new results about computation that are applicable across today's computing topics including multicore microprocessors, wireless networks, distributed systems, and internet protocols.
  • Synthesizes and distills material into a simple, unified presentation with examples, illustrations, exercises, and lecture slides
  • Self-contained approach that assumes only a knowledge of a few standard topics
  • Material tested in author's courses at Technion provides necessary math and computing for those in either discipline

Description

Combinatorial Topology and Distributed Computing 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 often terse, and often using 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 which 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.

Maurice Herlihy

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ö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.

Affiliations and Expertise

Brown University, Providence, RI, USA

Dmitry Kozlov

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.

Affiliations and Expertise

University of Bremen, Germany

Sergio Rajsbaum

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.

Affiliations and Expertise

Institute of Mathematics at Universidad Nacional Autonoma de Mexico

Distributed Computing Through Combinatorial Topology, 1st Edition

Introduction

1. Elements of combinatorial topology

2. Distributed computing

3. Manifolds, impossibility and separation

4. Connectivity

5. Colorless tasks

6. Adversaries and colorless tasks

7. Colored tasks

8. Renaming

9. Chains and chain maps

10. Classifying loop agreement tools

11. Immediate snapshot subdivisions

»
Distributed Computing Through Combinatorial Topology