I am interested in large-scale data management, distributed systems, and data-intensive computing.
Bio: Peter Bailis is a fourth- and final-year Ph.D. candidate at UC Berkeley working in databases and distributed systems. His dissertation research examines coordination avoidance—the use of as little coordination as possible while ensuring application integrity—in large scale transaction processing, data serving, and statistical analytics tasks. He is the recipient of the NSF Graduate Research Fellowship, the Berkeley Fellowship for Graduate Study, and best-of-conference citations for research appearing in SIGMOD and VLDB. He received his A.B. in Computer Science from Harvard College in 2011, where he also received the CRA Outstanding Undergraduate Researcher Award. Peter will join Stanford Computer Science as an assistant professor in Fall 2016.
Through Fall 2015:
ABD Ph.D., UC Berkeley EECS
Fall 2015-16:
visiting MIT CSAIL
Fall 2016:
Assistant Professor, Stanford CS


I talked at StrangeLoop about "When Worst is Best (in Distributed Systems Design)"; check out the deck and video!
I'm looking for brilliant graduate students!.
In light of upcoming graduate student fellowship deadlines, I posted about and shared my NSF GRFP materials.
Posted slide decks from MesosCon (keynote video) and SIGMOD on coordination-avoiding systems design and concurrency control in open source applications.
Relocated to Cambridge, MA for the year.
I'm giving a keynote at MesosCon 2015 (August 20-21 in Seattle) on "Silence is Golden: Coordination-Avoiding Systems Design."
I'll be spending next year visiting the MIT CSAIL DB and systems groups.
I'll be speaking at Strange Loop 2015 (September 24-26 in St. Louis) on "When Worst is Best (in Distributed Systems Design)."
Accepted a tenure-track assistant professor position with Stanford Computer Science!
New website.

Selected Publications Full List · Google Scholar

Feral Concurrency Control: An Empirical Investigation of Modern Application Integrity
Coordination Avoidance in Database Systems
The Missing Piece in Complex Analytics: Low Latency, Scalable Model Management and Serving with Velox
Quantifying Eventual Consistency with PBS
Highly Available Transactions: Virtues and Limitations
Quantifying Eventual Consistency with PBS
The Network is Reliable: An Informal Survey of Real-World Communications Failures
Scalable Atomic Visibility with RAMP Transactions
PBS at Work: Advancing Data Management with Consistency Metrics
HAT, not CAP: Towards Highly Available Transactions
Eventual Consistency Today: Limitations, Extensions, and Beyond
Consistency without Borders
Bolt-on Causal Consistency
Probabilistically Bounded Staleness for Practical Partial Quorums
The Potential Dangers of Causal Consistency and an Explicit Solution
Programming Micro-aerial Vehicle Swarms with Karma
Dimetrodon: Processor-level Preventive Thermal Management via Idle Cycle Injection
Positional Communication and Private Information in Honeybee Foraging Models