分布式计算：DISC 2006/会议录LNCS-4167: Distributed computing
分類: 图书,计算机/网络,计算机体系结构,
作者： Shlomi Dolev著
出 版 社： 湖南文艺出版社
出版时间： 2006-12-1字数：版次： 1页数： 568印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540446248包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research，development，and education，at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community，with numerous individuals，as well as with prestigious organizations and societies，LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS including its subseries LNAI spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on outstanding PhD work，research projects，technical reports，etc.）
内容简介
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 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 TCAL
Capturing Register and Control Dependence in Memory ConsistencyModels with Applications to the Itanium Architecture
Conflict Detection and Validation Strategies for Software TransactionalMemory
Transactional Locking II
Less Is More: Consensus Gaps Between Restricted and UnrestrictedObjects
One-Step Consensus Solvability
Time-Bounded Task-PIOAs: A Framework for Analyzing SecurityProtocols
On Consistency of Encrypted Files
Agreeing to Agree: Conflict Resolution for Optimistically ReplicatedData
A Lazy Snapshot Algorithm with Eager Validation
Bounded Wait-Free f-Resilient Atomic Byzantine Data StorageSystems 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 RoutingSchemes
……
