papers-we-love_papers-we-love/distributed_systems/README.md

Distributed Systems

• General Papers
• Topics
  • Datastores
  • Physics
  • Testing, Verification, and Correctness

External Papers

• 📜 A Note on Distributed Computing

• A simple totally ordered broadcast protocol

• Above the Clouds: A Berkeley View of Cloud Computing

• Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications

• Kafka: a Distributed Messaging System for Log Processing

• Large-scale cluster management at Google with Borg

• Linearizability: A Correctness Condition for Concurrent Objects

• Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial

• Hoard: A Scalable Memory Allocator for Multithreaded Applications

• MillWheel: Fault-Tolerant Stream Processing at Internet Scale

• Omega: flexible, scalable schedulers for large compute clusters

• Orleans: Distributed Virtual Actors for Programmability and Scalability

• Paxos Made Live - An Engineering Perspective

• Practical Byzantine Fault Tolerance and Proactive Recovery

• Pregel: A System for Large-Scale Graph Processing

• Replication, History, and Grafting in the Ori File System

• Resilient Overlay Networks

• Sinfonia: A New Paradigm for Building Scalable Distributed Systems

• Sparrow: Distributed, Low Latency Scheduling

• The Byzantine Generals Problem

• Hashgraph Consensus: Fair, Fast, Byzantine Fault Tolerance

• 📜 The Chubby Lock Service for Loosely-Coupled Distributed Systems

• 📜 The Join Calculus: a Language for Distributed Mobile Programming

• The Part-Time Parliament

• There Is More Consensus in Egalitarian Parliaments

• Transactional Client-Server Cache Consistency: Alternatives and Performance

• Unicorn: A System for Searching the Social Graph

• Unikernels: Library Operating Systems for the Cloud

• Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms

• Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems

• VL2: A Scalable and Flexible Data Center Network

Other Hosted Papers

• 📜 A History of the Virtual Synchrony Replication Model

• 📜 A Hundred Impossibility Proofs for Distributed Systems

• 📜 A response to Cheriton and Skeen's Criticism of Causal and Totally Ordered Communication

• 📜 A Universal Modular ACTOR Formalism for Artificial Intelligence

• 📜 A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones

• 📜 Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays

• 📜 Byzantine Chain Replication

• 📜 A Byzantine Fault Tolerant Distributed Commit Protocol

• 📜 Brewer’s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services

• 📜 Chain Replication for Supporting High Throughput and Availability

• 📜 Commodifying Replicated State Machines with OpenReplica

• 📜 Consensusin the Presenceof Partial Synchrony

• 📜 Consistent Global States of Distributed Systems: Fundamental Concepts and Mechanisms

• 📜 Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web

• 📜 Copysets: Reducing the Frequency of Data Loss in Cloud Storage

• 📜 Dapper, a Large-Scale Distributed Systems Tracing Infrastructure

• 📜 Distributed Snapshots: Determining Global States of Distributed Systems

• 📜 Eluding Carnivores: File Sharing with Strong Anonymity

• 📜 End-to-end arguments in system design

• 📜 Epidemic Algorithms for Replicated Database Maintenance

• 📜 Harvest, Yield, and Scalable Tolerant Systems

• 📜 Herbivore: A Scalable and Efficient Protocol for Anonymous Communication

• 📜 High-Level Specifications: Lessons from Industry

• 📜 How the Hidden Hand Shapes the Market for Software Reliability

• 📜 Implementing the Omega failure detector in the crash-recovery failure model

• 📜 Impossibility of Distributed Consensus with One Faulty Process

• 📜 In Search of an Understandable Consensus Algorithm

• 📜 Kelips*: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead

• 📜 Large-scale Incremental Processing Using Distributed Transactions and Notifications

• 📜 Life beyond Distributed Transactions: an Apostate’s Opinion

• 📜 MapReduce: Simplified Data Processing on Large Clusters

• 📜 Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center

• 📜 Oblivious routing of highly variable traffic in service overlays and IP backbones

• 📜 On proof and progress in mathematics

• 📜 P5: A Protocol for Scalable Anonymous Communication

• 📜 Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems

• 📜 Paxos Made Moderately Complex

• 📜 Paxos Made Simple

• 📜 Self-stabilizing Systems in Spite of Distributed Control

• 📜 SIFT: Design and Analysis of a Fault-Tolerant Computer for Aircraft Control

• 📜 Signal/Collect: Graph Algorithms for the (Semantic) Web

• 📜 Solution of a Problem in Concurrent Programming Control

• 📜 Sparse Partitions

• 📜 Stronger Semantics for Low-Latency Geo-Replicated Storage

• 📜 The Akamai Network: A Platform for High-Performance Internet Applications

• 📜 The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability

• 📜 Tor: The Second-Generation Onion Router

• 📜 Towards a cloud computing research agenda

• 📜 Understanding the Limitations of Causally and Totally Ordered Communication

• 📜 Viewing Control Structures as Patterns of Passing Messages

• 📜 Warp: Multi-Key Transactions for Key-Value Stores

• 📜 Zab: High-performance broadcast for primary-backup systems

• 📜 ZooKeeper: Wait-free coordination for Internet-scale systems

• 📜 Tiered Replication: A Cost-effective Alternative to Full Cluster Geo-replication

Topics

Datastores

• Calvin: Fast Distributed Transactions for Partitioned Database Systems

• f4: Facebook’s Warm BLOB Storage System

• The Case for Determinism in Database Systems

• Consistency Tradeoffs in Modern Distributed Database System Design

• Modularity and Scalability in Calvin

• Lightweight Locking for Main Memory Database Systems

• Cassandra - A Decentralized Structured Storage System

• CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data

• Don’t Settle for Eventual: Scalable Causal Consistency for Wide-Area Storage with COPS

• Dremel: Interactive Analysis of Web-Scale Datasets

• F1: A Distributed SQL Database That Scales

• HaLoop: Efficient Iterative Data Processing on Large Clusters

• HyperDex: A Distributed, Searchable Key-Value Store

• Introduction to a System for Distributed Databases SDD-1

• Making Reliable Distributed Systems in the Presence of Software Errors

• Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System

• Map-Reduce-Merge: Simplified Relational Data Processing on Large Clusters

• MDCC: Multi-Data Center Consistency

• Optimistic replication

• The Dangers of Replication and a Solution

• Towards a Next Generation Data Center Architecture: Scalability and Commoditization

• 📜 Bigtable: A Distributed Storage System for Structured Data

• 📜 Database Metatheory: Asking Big Queries

• 📜 Dynamo: Amazon’s Highly Available Key-value Store

• 📜 Flat Datacenter Storage

• 📜 Freenet: A Distributed Anonymous Information Storage and Retrieval System

• 📜 Megastore: Providing Scalable, Highly Available Storage for Interactive Services

• 📜 A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster

• 📜 RADOS: A Scalable, Reliable Storage Service for Petabyte-scale Storage Clusters

• 📜 Spanner: Google’s Globally-Distributed Database

• 📜 TAO: Facebooks Distributed Data Store for the Social Graph'

• 📜 Transactional storage for geo-replicated systems

• 📜 Warp: Multi-Key Transactions for Key-Value Stores

• 📜 Spartan: A distributed array framework with smart tiling

Physics

• 📜 “On the Electrodynamics of Moving Bodies” (1905) — Einstein

  By solving the asymmetries that arise in Maxwell’s equations, Einstein’s 1905 paper set the stage for current distributed systems work by demonstrating that there is no absolute frame of reference and by providing an upper bound on the speed of communication.

Testing, Verification, and Correctness

• 📜 Simple Testing Can Prevent Most Critical Failures: An Analysis of Production Failures in Distributed Data-Intensive Systems

• 📜 IronFleet: Proving Practical Distributed Systems Correct)