MARC details
| 000 -LEADER |
|---|
| fixed length control field |
01824nam a2200241Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520102826.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250520s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780124045781 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 76.9 .H47 2014 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Herlihy, Maurice |
| Relator term |
author |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Distributed computing through combinatorial topology / |
| Statement of responsibility, etc. |
Maurice Herlihy, Dmitry Kozlov and Sergio Rajsbaum |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Waltham, MA. : |
| Name of publisher, distributor, etc. |
Elsevier Inc., |
| Date of publication, distribution, etc. |
c2014 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xiv, 319 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
24 cm. |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
USD67.8 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references and index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
I. Fundamentals -- 1. Introduction -- 2. Two-process systems -- 3. Elements of combinatorial topology -- II. Colorless tasks -- 4. Colorless wait-free computation -- 5. Solvability of colorless tasks -- 6. Byzantine colorless computation -- 7. Simulations and reductions -- III. General tasks -- 8. Read-write protocols for general tasks -- 9. Manifold protocols -- 10. Connectivity -- 11. Wait-free computability for general tasks -- IV. Advanced topics -- 12. Renaming and oriented manifolds -- 13. Task solvability in different communication models -- 14. Colored simulations and reductions -- 15. Classifying loop agreement tasks -- 16. Immediate snapshot subdivisions. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
ELECTRONIC DATA PROCESSING -- DISTRIBUTED PROCESSING -- MATHEMATICS |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Kozlov, Dmitry;Rajsbaum, Sergio |
| Relator term |
co-author;co-author |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Books |
