KI-Beratung Beta

  • Produktbild: Herlihy, M: Distributed Computing Through Combinatorial Topo
  • Produktbild: Herlihy, M: Distributed Computing Through Combinatorial Topo

Herlihy, M: Distributed Computing Through Combinatorial Topo

Aus der Reihe Print on Demand

83,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

05.12.2013

Verlag

Elsevier LTD

Seitenzahl

334

Maße (L/B/H)

23,3/19,1/2,5 cm

Gewicht

686 g

Sprache

Englisch

ISBN

978-0-12-404578-1

Beschreibung

Rezension

"...very well-written. All the figures, examples, and illustrations serve nicely to explain various concepts...mathematicians and computer scientists both would equally benefit from this book...a new researcher in this area would find this book very helpful" --SIGACT News

"...the first systematic exposition of an approach to distributed computing based on tools of combinatorial topology.a valuable addition to the existing literature, it will be appreciated by many different categories of readers including university students and researchers in computers science as well as topologists interested in practical applications." --Zentralblatt MATH

"This outstanding book...explores the connections between distributed computation and topology in detail...systematically organizes material that previously was only available across a collection of conference and journal publications with inconsistent notations and terminology..." --Computing Reviews

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

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

05.12.2013

Verlag

Elsevier LTD

Seitenzahl

334

Maße (L/B/H)

23,3/19,1/2,5 cm

Gewicht

686 g

Sprache

Englisch

ISBN

978-0-12-404578-1

EU-Ansprechpartner

Elsevier B.V.
Radarweg 29
1043 NX Amsterdam
NL
nlinfo@elsevier.com

Herstelleradresse

Elsevier Limited (Morgan Kaufmann)
45 Gee Street
EC1V 3RS London
UK
emeadirect@elsevier.com

Ein neues Kapitel für Ihre Bücher

Ein neues Kapitel für Ihre Bücher

Schenken Sie Ihren alten Schätzen ein zweites Leben und erhalten Sie dafür eine Thalia Geschenkkarte.

Jetzt verkaufen
Jetzt verkaufen

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

Die Leseprobe wird geladen.
  • Produktbild: Herlihy, M: Distributed Computing Through Combinatorial Topo
  • Produktbild: Herlihy, M: Distributed Computing Through Combinatorial Topo
  • I. Fundamentals1. Introduction2. Two-Process Systems3. Elements of Combinatorial Topology

    II. Colorless Tasks4. Colorless Wait-free Computation5. Solvability of Colorless Tasks6. Byzantine Colorless Computation7. Simulations and Reductions

    III. General Tasks8. Read-Write Protocols for General Tasks9. Manifold Protocols10. Connectivity11. Wait-Free Computability for General Tasks

    IV. Advanced Topics12. Renaiming and Oriented Manifolds13. Task Solvability in Different Communication Models14. Colored Simulations and Reductions15. Classifying Loop Agreement Tasks16. Immediate Snapshot Subdivisions