10 citations · 24 across the 7 of their papers we have counts for
8 papers
Optimizing Model Selection for Compound AI Systems
Lingjiao Chen, Jared Quincy Davis, Boris Hanin +4
Compound AI systems that combine multiple LLM calls, such as self-refine and multi-agent-debate, achieve strong performance on many AI tasks. We address a core question in optimizi…
Read-Write Quorum Systems Made Practical
Michael Whittaker, Aleksey Charapko, Joseph M. Hellerstein +2
Quorum systems are a powerful mechanism for ensuring the consistency of replicated data. Production systems usually opt for majority quorums due to their simplicity and fault toler…
Scaling Replicated State Machines with Compartmentalization [Technical Report]
Michael Whittaker, Ailidani Ailijiang, Aleksey Charapko +6
State machine replication protocols, like MultiPaxos and Raft, are a critical component of many distributed systems and databases. However, these protocols offer relatively low thr…
Matchmaker Paxos: A Reconfigurable Consensus Protocol [Technical Report]
Michael Whittaker, Neil Giridharan, Adriana Szekeres +4
State machine replication protocols, like MultiPaxos and Raft, are at the heart of nearly every strongly consistent distributed database. To tolerate machine failures, these protoc…
Bipartisan Paxos: A Modular State Machine Replication Protocol
Michael Whittaker, Neil Giridharan, Adriana Szekeres +2
There is no shortage of state machine replication protocols. From Generalized Paxos to EPaxos, a huge number of replication protocols have been proposed that achieve high throughpu…
Coordination Avoidance in Database Systems (Extended Version)
Peter Bailis, Alan Fekete, Michael J. Franklin +3
Minimizing coordination, or blocking communication between concurrently executing operations, is key to maximizing scalability, availability, and high performance in database syste…
Highly Available Transactions: Virtues and Limitations (Extended Version)
Peter Bailis, Aaron Davidson, Alan Fekete +3
To minimize network latency and remain online during server failures and network partitions, many modern distributed data storage systems eschew transactional functionality, which…
Probabilistically Bounded Staleness for Practical Partial Quorums
Peter Bailis, Shivaram Venkataraman, Michael J. Franklin +2
Data store replication results in a fundamental trade-off between operation latency and data consistency. In this paper, we examine this trade-off in the context of quorum-replicat…