Date of Award
6-3-2011
Document Type
Thesis (Undergraduate)
Department or Program
Department of Computer Science
First Advisor
Prasad Jayanti
Abstract
We specify and prove an algorithm solving k-Exclusion, a generalization of the Mutual Exclusion problem. k-Exclusion requires that at most k processes be in the Critical Section (CS) at once; in addition, we require bounded exit, starvation freedom and fairness properties. The goal within this framework is to minimize the number of Remote Memory References (RMRs) made. Previous algorithms have required Omega(k) RMRs in the worst case. Our algorithm requires O(log k) RMRs in the worst case under the Cache-Coherent (CC) model, a considerable improvement in time complexity.
Recommended Citation
Choi, Jonathan H., "A Solution to k-Exclusion with O(logk) RMR Complexity" (2011). Dartmouth College Undergraduate Theses. 68.
https://digitalcommons.dartmouth.edu/senior_theses/68
Comments
Originally posted in the Dartmouth College Computer Science Technical Report Series, number TR2011-682.