Date of Award

6-3-2011

Document Type

Thesis (Undergraduate)

Department

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.

Share

COinS