Herlihy, Maurice; Kozlov, Dmitry; Rajsbaum, Sergio
Distributed Computing Through Combinatorial Topology
### 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

*"synopsis" may belong to another edition of this title.*

"...there has not been a monograph that comprehensively covers the intersection of topology and distributed computing...This book thus finds its place for filling precisely this niche, and will be welcomed by readers..."--Computing Reviews,July 24 2014 "In Distributed Computing, the modern mathematical field of Combinatorial Topology finally finds a natural application space. This book elucidates this intriguing connection through a series of well thought out examples, making complex computational phenomena and the deep theorems seem intuitive even to the beginner. I highly recommend it to anyone who is interested in the fundamentals of computing, since asynchrony, the key phenomena this book explains, is bound to dominate computation and communication in years to come."-- Prof. Nir Shavit, Professor of Computer Science, Massachusetts Institute of Technology, Cambridge, MA "Written by the leading experts in this area, this book is a unique endeavor covering the exciting topic of understanding distributed computing through topology. The book will appeal to researchers in distributed computing and to mathematicians. --Prof. Hagit Attiya, Professor of Computer Science, Technion - Israel Institute of Technology "This book is a major contribution to distributed computing, integrated with algebraic topology. Based on the seminal work of the authors, it represents a collection of the most up-to-date results in the field, presented in a very progressive manner, from intuitions to detailed proofs and connections to fundamental mathematical concepts. -- ric Goubault, cea list and cole Polytechnique

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

*"About this title" may belong to another edition of this title.*

Published by
ELSEVIER SCIENCE TECHNOLOGY, United States
(2014)

ISBN 10: 0124045782
ISBN 13: 9780124045781

New
Paperback
Quantity Available: 1

Seller

Rating

**Book Description **ELSEVIER SCIENCE TECHNOLOGY, United States, 2014. Paperback. Book Condition: New. 234 x 190 mm. Language: English . Brand New Book. 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. Bookseller Inventory # AAZ9780124045781

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0124045782
ISBN 13: 9780124045781

New
Quantity Available: 3

Seller

Rating

**Book Description **Book Condition: New. This item is printed on demand. Bookseller Inventory # 19971224-n

More Information About This Seller | Ask Bookseller a Question

Published by
Elsevier Science & Technology 2013-03-01, San Francisco
(2013)

ISBN 10: 0124045782
ISBN 13: 9780124045781

New
paperback
Quantity Available: > 20

Seller

Rating

**Book Description **Elsevier Science & Technology 2013-03-01, San Francisco, 2013. paperback. Book Condition: New. Bookseller Inventory # 9780124045781

More Information About This Seller | Ask Bookseller a Question

Published by
Elsevier Science & Technology

ISBN 10: 0124045782
ISBN 13: 9780124045781

New
Paperback
Quantity Available: 1

Seller

Rating

**Book Description **Elsevier Science & Technology. Paperback. Book Condition: new. BRAND NEW, Distributed Computing Through Combinatorial Topology, Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum, 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. Bookseller Inventory # B9780124045781

More Information About This Seller | Ask Bookseller a Question

Published by
ELSEVIER SCIENCE TECHNOLOGY, United States
(2014)

ISBN 10: 0124045782
ISBN 13: 9780124045781

New
Paperback
Quantity Available: 1

Seller

Rating

**Book Description **ELSEVIER SCIENCE TECHNOLOGY, United States, 2014. Paperback. Book Condition: New. 234 x 190 mm. Language: English . Brand New Book. 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. Bookseller Inventory # AAZ9780124045781

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0124045782
ISBN 13: 9780124045781

New
Paperback
Quantity Available: 1

Seller

Rating

**Book Description **Paperback. Book Condition: New. Not Signed; 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. book. Bookseller Inventory # ria9780124045781_rkm

More Information About This Seller | Ask Bookseller a Question

Published by
Morgan Kaufmann
(2013)

ISBN 10: 0124045782
ISBN 13: 9780124045781

New
Paperback
Quantity Available: 1

Seller

Rating

**Book Description **Morgan Kaufmann, 2013. Paperback. Book Condition: New. Brand New Book. Shipping: Once your order has been confirmed and payment received, your order will then be processed. The book will be located by our staff, packaged and despatched to you as quickly as possible. From time to time, items get mislaid en route. If your item fails to arrive, please contact us first. We will endeavour to trace the item for you and where necessary, replace or refund the item. Please do not leave negative feedback without contacting us first. All orders will be dispatched within two working days. If you have any quesions please contact us. Bookseller Inventory # V9780124045781

More Information About This Seller | Ask Bookseller a Question

Published by
Elsevier Science & Technology

ISBN 10: 0124045782
ISBN 13: 9780124045781

New
Softcover
First Edition
Quantity Available: 1

Seller

Rating

**Book Description **Elsevier Science & Technology. Book Condition: New. Describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. This book presents a theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Num Pages: 336 pages, black & white illustrations. Category: (P) Professional & Vocational. Dimension: 191 x 235 x 16. Weight in Grams: 688. . 2013. 1st Edition. Paperback. . . . . . Bookseller Inventory # V9780124045781

More Information About This Seller | Ask Bookseller a Question

Published by
Morgan Kaufmann
(2014)

ISBN 10: 0124045782
ISBN 13: 9780124045781

New
Paperback
Quantity Available: 1

Seller

Rating

**Book Description **Morgan Kaufmann, 2014. Paperback. Book Condition: NEW. 9780124045781 336pp., Paperback, This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Bookseller Inventory # HTANDREE0893884

More Information About This Seller | Ask Bookseller a Question

Published by
Morgan Kaufmann
(2013)

ISBN 10: 0124045782
ISBN 13: 9780124045781

New
Softcover
Quantity Available: 1

Seller

Rating

**Book Description **Morgan Kaufmann, 2013. Book Condition: New. Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: "In Distributed Computing, the modern mathematical field of Combinatorial Topology finally finds a natural application space. This book elucidates this intriguing connection through a series of well thought out examples, making complex computational phenomena and the deep theorems seem intuitive even to the beginner. I highly recommend it to anyone who is interested in the fundamentals of computing, since asynchrony, the key phenomena this book explains, is bound to dominate computation and communication in years to come." - Prof. Nir Shavit, Professor of Computer Science, Massachusetts Institute of Technology, Cambridge, MA "Written by the leading experts in this area, this book is a unique endeavor covering the exciting topic of understanding distributed computing through topology. The book will appeal to researchers in distributed computing and to mathematicians." - Prof. Hagit Attiya, Professor of Computer Science, Technion - Israel Institute of Technology "This book is a major contribution to distributed computing, integrated with algebraic topology. Based on the seminal work of the authors, it represents a collection of the most up-to-date results in the field, presented in a very progressive manner, from intuitions to detailed proofs and connections to fundamental mathematical concepts." - ric Goubault, cea list and cole Polytechnique. Bookseller Inventory # ABE_book_new_0124045782

More Information About This Seller | Ask Bookseller a Question