分布式计算
2006-12
湖南文艺出版社
Dolev, Shlomi
568
This book constitutes the refereed proceedings of the 20th International Symposium on Distributed Computing, DISC 2006, held in Stockholm, Sweden in September 2006. The 35 revised full papers selected from 145 submissions are presented together with 1 invited paper and 13 brief announcements of ongoing works chosen from 26 submissions; all of them were carefully selected for inclusion in the book. The entire scope of current issues in distributed computing - theory, design, analysis, implementation, and application of distributed systems and networks - is addressed, ranging from foundational and theoretical topics to algorithms and systems issues and to applications in various fields.
Exploring Gafni's Reduction Land: From ~2k to Wait-Free Adaptive Renaming Via k-Set AgreementRenaming in Message Passing Systems with Byzantine FailuresBuilt-In Coloring for Highly-Concurrent Doubly-Linked ListsFault-Tolerant and Self-stabilizing Mobile Robots GatheringFast Computation by Population Protocols with a LeaderOn Self-stabilizing Search TreesEfficient Dynamic AggregationGroupings and Pairings in Anonymous NetworksA New Proof of the GHS Minimum Spanning Tree AlgorithmA Knowledge-Based Analysis of Global Function ComputationChecking a Multithreaded Algorithm with TCALCapturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium ArchitectureConflict Detection and Validation Strategies for Software Transactional MemoryTransactional Locking IILess Is More: Consensus Gaps Between Restricted and Unrestricted ObjectsOne-Step Consensus SolvabilityTime-Bounded Task-PIOAs: A Framework for Analyzing Security ProtocolsOn Consistency of Encrypted FilesAgreeing to Agree: Conflict Resolution for Optimistically Replicated DataA Lazy Snapshot Algorithm with Eager ValidationBounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of ClientsTime and Communication Efficient Consensus for Crash FailuresSubconsensus Tasks: Renaming Is Weaker Than Set AgreementExact Distance Labelings Yield Additive-Stretch Compact Routing Schemes……
