04703nam 22007575 450 99646601190331620230406042435.03-540-49991-110.1007/11945529(CKB)1000000000283968(SSID)ssj0000319541(PQKBManifestationID)11230370(PQKBTitleCode)TC0000319541(PQKBWorkID)10338720(PQKB)10657889(DE-He213)978-3-540-49991-6(MiAaPQ)EBC3068657(PPN)123139902(EXLCZ)99100000000028396820100301d2006 u| 0engurnn|008mamaatxtccrPrinciples of Distributed Systems[electronic resource] 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings /edited by Alexander A. Shvartsman1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XIV, 450 p.) Theoretical Computer Science and General Issues,2512-2029 ;4305International conference proceedings.3-540-49990-3 Includes bibliographical references and index.Lazy and Speculative Execution in Computer Systems -- In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement -- A Topological Treatment of Early-Deciding Set-Agreement -- Renaming with k-Set-Consensus: An Optimal Algorithm into n + k – 1 Slots -- When Consensus Meets Self-stabilization -- On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention -- Optimistic Algorithms for Partial Database Replication -- Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems -- Distributed Priority Inheritance for Real-Time and Embedded Systems -- Safe Termination Detection in an Asynchronous Distributed System When Processes May Crash and Recover -- Lock-Free Dynamically Resizable Arrays -- Distributed Spanner Construction in Doubling Metric Spaces -- Verification Techniques for Distributed Algorithms -- Mobile Agent Algorithms Versus Message Passing Algorithms -- Incremental Construction of k-Dominating Sets in Wireless Sensor Networks -- Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks -- Empire of Colonies Self-stabilizing and Self-organizing Distributed Algorithms -- Glance: A Lightweight Querying Service for Wireless Sensor Networks -- On Many-to-Many Communication in Packet Radio Networks -- Robust Random Number Generation for Peer-to-Peer Systems -- About the Lifespan of Peer to Peer Networks -- Incentive-Based Robust Reputation Mechanism for P2P Services -- Searching for Black-Hole Faults in a Network Using Multiple Agents -- Gathering Asynchronous Mobile Robots with Inaccurate Compasses -- Gathering Few Fat Mobile Robots in the Plane -- Hop Chains: Secure Routing and the Establishment of Distinct Identities -- Computing on a Partially Eponymous Ring -- Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents -- Robust Self-stabilizing Clustering Algorithm -- Self-stabilizing Wireless Connected Overlays.Theoretical Computer Science and General Issues,2512-2029 ;4305Computer systemsComputer networksSoftware engineeringComputer programmingOperating systems (Computers)Computers, Special purposeComputer System ImplementationComputer Communication NetworksSoftware EngineeringProgramming TechniquesOperating SystemsSpecial Purpose and Application-Based SystemsComputer systems.Computer networks.Software engineering.Computer programming.Operating systems (Computers).Computers, Special purpose.Computer System Implementation.Computer Communication Networks.Software Engineering.Programming Techniques.Operating Systems.Special Purpose and Application-Based Systems.005.4/476Shvartsman Alexander Aedthttp://id.loc.gov/vocabulary/relators/edtOPODIS 2006BOOK996466011903316Principles of Distributed Systems772112UNISA