Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
Distributed Computing Through Combinatorial Topology
Taschenbuch von Maurice Herlihy (u. a.)
Sprache: Englisch

79,70 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 4-7 Werktage

Produkt Anzahl: Gib den gewünschten Wert ein oder benutze die Schaltflächen um die Anzahl zu erhöhen oder zu reduzieren.
Kategorien:
Beschreibung
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.

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.

Inhaltsverzeichnis
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

Details
Erscheinungsjahr: 2013
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: Kartoniert / Broschiert
ISBN-13: 9780124045781
ISBN-10: 0124045782
Sprache: Englisch
Herstellernummer: C2011-0-07032-1
Autor: Herlihy, Maurice
Kozlov, Dmitry
Rajsbaum, Sergio
Hersteller: Morgan Kaufmann
Verantwortliche Person für die EU: preigu, Ansas Meyer, Lengericher Landstr. 19, D-49078 Osnabrück, mail@preigu.de
Maße: 16 x 191 x 235 mm
Von/Mit: Maurice Herlihy (u. a.)
Erscheinungsdatum: 20.01.2014
Gewicht: 0,686 kg
Artikel-ID: 131638696
Inhaltsverzeichnis
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

Details
Erscheinungsjahr: 2013
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: Kartoniert / Broschiert
ISBN-13: 9780124045781
ISBN-10: 0124045782
Sprache: Englisch
Herstellernummer: C2011-0-07032-1
Autor: Herlihy, Maurice
Kozlov, Dmitry
Rajsbaum, Sergio
Hersteller: Morgan Kaufmann
Verantwortliche Person für die EU: preigu, Ansas Meyer, Lengericher Landstr. 19, D-49078 Osnabrück, mail@preigu.de
Maße: 16 x 191 x 235 mm
Von/Mit: Maurice Herlihy (u. a.)
Erscheinungsdatum: 20.01.2014
Gewicht: 0,686 kg
Artikel-ID: 131638696
Sicherheitshinweis

Ähnliche Produkte

Ähnliche Produkte