Kids Library Home

Welcome to the Kids' Library!

Search for books, movies, music, magazines, and more.

Available items only
Print Material
Author Herlihy, Maurice, author.

Title Distributed computing through combinatorial topology / Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum.

Publication Info. Amsterdam ; Boston : Elsevier/Morgan Kaufmann, [2014]


Location Call No. OPAC Message Status
 Axe Elsevier ScienceDirect Ebook  Electronic Book    ---  Available
 Axe Elsevier ScienceDirect Ebook    ---  Available
Description 1 online resource (xiv, 319 pages) : illustrations (some color)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
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. Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understandingPresents 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.
Bibliography Includes bibliographical references and index.
Note Print version record.
Contents Part I. Fundamentals -- part II. Colorless tasks -- part III. General tasks -- part IV. Advanced topics.
Subject Electronic data processing -- Distributed processing -- Mathematics.
Combinatorial topology.
Traitement réparti -- Mathématiques.
Topologie combinatoire.
COMPUTERS -- Computer Literacy.
COMPUTERS -- Computer Science.
COMPUTERS -- Data Processing.
COMPUTERS -- Hardware -- General.
COMPUTERS -- Information Technology.
COMPUTERS -- Machine Theory.
COMPUTERS -- Reference.
Combinatorial topology. (OCoLC)fst00868987
Added Author Kozlov, D. N. (Dmitri Nikolaevich), author.
Rajsbaum, Sergio, author.
Other Form: Print version: Herlihy, Maurice. Distributed computing through combinatorial topology. Amsterdam : Elsevier, [2014] 9780124045781 (DLC) 2013038781 (OCoLC)851417481
ISBN 9780124047280 (electronic bk.)
0124047289 (electronic bk.)
9780124045781 (alk. paper)
0124045782 (alk. paper)
Standard No. CHNEW 001011619
DEBBG BV042314371
DEBSZ 405352352
NZ1 15342332

Available items only