LEADER 05899nam 22007095 450 001 9910437956803321 005 20200706220651.0 010 $a3-642-38123-5 024 7 $a10.1007/978-3-642-38123-2 035 $a(CKB)3710000000002582 035 $a(SSID)ssj0000960660 035 $a(PQKBManifestationID)11541873 035 $a(PQKBTitleCode)TC0000960660 035 $a(PQKBWorkID)10959315 035 $a(PQKB)10485691 035 $a(DE-He213)978-3-642-38123-2 035 $a(MiAaPQ)EBC6314192 035 $a(MiAaPQ)EBC1317690 035 $a(Au-PeEL)EBL1317690 035 $a(CaPaEBR)ebr10969013 035 $a(OCoLC)870244254 035 $a(PPN)172426782 035 $a(EXLCZ)993710000000002582 100 $a20130703d2013 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Algorithms for Message-Passing Systems /$fby Michel Raynal 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XXXI, 500 p.) 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-38122-7 327 $aPart 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. 330 $aDistributed 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. 606 $aComputers 606 $aComputer networks 606 $aComputer programming 606 $aComputer hardware 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aComputer Hardware$3https://scigraph.springernature.com/ontologies/product-market-codes/I1200X 615 0$aComputers. 615 0$aComputer networks. 615 0$aComputer programming. 615 0$aComputer hardware. 615 14$aTheory of Computation. 615 24$aComputer Communication Networks. 615 24$aProgramming Techniques. 615 24$aComputer Hardware. 676 $a004.36 700 $aRaynal$b Michel$4aut$4http://id.loc.gov/vocabulary/relators/aut$059942 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910437956803321 996 $aDistributed Algorithms for Message-Passing Systems$92508631 997 $aUNINA