04618nam 22007935 450 99646578430331620200701171946.03-540-39989-510.1007/b13831(CKB)1000000000212206(SSID)ssj0000322700(PQKBManifestationID)11275887(PQKBTitleCode)TC0000322700(PQKBWorkID)10288087(PQKB)11153074(DE-He213)978-3-540-39989-6(MiAaPQ)EBC3087966(PPN)155193716(EXLCZ)99100000000021220620121227d2003 u| 0engurnn|008mamaatxtccrDistributed Computing[electronic resource] 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings /edited by Faith Ellen Fich1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (IX, 371 p.) Lecture Notes in Computer Science,0302-9743 ;2848Bibliographic Level Mode of Issuance: Monograph3-540-20184-X Includes bibliographical references and index.Resilient Consensus for Infinitely Many Processes -- Uniform Solvability with a Finite Number of MWMR Registers -- Timing-Based Mutual Exclusion with Local Spinning -- On the Uncontended Complexity of Consensus -- Probabilistic Quorums for Dynamic Systems -- Efficient Replication of Large Data Objects -- On the Locality of Consistency Conditions -- Multi-writer Consistency Conditions for Shared Memory Objects -- Booting Clock Synchronization in Partially Synchronous Systems -- Automatic Discovery of Mutual Exclusion Algorithms -- On the Implementation Complexity of Specifications of Concurrent Programs -- Competitive Management of Non-preemptive Queues with Multiple Values -- Constructing Disjoint Paths for Secure Communication -- Compact Routing for Flat Networks -- Lower Bounds for Oblivious Single-Packet End-to-End Communication -- Efficient Gossip and Robust Distributed Computation -- Condition-Based Consensus in Synchronous Systems -- Using Conditions to Expedite Consensus in Synchronous Distributed Systems -- Tight Bounds on Early Local Decisions in Uniform Consensus -- Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors -- On Failure Detectors and Type Boosters -- GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks -- Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks -- Maximizing Remote Work in Flooding-Based Peer-to-Peer Systems -- Overcoming the Majority Barrier in Large-Scale Systems.Lecture Notes in Computer Science,0302-9743 ;2848Architecture, ComputerComputer communication systemsComputer programmingOperating systems (Computers)ComputersAlgorithmsComputer System Implementationhttps://scigraph.springernature.com/ontologies/product-market-codes/I13057Computer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14045Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Architecture, Computer.Computer communication systems.Computer programming.Operating systems (Computers).Computers.Algorithms.Computer System Implementation.Computer Communication Networks.Programming Techniques.Operating Systems.Computation by Abstract Devices.Algorithm Analysis and Problem Complexity.004.36Fich Faith Ellenedthttp://id.loc.gov/vocabulary/relators/edtDISC 2003MiAaPQMiAaPQMiAaPQBOOK996465784303316Distributed computing104445UNISA