Principles of Distributed Systems

12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings

Editors:

ISBN: 978-3-540-92220-9 (Print) 978-3-540-92221-6 (Online)

Table of contents (43 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-1

      The Next 700 BFT Protocols

    2. No Access

      Book Chapter

      Pages 2-4

      On Replication of Software Transactional Memories

  3. Regular Papers

    1. No Access

      Book Chapter

      Pages 5-21

      Write Markers for Probabilistic Quorum Systems

    2. No Access

      Book Chapter

      Pages 22-40

      Byzantine Consensus with Unknown Participants

    3. No Access

      Book Chapter

      Pages 41-57

      With Finite Memory Consensus Is Easier Than Reliable Broadcast

    4. No Access

      Book Chapter

      Pages 58-72

      Group Renaming

    5. No Access

      Book Chapter

      Pages 73-88

      Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%

    6. No Access

      Book Chapter

      Pages 89-104

      Deadline Monotonic Scheduling on Uniform Multiprocessors

    7. No Access

      Book Chapter

      Pages 105-124

      A Comparison of the M-PCP, D-PCP, and FMLP on LITMUSRT

    8. No Access

      Book Chapter

      Pages 125-144

      A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots

    9. No Access

      Book Chapter

      Pages 145-163

      Fault-Tolerant Flocking in a k-Bounded Asynchronous System

    10. No Access

      Book Chapter

      Pages 164-183

      Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks

    11. No Access

      Book Chapter

      Pages 184-196

      Degree 3 Suffices: A Large-Scale Overlay for P2P Networks

    12. No Access

      Book Chapter

      Pages 197-216

      On the Time-Complexity of Robust and Amnesic Storage

    13. No Access

      Book Chapter

      Pages 217-225

      Graph Augmentation via Metric Embedding

    14. No Access

      Book Chapter

      Pages 226-245

      A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness

    15. No Access

      Book Chapter

      Pages 246-258

      The 0–1-Exclusion Families of Tasks

    16. No Access

      Book Chapter

      Pages 259-274

      Interval Tree Clocks

    17. No Access

      Book Chapter

      Pages 275-294

      Ordering-Based Semantics for Software Transactional Memory

    18. No Access

      Book Chapter

      Pages 295-310

      CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks

previous Page of 3