000 04222nam a22005775i 4500
001 978-3-540-39239-2
003 DE-He213
005 20160624101943.0
007 cr nn 008mamaa
008 121227s1988 gw | s |||| 0|eng d
020 _a9783540392392
_9978-3-540-39239-2
024 7 _a10.1007/BFb0019789
_2doi
050 4 _aQA164-167.2
072 7 _aPBV
_2bicssc
072 7 _aMAT036000
_2bisacsh
082 0 4 _a511.6
_223
245 1 0 _aDistributed Algorithms
_h[electronic resource] :
_b2nd International Workshop Amsterdam, The Netherlands, July 8–10, 1987 Proceedings /
_cedited by J. Leeuwen.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1988.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1988.
300 _aVII, 432 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 ;
_v312
505 0 _aA distributed spanning tree algorithm -- Directed network protocols -- Fault tolerant queries in computer networks -- General and efficient decentralized consensus protocols -- A framework for agreement -- Byzantine firing squad using a faulty external source -- An improved multiple identification algorithm for synchronous broadcasting networks -- Distributed algorithms for tree pattern matching -- On the packet complexity of distributed selection -- Load balancing in a network of transputers -- Experience with a new distributed termination detection algorithm -- A distributed deadlock avoidance technique -- How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion -- Verification of connection-management protocols -- Generalized scheme for topology-update in dynamic networks -- Local fail-safe network reset procedure -- Synchronizing asynchronous bounded delay networks -- A modular proof of correctness for a network synchronizer -- On the use of synchronizers for asynchronous communication networks -- Atomic multireader register -- An optimistic resiliency control scheme for distributed database systems -- A failsafe scheme for replicated information -- Randomized function evaluation on a ring -- A distributed ring orientation algorithm -- Constructing efficient election algorithms from efficient traversal algorithms -- Optimal resilient ring election algorithms -- Fault-tolerant distributed algorithm for election in complete networks -- Lower bounds for synchronous networks and the advantage of local information -- On the existence of generic broadcast algorithms in networks of Communicating Sequential Processes -- Stepwise removal of virtual channels in distributed algorithms.
520 _aThis volume presents the proceedings of the 2nd International Workshop on Distributed Algorithms, held July 8-10, 1987, in Amsterdam, The Netherlands. It contains 29 papers on new developments in the area of the design and analysis of distributed algorithms. The topics covered include, e.g. algorithms for distributed consensus and agreement in networks, connection management and topology update schemes, election and termination detection protocols, and other issues in distributed network control.
650 0 _aMathematics.
650 0 _aOperating systems (Computers).
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aDatabase management.
650 0 _aComputer graphics.
650 0 _aCombinatorics.
650 1 4 _aMathematics.
650 2 4 _aCombinatorics.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Structures.
650 2 4 _aComputer Graphics.
650 2 4 _aOperating Systems.
650 2 4 _aDatabase Management.
700 1 _aLeeuwen, J.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540193661
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v312
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0019789
942 _2EBK4610
_cEBK
999 _c33904
_d33904