000 03986nam a22005415i 4500
001 978-3-540-69600-1
003 DE-He213
005 20160624102058.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540696001
_9978-3-540-69600-1
024 7 _a10.1007/BFb0030669
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aDistributed Algorithms
_h[electronic resource] :
_b11th International Workshop, WDAG '97 Saarbrücken, Germany, September 24–26, 1997 Proceedings /
_cedited by Marios Mavronicolas, Philippas Tsigas.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
300 _aXI, 341 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 ;
_v1320
505 0 _aTowards fault-tolerant and secure agentry -- Workflow management — An exercise in distributed computing -- In memory of Anya Pogosyants -- Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study -- A simple DFS-Based algorithm for linear interval routing -- ATM layouts with bounded hop count and congestion -- Scheduling in synchronous networks and the greedy algorithm -- Rapid convergence of a local load balancing algorithm for asynchronous rings -- Performing tasks on restartable message-passing processors -- Revisiting the Paxos algorithm -- Heartbeat: A timeout-free failure detector for quiescent reliable communication -- Genuine atomic multicast -- Low-overhead time-triggered group membership -- Virtual precedence in asynchronous systems: Concept and applications -- Detecting global predicates in distributed systems with clocks -- Fault tolerance bounds for memory consistency -- Precedence-based memory models -- Strong interaction fairness in a fully distributed system with unbounded speed variability -- Reliable communication over partially authenticated networks -- Self-stabilizing depth-first token passing on rooted networks -- Secure distributed storage and retrieval -- Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system -- Transparent support for wait-free transactions -- On the power of multi-objects.
520 _aThis book constitutes the refereed proceedings of the 11th International Workshop on Distributed Algorithms, WDAG '97, held in Saarbrücken, Germany, in September 1997. The volume presents 20 revised full papers selected from 59 submissions. Also included are three invited papers by leading researchers. The papers address a variety of current issues in the area of distributed algorithms and, more generally, distributed systems such as various particular algorithms, randomized computing, routing, networking, load balancing, scheduling, message-passing, shared-memory systems, communication, graph algorithms, etc.
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 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputer Communication Networks.
650 2 4 _aProgramming Techniques.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aOperating Systems.
700 1 _aMavronicolas, Marios.
_eeditor.
700 1 _aTsigas, Philippas.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540635758
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1320
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0030669
942 _2EBK7277
_cEBK
999 _c36571
_d36571