LEADER 05385nam 22007215 450 001 996465489903316 005 20231010131021.0 010 $a3-540-47484-6 024 7 $a10.1007/3-540-56188-9 035 $a(CKB)1000000000233909 035 $a(SSID)ssj0000322685 035 $a(PQKBManifestationID)11243987 035 $a(PQKBTitleCode)TC0000322685 035 $a(PQKBWorkID)10295933 035 $a(PQKB)10196478 035 $a(DE-He213)978-3-540-47484-5 035 $a(PPN)155189131 035 $a(EXLCZ)991000000000233909 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Algorithms$b[electronic resource] $e6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings /$fedited by Adrian Segall, Shmuel Zaks 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (X, 382 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v647 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-56188-9 327 $aSparser: A paradigm for running distributed algorithms -- Closed schedulers: Constructions and applications to consensus protocols -- Efficient atomic snapshots using lattice agreement -- Choice coordination with multiple alternatives (preliminary version) -- Some results on the impossibility, universality, and decidability of consensus -- Wait-free test-and-set -- A concurrent time-stamp scheme which is linear in time and space -- Tentative and definite distributed computations: An optimistic approach to network synchronization -- Semisynchrony and real time -- Optimal time Byzantine agreement for t /8 with linear messages -- A continuum of failure models for distributed computing -- Simulating crash failures with many faulty processors (extended abstract) -- An efficient topology update protocol for dynamic networks -- Memory adaptive self-stabilizing protocols (extended abstract) -- Optimal early stopping in distributed consensus -- Traffic-light scheduling on the grid -- Distributed computing on anonymous hypercubes with faulty components -- Message terminate algorithms for anonymous rings of unknown size -- Distributed resource allocation algorithms -- Membership algorithms for multicast communication groups -- The granularity of waiting (extended Abstract) -- The cost of order in asynchronous systems -- Efficient, strongly consistent implementations of shared memory -- Optimal primary-backup protocols. 330 $aThis volume presents the proceedings of the Sixth Workshop on Distributed Algorithms (WDAG 92), held in Haifa, Israel, November 2-4, 1992. WDAG provides a forum for researchers and other parties interested in distributedalgorithms and their applications. The aim is to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. Papers in the volume describe original results in all areas of distributed algorithms and their applications, including distributed graph algorithms, distributed combinatorial algorithms, design of network protocols, routing and flow control, communication complexity, fault-tolerant distributed algorithms, distributed data structures, distributed database techniques, replica control protocols, distributed optimization algorithms, mechanisms for safety and security in distributed systems, and protocols for real-time distributed systems. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v647 606 $aComputers 606 $aComputer programming 606 $aAlgorithms 606 $aComputer communication systems 606 $aOperating systems (Computers) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 615 0$aComputers. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer communication systems. 615 0$aOperating systems (Computers). 615 14$aTheory of Computation. 615 24$aComputation by Abstract Devices. 615 24$aProgramming Techniques. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputer Communication Networks. 615 24$aOperating Systems. 676 $a004/.36/015118 702 $aSegall$b Adrian$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aZaks$b Shmuel$c1949-$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465489903316 996 $aDistributed algorithms$9382926 997 $aUNISA