000 04026nam a22005415i 4500
001 978-3-540-70679-3
003 DE-He213
005 20160624102103.0
007 cr nn 008mamaa
008 121227s1996 gw | s |||| 0|eng d
020 _a9783540706793
_9978-3-540-70679-3
024 7 _a10.1007/3-540-61769-8
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aDistributed Algorithms
_h[electronic resource] :
_b10th International Workshop, WDAG '96 Bologna, Italy, October 9–11, 1996 Proceedings /
_cedited by Özalp Babaoğlu, Keith Marzullo.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1996.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1996.
300 _aVIII, 388 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1151
505 0 _aHow to build a highly available system using consensus -- Distributed admission control algorithms for real-time communication -- Randomization and failure detection: A hybrid approach to solve Consensus -- Levels of authentication in distributed agreement -- Efficient and robust sharing of memory in message-passing systems -- Plausible clocks: Constant size logical clocks for Distributed Systems -- Abstracting communication to reason about distributed algorithms -- Simulating reliable links with unreliable links in the presence of process crashes -- A cyclic distributed garbage collector for network objects -- Incremental, distributed orphan detection and actor garbage collection using graph partitioning and euler cycles -- A framework for the analysis of non-deterministic clock synchronisation algorithms -- Optimal time broadcasting in faulty star networks -- A lower bound for Linear Interval Routing -- Topological routing schemes -- Maintaining a dynamic set of processors in a distributed system -- Collective consistency -- Planar quorums -- “?-accurate” failure detectors -- Fast, long-lived renaming improved and simplified -- A timestamp based transformation of self-stabilizing programs for distributed computing environments -- The combinatorial structure of wait-free solvable tasks -- On the robustness of h m r -- Understanding the Set Consensus Partial Order using the Borowsky-Gafni Simulation.
520 _aThis book constitutes the refereed proceedings of the 10th International Workshop on Distributed Algorithms, WDAG '96, held in Bologna, Italy, in October 1996. The volume presents 21 revised full papers selected from 75 submissions together with invited contributions by Butler Lampson and Domenico Ferrari. The volume reflects the transition of the area from formerly being the domain of a small research community to becoming the dominant computing paradigm and an industrial technology. Among the topics covered are all current aspects of distributed algorithms ranging from theory to applications such as distributed intelligent agents.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aOperating systems (Computers).
650 0 _aComputer software.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aProgramming Techniques.
650 2 4 _aComputer Communication Networks.
650 2 4 _aOperating Systems.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aBabaoğlu, Özalp.
_eeditor.
700 1 _aMarzullo, Keith.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540617693
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1151
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-61769-8
942 _2EBK7455
_cEBK
999 _c36749
_d36749