Distributed Computing: 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings: 4167 - Brossura

Dolev, Shlomi

Brossura

ISBN 10: 3540446249 ISBN 13: 9783540446248

Casa editrice: Springer, 2008

Riassunto

This book constitutes the refereed proceedings of the 20th International Symposium on Distributed Computing, DISC 2006. The book presents 35 revised full papers together with 1 invited paper and 13 announcements of ongoing works, all carefully selected for inclusion in the book. The entire scope of current issues in distributed computing is addressed, ranging from foundational and theoretical topics to algorithms and systems issues and to applications in various fields.

Su questo libro

Contenuti

Exploring Gafni’s Reduction Land: From ? k to Wait-Free Adaptive -Renaming Via k-Set Agreement.- Exploring Gafni’s Reduction Land: From ? k to Wait-Free Adaptive -Renaming Via k-Set Agreement.- Renaming in Message Passing Systems with Byzantine Failures.- Built-In Coloring for Highly-Concurrent Doubly-Linked Lists.- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering.- Fast Computation by Population Protocols with a Leader.- On Self-stabilizing Search Trees.- Efficient Dynamic Aggregation.- Groupings and Pairings in Anonymous Networks.- A New Proof of the GHS Minimum Spanning Tree Algorithm.- A Knowledge-Based Analysis of Global Function Computation.- Checking a Multithreaded Algorithm with ?+?CAL.- Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture.- Conflict Detection and Validation Strategies for Software Transactional Memory.- Transactional Locking II.- Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects.- One-Step Consensus Solvability.- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.- On Consistency of Encrypted Files.- Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data.- A Lazy Snapshot Algorithm with Eager Validation.- Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients.- Time and Communication Efficient Consensus for Crash Failures.- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement.- Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.- A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.- On Randomized Broadcasting in Power Law Networks.- Distributed Approximation Algorithms in Unit-Disk Graphs.- The Weakest Failure Detectors to Boost Obstruction-Freedom.- Fully-Adaptive Algorithms for Long-Lived Renaming.- Constructing Shared Objects That Are Both Robust and High-Throughput.- Byzantine and Multi-writer K-Quorums.- On Minimizing the Number of ADMs in a General Topology Optical Network.- Robust Network Supercomputing with Malicious Processes.- Distributed Resource Allocation in Stream Processing Systems.- Low-latency Atomic Broadcast in the presence of contention.- Oblivious Gradient Clock Synchronization.- Brief Announcement: Abortable and Query-Abortable Objects.- Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers.- Brief Announcement: Convergence Analysis of Scalable Gossip Protocols.- Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules.- Brief Announcement: Many Slices Are Better Than One.- Brief Announcement: On Augmented Graph Navigability.- Brief Announcement: Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems.- Brief Announcement: Optimistic Algorithms for Partial Database Replication.- Brief Announcement: Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays.- Brief Announcement: Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance.- Brief Announcement Monitoring of Linear Distributed Computations.- Brief Announcement: Communication-Optimal Implementation of Failure Detector Class .- Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks.- Invited Talks.- Provably Unbreakable Hyper-encryption Using Distributed Systems.- Time, Clocks, and the Ordering of My Ideas About Distributed Systems.- My Early Days in Distributed Computing Theory: 1979–1982.- Panel on the Contributions of the DISC Community to Distributed Computing: A Historical Perspective.- DISC at Its 20th Anniversary:Past, Present and Future.- Erratum.- DISC at Its 20th Anniversary: Past, Present and Future.

Product Description

Book by SHLOMI DOLEV

Dettagli dell'edizione

• Editore: Springer
• Data di pubblicazione: 2008
• Lingua: Inglese
• ISBN 10: 3540446249
• ISBN 13: 9783540446248
• Rilegatura: Copertina flessibile
• Numero di pagine: 608
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania