Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp0176537445vFull metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Lloyd, Wyatt | - |
| dc.contributor.author | Lin, Andrew | - |
| dc.date.accessioned | 2021-08-17T15:07:08Z | - |
| dc.date.available | 2021-08-17T15:07:08Z | - |
| dc.date.created | 2021-04-13 | - |
| dc.date.issued | 2021-08-17 | - |
| dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp0176537445v | - |
| dc.description.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. | en_US |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en_US |
| dc.title | MinPaxos: Simplifying Log Replication for Fault Tolerance | en_US |
| dc.type | Princeton University Senior Theses | |
| pu.date.classyear | 2021 | en_US |
| pu.department | Computer Science | en_US |
| pu.pdf.coverpage | SeniorThesisCoverPage | |
| pu.contributor.authorid | 920151947 | |
| pu.mudd.walkin | No | en_US |
| Appears in Collections: | Computer Science, 1987-2023 | |
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.