书籍详情
分布式计算 DISC 2006/会议录LNCS-4167
作者：Shlomi Dolev 著
出版社：湖南文艺出版社
出版时间：2006-12-01
ISBN：9783540446248
定价：¥768.40
购买这本书可以去
内容简介
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.
作者简介
暂缺《分布式计算 DISC 2006/会议录LNCS-4167》作者简介
目录
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 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
……
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 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
……
猜您喜欢
