Distributed Computing分布式計(jì)算/會(huì)議錄

內(nèi)容概要

　　This book constitutes the refereed proceedings of the 18th International Conference on Distributed Computing, DISC 2004, held in Amsterdam, The Netherlands, in October 2004.　　The 31 revised full papers presented together with an extended abstract of an invited lecture and an eulogy for Peter Ruzicka were carefully reviewed and selected from 142 submissions. The entire scope of current issues in distributed computing is addressed, ranging from foundational and theoretical topics to algorithms and systems issues to applications in various fields.

書籍目錄

The Synchronous Condition-Based Consensus HierarchySynchronous Condition-Based Consensus Adapting　to Input-Vector LegalityGroup-SolvabilityThe Notion of Veto Number and the Respective Power of ◇P and ◇S　to Solve One-Shot Agreement ProblemsThe Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Locai-Spinning and FIFO AlgorithmsLocal-Spin Group Mutual Exclusion AlgorithmsOn Quorum Systems for Group Resources with Bounded CapacityBounded Version Vectors An Optimistic Approach to Lock-Free FIFO QueuesA Single-Enqueuer Wait-Free Queue ImplementationPractical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CASEfficient Adaptive Collect Using RandomizationNonblockinK Concurrent Data Structures with Condition SynchronizationDynamic Memory ABP Work-StealingCoupling and Self-stabilizationOptimal Randomized Self-stabilizing Mutual Exclusion on Synchronous RingsVirtual Mobile Nodes for Mobile Ad Hoc NetworksContention-Free MAC Protocols for Wireless Sensor NetworksRelationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed SystemsA Local Algorithm for Ad Hoc Majority Voting via Charge FusionMessage-Optimal and Latency-Optimal Termination Detection Algortithms for Arbitrary TopologiesRouting with Improved Communication-Space Trade-OffActive and Concurrent ToDology MaintenanceDistributed Weighted MatchingExploiting Content Localities for Efficient Search in P2P SystemsCompact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal GraphsTowards a Theory of Consistency PrimitivesFault-Tolerant Storage in a Dynamic Environment……Author Index

圖書封面

圖書標(biāo)簽Tags

無

評(píng)論、評(píng)分、閱讀與下載

---

    Distributed Computing分布式計(jì)算/會(huì)議錄 PDF格式下載

---