Cargando…
Distributed computing through combinatorial topology /
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, su...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Waltham, Mass. :
Morgan Kaufmann,
©2014.
|
| Edición: | 1st ed. |
| Temas: | |
| Acceso en línea: | Texto completo (Requiere registro previo con correo institucional) |
MARC
| LEADER | 00000cam a2200000Ia 4500 | ||
|---|---|---|---|
| 001 | OR_ocn870340082 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o d | ||
| 007 | cr unu|||||||| | ||
| 008 | 140212s2014 maua ob 001 0 eng d | ||
| 040 | |a UMI |b eng |e pn |c UMI |d COO |d DEBBG |d DEBSZ |d EBLCP |d OCLCQ |d MERUC |d OCLCF |d CEF |d OCLCQ |d AU@ |d OCLCQ |d OCLCO |d OCLCQ | ||
| 019 | |a 865333474 |a 966358288 | ||
| 020 | |a 9780124047280 | ||
| 020 | |a 0124047289 | ||
| 020 | |a 0124045782 | ||
| 020 | |a 9780124045781 | ||
| 020 | |z 9780124045781 | ||
| 029 | 1 | |a AU@ |b 000053310470 | |
| 029 | 1 | |a AU@ |b 000059642860 | |
| 029 | 1 | |a CHNEW |b 000899614 | |
| 029 | 1 | |a DEBBG |b BV041783849 | |
| 029 | 1 | |a DEBSZ |b 404335608 | |
| 029 | 1 | |a DEBSZ |b 431578656 | |
| 029 | 1 | |a DEBSZ |b 449402290 | |
| 029 | 1 | |a GBVCP |b 882725572 | |
| 029 | 1 | |a AU@ |b 000068473129 | |
| 029 | 1 | |a DKDLA |b 820120-katalog:9910110279705765 | |
| 035 | |a (OCoLC)870340082 |z (OCoLC)865333474 |z (OCoLC)966358288 | ||
| 037 | |a CL0500000382 |b Safari Books Online | ||
| 050 | 4 | |a QA76.9.D5 |b H473 2014 | |
| 082 | 0 | 4 | |a 004 |a 004.36 |a 004/.36 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Herlihy, Maurice. | |
| 245 | 1 | 0 | |a Distributed computing through combinatorial topology / |c Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum. |
| 250 | |a 1st ed. | ||
| 260 | |a Waltham, Mass. : |b Morgan Kaufmann, |c ©2014. | ||
| 300 | |a 1 online resource (1 volume) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 588 | 0 | |a Print version record. | |
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a Half Title; Title Page; Copyright; Dedication; Contents; Acknowledgments; Preface; 1 Introduction; 1.1 Concurrency Everywhere; 1.1.1 Distributed computing and topology; 1.1.2 Our approach; 1.1.3 Two ways of thinking about concurrency; 1.2 Distributed Computing; 1.2.1 Processes and protocols; 1.2.2 Communication; 1.2.3 Failures; 1.2.4 Timing; 1.2.5 Tasks; 1.3 Two Classic Distributed Computing Problems; 1.3.1 The muddy children problem; 1.3.2 The coordinated attack problem; 1.4 Chapter Notes; 1.5 Exercises; 2 Two-Process Systems; 2.1 Elementary Graph Theory. | |
| 505 | 8 | |a 2.1.1 Graphs, vertices, edges, and colorings2.1.2 Simplicial maps and connectivity; 2.1.3 Carrier maps; 2.1.4 Composition of maps; 2.2 Tasks; 2.2.1 Example: coordinated attack; 2.2.2 Example: consensus; 2.2.3 Example: approximate agreement; 2.3 Models of Computation; 2.3.1 The protocol graph; 2.3.2 The alternating message-passing model; 2.3.3 The layered message-passing model; 2.3.4 The layered read-write model; 2.4 Approximate Agreement; 2.5 Two-Process Task Solvability; 2.6 Chapter Notes; 2.7 Exercises; 3 Elements of Combinatorial Topology; 3.1 Basic Concepts; 3.2 Simplicial Complexes. | |
| 505 | 8 | |a 3.2.1 Abstract Simplicial Complexes and Simplicial Maps3.2.2 The Geometric View; 3.2.3 The topological view; 3.3 Standard Constructions; 3.3.1 Star; 3.3.2 Link; 3.3.3 Join; 3.4 Carrier Maps; 3.4.1 Chromatic complexes; 3.5 Connectivity; 3.5.1 Path connectivity; 3.5.2 Simply connected spaces; 3.5.3 Higher-dimensional connectivity; 3.6 Subdivisions; 3.6.1 Stellar subdivision; 3.6.2 Barycentric subdivision; 3.6.3 Standard chromatic subdivision; 3.6.4 Subdivision operators; 3.6.5 Mesh-shrinking subdivision operators; 3.7 Simplicial and Continuous Approximations; 3.8 Chapter Notes; 3.9 Exercises. | |
| 505 | 8 | |a 4 Colorless Wait-Free Computation4.1 Operational Model; 4.1.1 Overview; 4.1.2 Processes; 4.1.3 Configurations and executions; 4.1.4 Colorless tasks; 4.1.5 Protocols for colorless tasks; 4.2 Combinatorial Model; 4.2.1 Colorless tasks revisited; 4.2.2 Examples of colorless tasks; 4.2.3 Protocols revisited; 4.2.4 Protocol composition; 4.2.5 Single-layer colorless protocol complexes; 4.2.6 Multilayer protocol complexes; 4.3 The Computational Power of Wait-Free Colorless Immediate Snapshots; 4.3.1 Colorless task solvability; 4.3.2 Applications; 4.4 Chapter Notes; 4.5 Exercises. | |
| 505 | 8 | |a 5 Solvability of Colorless Tasks in Different Models5.1 Overview of Models; 5.2 t-Resilient Layered Snapshot Protocols; 5.3 Layered Snapshots with k-Set Agreement; 5.4 Adversaries; 5.5 Message-Passing Protocols; 5.5.1 Set agreement; 5.5.2 Barycentric agreement; 5.5.3 Solvability condition; 5.6 Decidability; 5.6.1 Paths and loops; 5.6.2 Loop agreement; 5.6.3 Examples of loop agreement tasks; 5.6.4 Decidability for layered snapshot protocols; 5.6.5 Decidability with k-set agreement; 5.7 Chapter Notes; 5.8 Exercises; 6 Byzantine-Resilient Colorless Computation; 6.1 Byzantine Failures. | |
| 520 | |a 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. | ||
| 590 | |a O'Reilly |b O'Reilly Online Learning: Academic/Public Library Edition | ||
| 650 | 0 | |a Electronic data processing |x Distributed processing |x Mathematics. | |
| 650 | 0 | |a Combinatorial topology. | |
| 650 | 6 | |a Traitement réparti |x Mathématiques. | |
| 650 | 6 | |a Topologie combinatoire. | |
| 650 | 7 | |a Combinatorial topology. |2 fast |0 (OCoLC)fst00868987 | |
| 700 | 1 | |a Kozlov, D. N. |q (Dmitriĭ Nikolaevich) | |
| 700 | 1 | |a Rajsbaum, Sergio. | |
| 776 | 0 | 8 | |i Print version: |a Herlihy, Maurice. |t Distributed computing through combinatorial topology. |d Amsterdam : Elsevier, [2014] |z 9780124045781 |w (DLC) 2013038781 |w (OCoLC)851417481 |
| 856 | 4 | 0 | |u https://learning.oreilly.com/library/view/~/9780124045781/?ar |z Texto completo (Requiere registro previo con correo institucional) |
| 938 | |a EBL - Ebook Library |b EBLB |n EBL1575559 | ||
| 994 | |a 92 |b IZTAP | ||