Reader-Writer Exclusion Supporting Upgrade and Downgrade with Starvation Freedom

Author

Matthew Elkherj, Dartmouth College

Date of Award

6-1-2011

Document Type

Thesis (Undergraduate)

Department or Program

Department of Computer Science

First Advisor

Prasad Jayanti

Abstract

In this thesis we give a constant Remote-Memory-Reference (on CC systems) reader-writer exclusion algorithm supporting upgrade and downgrade, built from a reader-writer exclusion algorithm by Jayanti and Liu. The algorithm is starvation-free, and allows for repeated upgrades and downgrades.

Comments

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

Recommended Citation

Elkherj, Matthew, "Reader-Writer Exclusion Supporting Upgrade and Downgrade with Starvation Freedom" (2011). Dartmouth College Undergraduate Theses. 70.
https://digitalcommons.dartmouth.edu/senior_theses/70