Obstruction-free Snapshot, Obstruction-free Consensus, and Fetch-and-add Modulo k

Author

Jack R. Bowman, Dartmouth College

Date of Award

6-3-2011

Document Type

Thesis (Undergraduate)

Department or Program

Department of Computer Science

First Advisor

Prasad Jayanti

Abstract

In this thesis we design algorithms for three problems: snapshot, consensus, and fetch-and-add modulo k. Our solutions for snapshot and consensus are non-anonymous and obstruction-free, and our solution for Fetch-and-add Modulo k is wait-free. We also conjecture an anonymous, obstruction-free solution to consensus.

Comments

Originally posted in the Dartmouth College Computer Science Technical Report Series, number TR2011-681.

Recommended Citation

Bowman, Jack R., "Obstruction-free Snapshot, Obstruction-free Consensus, and Fetch-and-add Modulo k" (2011). Dartmouth College Undergraduate Theses. 67.
https://digitalcommons.dartmouth.edu/senior_theses/67