000 04927nam a22003615i 4500
001 308534
003 MX-SnUAN
005 20160429160218.0
007 cr nn 008mamaa
008 150903s2013 gw | o |||| 0|eng d
020 _a9783642381232
_99783642381232
024 7 _a10.1007/9783642381232
_2doi
035 _avtls000361413
039 9 _a201509030622
_bVLOAD
_c201405070314
_dVLOAD
_y201402210947
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA75.5-76.95
100 1 _aRaynal, Michel.
_eautor
_9299430
245 1 0 _aDistributed Algorithms for Message-Passing Systems /
_cby Michel Raynal.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _axxxI, 500 páginas 198 ilustraciones, 106 ilustraciones en color.
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
500 _aSpringer eBooks
505 0 _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.
520 _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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642381225
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-38123-2
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c308534
_d308534