Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp0176537445v| Title: | MinPaxos: Simplifying Log Replication for Fault Tolerance |
| Authors: | Lin, Andrew |
| Advisors: | Lloyd, Wyatt |
| Department: | Computer Science |
| Class Year: | 2021 |
| Abstract: | The Paxos consensus algorithm contains a theoretical simplicity that becomes unrecognizable in functional implementations of Multi-Paxos for fault tolerance. Attempts have been made to simplify Multi-Paxos algorithms for teachability, but such consensus algorithm simplifications, while effective, have even less of a relation to Paxos. MinPaxos attempts to use the properties of Paxos to create an implementation of Multi-Paxos that can provide log replication for fault tolerance without losing sight of the simplicity of the Paxos algorithm. |
| URI: | http://arks.princeton.edu/ark:/88435/dsp0176537445v |
| Type of Material: | Princeton University Senior Theses |
| Language: | en |
| Appears in Collections: | Computer Science, 1987-2024 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| LIN-ANDREW-THESIS.pdf | 893.19 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.