Invited Talks -- Transactional Memory Today: A Status Report -- Navigating the Web 2.0 with Gossple -- Distributed Scheduling -- Transactional Scheduling for Read-Dominated Workloads -- Performance Evaluation of Work Stealing for Streaming Applications -- Not All Fair Probabilistic Schedulers Are Equivalent -- Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory -- Distributed Robotics -- Byzantine Convergence in Robot Networks: The Price of Asynchrony -- Deaf, Dumb, and Chatting Asynchronous Robots -- Synchronization Helps Robots to Detect Black Holes in Directed Graphs -- Fault and Failure Detection -- The Fault Detection Problem -- The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems -- Enhanced Fault-Tolerance through Byzantine Failure Detection -- Wireless and Social Networks -- Decentralized Polling with Respectable Participants -- Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks -- Adversarial Multiple Access Channel with Individual Injection Rates -- Synchronization -- NB-FEB: A Universal Scalable Easy-to-Use Synchronization Primitive for Manycore Architectures -- Gradient Clock Synchronization Using Reference Broadcasts -- Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction -- Storage Systems -- On the Impact of Serializing Contention Management on STM Performance -- On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory -- Abortable Fork-Linearizable Storage -- Distributed Agreement -- On the Computational Power of Shared Objects -- Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement -- Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency -- Distributed Algorithms -- Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground -- Proactive Fortification of Fault-Tolerant Services -- Robustness of the Rotor-router Mechanism -- Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm -- Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees.

This book constitutes the refereed proceedings of the 13th International Conference on Principles of Distributed Systems, OPODIS 2009, held in Nimes, France, in December 2009. The 23 full papers and 4 short papers presented were carefully reviewed and selected from 72 submissions. The papers are organized in topical sections on distributed scheduling, distributed robotics, fault and failure detection, wireless and social networks, synchronization, storage systems, distributed agreement, and distributed algorithms.