Distributed Algorithms for Message-Passing Systems (Record no. 47149)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05122nam a22005177a 4500 |
| 001 - CONTROL NUMBER | |
| control field | sulb-eb0025057 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | BD-SySUS |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20160413122508.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 130703s2013 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783642381232 |
| -- | 978-3-642-38123-2 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-642-38123-2 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA75.5-76.95 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UY |
| Source | bicssc |
| Subject category code | UYA |
| Source | bicssc |
| Subject category code | COM014000 |
| Source | bisacsh |
| Subject category code | COM031000 |
| Source | bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Raynal, Michel. |
| Relator term | author. |
| 245 10 - TITLE STATEMENT | |
| Title | Distributed Algorithms for Message-Passing Systems |
| Medium | [electronic resource] / |
| Statement of responsibility, etc. | by Michel Raynal. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Place of production, publication, distribution, manufacture | Berlin, Heidelberg : |
| Name of producer, publisher, distributor, manufacturer | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2013. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XXXI, 500 p. |
| Other physical details | online resource. |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Content type code | txt |
| Source | rdacontent |
| 337 ## - MEDIA TYPE | |
| Media type term | computer |
| Media type code | c |
| Source | rdamedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | online resource |
| Carrier type code | cr |
| Source | rdacarrier |
| 347 ## - DIGITAL FILE CHARACTERISTICS | |
| File type | text file |
| Encoding format | |
| Source | rda |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Part I Distributed Graph Algorithms -- Chap. 1 Base Definitions and Network Traversal Algorithms -- Chap. 2 Distributed Graph Algorithms -- Chap. 3 An Algorithmic Framework to Compute Global Functions on a Process Graph -- Chap. 4 Leader Election Algorithms -- Chap. 5 Mobile Objects Navigating a Network -- Part II Logical Time and Global States in Distributed Systems -- Chap. 6 Nature of Distributed Computations and the Concept of a Global State -- Chap. 7 Logical Time in Asynchronous Distributed Systems -- Chap. 8 Asynchronous Distributed Checkpointing -- Chap. 9 Simulating Synchrony on Top of Asynchronous Systems -- Part III Mutual Exclusion and Resource Allocation -- Chap. 10 Permission-Based Mutual Exclusion Algorithms -- Chap. 11 Distributed Resource Allocation -- Part IV High-Level Communication Abstractions -- Chap. 12 Order Constraints on Message Delivery -- Chap. 13 Rendezvous and Synchronous Communication -- Part V Detection of Properties on Distributed Executions -- Chap. 14 Distributed Termination Detection -- Chap. 15 Distributed Deadlock Detection -- Part VI Distributed Shared Memory -- Chap. 16 Atomic Consistency (Linearizability) -- Chap. 17 Sequential Consistency -- Afterword -- Bibliography -- Index. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem. In particular each entity cooperating towards the common goal cannot have an instantaneous knowledge of the current state of the other entities. Whereas parallel computing is mainly concerned with 'efficiency', and real-time computing is mainly concerned with 'on-time computing', distributed computing is mainly concerned with 'mastering uncertainty' created by issues such as the multiplicity of control flows, asynchronous communication, unstable behaviors, mobility, and dynamicity. While some distributed algorithms consist of a few lines only, their behavior can be difficult to understand and their properties hard to state and prove. The aim of this book is to present in a comprehensive way the basic notions, concepts, and algorithms of distributed computing when the distributed entities cooperate by sending and receiving messages on top of an asynchronous network. The book is composed of seventeen chapters structured into six parts: distributed graph algorithms, in particular what makes them different from sequential or parallel algorithms; logical time and global states, the core of the book; mutual exclusion and resource allocation; high-level communication abstractions; distributed detection of properties; and distributed shared memory. The author establishes clear objectives per chapter and the content is supported throughout with illustrative examples, summaries, exercises, and annotated bibliographies. This book constitutes an introduction to distributed computing and is suitable for advanced undergraduate students or graduate students in computer science and computer engineering, graduate students in mathematics interested in distributed computing, and practitioners and engineers involved in the design and implementation of distributed applications. The reader should have a basic knowledge of algorithms and operating systems. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| Topical term or geographic name as entry element | Computer hardware. |
| Topical term or geographic name as entry element | Computer communication systems. |
| Topical term or geographic name as entry element | Computer programming. |
| Topical term or geographic name as entry element | Computers. |
| Topical term or geographic name as entry element | Computer Science. |
| Topical term or geographic name as entry element | Theory of Computation. |
| Topical term or geographic name as entry element | Computer Communication Networks. |
| Topical term or geographic name as entry element | Programming Techniques. |
| Topical term or geographic name as entry element | Computer Hardware. |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Printed edition: |
| International Standard Book Number | 9783642381225 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="http://dx.doi.org/10.1007/978-3-642-38123-2">http://dx.doi.org/10.1007/978-3-642-38123-2</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | |
| Koha item type | |
No items available.