{"id":{"repo_id":"unlv","oai_identifier":"oai:oasis.library.unlv.edu:rtds-1279"},"canonical_url":"https://search.dev.ndltd.org/etd/unlv/oai:oasis.library.unlv.edu:rtds-1279","repository":{"repo_id":"unlv","name":"University of Nevada - Las Vegas","base_url":"https://oasis.library.unlv.edu/do/oai/"},"display":{"title":"Performance evaluation of distributed mutual exclusion algorithms","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Been, Kenneth B"],"institution":"University of Nevada, Las Vegas","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kia Makki"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1993,"date_issued":"1993-01-01T08:00:00Z","date_published":"1993-01-01T08:00:00Z","updated_at":"2026-07-24T05:24:22Z","subjects":[],"languages":["English"],"rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://oasis.library.unlv.edu/rtds/280"],"render_values":[{"text":"https://oasis.library.unlv.edu/rtds/280","href":"https://oasis.library.unlv.edu/rtds/280","code":true}]}]},"links":{"outbound_url":"https://doi.org/10.25669/b3dz-83lp","outbound_label":"DOI","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kia Makki"]},{"key":"dc:creator","label":"Author","values":["Been, Kenneth B"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["University of Nevada, Las Vegas"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.25669/b3dz-83lp","https://oasis.library.unlv.edu/rtds/280","https://oasis.library.unlv.edu/context/rtds/article/1279/viewcontent/uc.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:format","label":"Dc Format","values":["pdf"]},{"key":"dc:title","label":"Title","values":["Performance evaluation of distributed mutual exclusion algorithms"]}]}],"canonical_facts":{"dc:contributor":["Kia Makki"],"dc:creator":["Been, Kenneth B"],"dc:description.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."],"dc:format":["pdf"],"dc:identifier":["10.25669/b3dz-83lp","https://oasis.library.unlv.edu/rtds/280","https://oasis.library.unlv.edu/context/rtds/article/1279/viewcontent/uc.pdf"],"dc:language":["English"],"dc:publisher":["University of Nevada, Las Vegas"],"dc:rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Performance evaluation of distributed mutual exclusion algorithms"],"dc:type":["Text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-07-24T05:24:22Z"}