LEADER 05130nam  22007335  450 
001 996465521903316
005 20200703063640.0
010   $a3-540-69600-8
024 7 $a10.1007/BFb0030669
035   $a(CKB)1000000000234732
035   $a(SSID)ssj0000322689
035   $a(PQKBManifestationID)11234026
035   $a(PQKBTitleCode)TC0000322689
035   $a(PQKBWorkID)10288086
035   $a(PQKB)10286221
035   $a(DE-He213)978-3-540-69600-1
035   $a(PPN)155206281
035   $a(EXLCZ)991000000000234732
100   $a20121227d1997      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aDistributed Algorithms$b[electronic resource] $e11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings /$fedited by Marios Mavronicolas, Philippas Tsigas
205   $a1st ed. 1997.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997.
215   $a1 online resource (XI, 341 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1320
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-63575-0 
327   $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.
330   $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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v1320
606   $aComputers
606   $aComputer communication systems
606   $aSoftware engineering
606   $aAlgorithms
606   $aComputer programming
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   $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
615  0$aComputers.
615  0$aComputer communication systems.
615  0$aSoftware engineering.
615  0$aAlgorithms.
615  0$aComputer programming.
615 14$aTheory of Computation.
615 24$aComputer Communication Networks.
615 24$aSoftware Engineering/Programming and Operating Systems.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aProgramming Techniques.
615 24$aComputation by Abstract Devices.
676   $a004/.36
702   $aMavronicolas$b Marios$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aTsigas$b Philippas$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aInternational Workshop on Distributed Algorithms
906   $aBOOK
912   $a996465521903316
996   $aDistributed algorithms$9382926
997   $aUNISA