Principles of Distributed Systems 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings /
Clasificación: | Libro Electrónico |
---|---|
Autor Corporativo: | |
Otros Autores: | |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2006.
|
Edición: | 1st ed. 2006. |
Colección: | Theoretical Computer Science and General Issues,
4305 |
Temas: | |
Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- 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.