Award Date

1-1-1993

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

First Committee Member

Kia Makki

Number of Pages

159

Abstract

In any system in which concurrent processes share resources, mutual exclusion refers to the problem of guaranteeing the integrity of those resources by restricting their use to one process at a time. Due the complex nature of distributed systems, distributed mutual exclusion algorithms are often not amenable to theoretical analysis for performance or even correctness. Experimental inquiries are therefore warranted. This thesis investigates seven well known distributed mutual exclusion algorithms in detail, and uses computer simulation to evaluate the performance and applicability of these various algorithms. Toward this end, a realistic and general model for evaluating distributed algorithms is proposed. Results of the experiments include the discovery of starvation and deadlock problems in two algorithms, the identification of one algorithm as the best performer in a general network in which sites do not fail, and experimental performance analysis of one algorithm which accommodates site failures.

Keywords

Algorithms; Distributed; Evaluation; Exclusion; Mutual; Performance

Controlled Subject

Computer science

File Format

pdf

File Size

4136.96 KB

Degree Grantor

University of Nevada, Las Vegas

Language

English

Permissions

If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.

Identifier

https://doi.org/10.25669/b3dz-83lp


Share

COinS