Winter 2006 - CS271 Paper List

CS 271 - Paper List

Causility Model

(Lamport) Time, Clocks and the Ordering of Events in a Distributed System
(Friedemann) Virtual Time and Global States of Distributed Systems

Mutual Exclusion

(Ricart and Agrawala) An optimal algorithm for mutual exclusion in computer networks
(Maekawa) An algorithm for mutual exclusion in decentralized systems
(Raymond) A tree-based algorithm for distributed mutual exclusion
(Agrawal) An efficient and fault-tolerant solution for distributed mutual exclusion

Replication

(Wuu and Bernstein) Efficient Solutions to the Replicated Log and Dictionary Problems

Global State

(Chandy) Distributed Snapshots: Determining Global States of Distributed Systems

Broadcast

(Hadzilacos and Toueg) A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
(Birman and Joseph) Reliable Communication in the Presence of Failures
(Kaashoek and Tanenbaum) Group Communication in the Amoeba Distributed Operating System

Peer-to-peer

(Stoica et al.) Chord: A Scalable Peer-to-peer Lookup Protoocl for Internet Applications
(Gupta et al.) One Hop Lookups for Peer-to-Peer Overlays
(Ratnasamy et al.) A Scalable Content-Addressable Network
(Zhao et al.) Tapestry: A Resilient Global-scale Overlay for Service Deployment
(Crainiceanu et al.) P-Ring: An Index Structure for Peer-to-Peer Systems
(Linga et al.) Guaranteeing Correctness and Availability in P2P Range Indicies
(Patterson et al.) Guaranteeing Correctness of Lock-free Range Queries over P2P Data

Transaction Management

(Bernsein eg al.) Concurrency Control and Recovery in Database Systems
See chapters 2, 3.2,4.2,7,8.3,8.4 8.9
Note: don't go too much in details in these chapters, use them if you want to clarify and complement the slides, because the chapters in the book are too detailed for the level covered in class.

Agreement

(Srikanth and Toueg) Simulating Authenticated Broadcasts to Derive Simple Fault-Tolerant Algorithms