Date of Award
Department of Computer Science
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.
Bowman, Jack R., "Obstruction-free Snapshot, Obstruction-free Consensus, and Fetch-and-add Modulo k" (2011). Dartmouth College Undergraduate Theses. 67.