An efficient mutual exclusion method in distributed systems
Thesis (M.Sc.)--Memorial University of Newfoundland, 1994. Computer Science Bibliography: leaves 65-70. Many operations in a distributed system require mutual exclusion to guarantee correctness. Quorum methods have been widely proposed for implementing mutual exclusion. Majority quorum consensus is...
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis |
Language: | English |
Published: |
1994
|
Subjects: | |
Online Access: | http://collections.mun.ca/cdm/ref/collection/theses2/id/181686 |
id |
ftmemorialunivdc:oai:collections.mun.ca:theses2/181686 |
---|---|
record_format |
openpolar |
spelling |
ftmemorialunivdc:oai:collections.mun.ca:theses2/181686 2023-05-15T17:23:31+02:00 An efficient mutual exclusion method in distributed systems Chen, Hao Memorial University of Newfoundland. Dept. of Computer Science 1994 viii, 70 leaves : ill. Image/jpeg; Application/pdf http://collections.mun.ca/cdm/ref/collection/theses2/id/181686 Eng eng Electronic Theses and Dissertations (18.85 MB) -- http://collections.mun.ca/PDFs/theses/Chen_Hao.pdf 76221247 http://collections.mun.ca/cdm/ref/collection/theses2/id/181686 The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission. Paper copy kept in the Centre for Newfoundland Studies, Memorial University Libraries Distributed operating systems (Computers) Electronic data processing--Distributed processing Computer algorithms Text Electronic thesis or dissertation 1994 ftmemorialunivdc 2015-08-06T19:17:06Z Thesis (M.Sc.)--Memorial University of Newfoundland, 1994. Computer Science Bibliography: leaves 65-70. Many operations in a distributed system require mutual exclusion to guarantee correctness. Quorum methods have been widely proposed for implementing mutual exclusion. Majority quorum consensus is the best known quorum method. It has the merit of simplicity, but may incur high message overhead. Tree algorithm is an efficient structured quorum method to the mutual exclusion problems. The quorums generated by a tree algorithm are smaller on the average than those by a majority quorum consensus. However, the tree algorithm enforces a highly biased treatment to the nodes at different levels. This affects its performance in a distributed system where the nodes have similar characteristics. We propose a new structured quorum method called triangular net quorum algorithm, which treats the nodes more evenly than the tree algorithm while preserving a satisfactory availability, as well as lowering average quorum size. We believe that this method is desirable for implementing mutual exclusion in a truly distributed system. Thesis Newfoundland studies University of Newfoundland Memorial University of Newfoundland: Digital Archives Initiative (DAI) |
institution |
Open Polar |
collection |
Memorial University of Newfoundland: Digital Archives Initiative (DAI) |
op_collection_id |
ftmemorialunivdc |
language |
English |
topic |
Distributed operating systems (Computers) Electronic data processing--Distributed processing Computer algorithms |
spellingShingle |
Distributed operating systems (Computers) Electronic data processing--Distributed processing Computer algorithms Chen, Hao An efficient mutual exclusion method in distributed systems |
topic_facet |
Distributed operating systems (Computers) Electronic data processing--Distributed processing Computer algorithms |
description |
Thesis (M.Sc.)--Memorial University of Newfoundland, 1994. Computer Science Bibliography: leaves 65-70. Many operations in a distributed system require mutual exclusion to guarantee correctness. Quorum methods have been widely proposed for implementing mutual exclusion. Majority quorum consensus is the best known quorum method. It has the merit of simplicity, but may incur high message overhead. Tree algorithm is an efficient structured quorum method to the mutual exclusion problems. The quorums generated by a tree algorithm are smaller on the average than those by a majority quorum consensus. However, the tree algorithm enforces a highly biased treatment to the nodes at different levels. This affects its performance in a distributed system where the nodes have similar characteristics. We propose a new structured quorum method called triangular net quorum algorithm, which treats the nodes more evenly than the tree algorithm while preserving a satisfactory availability, as well as lowering average quorum size. We believe that this method is desirable for implementing mutual exclusion in a truly distributed system. |
author2 |
Memorial University of Newfoundland. Dept. of Computer Science |
format |
Thesis |
author |
Chen, Hao |
author_facet |
Chen, Hao |
author_sort |
Chen, Hao |
title |
An efficient mutual exclusion method in distributed systems |
title_short |
An efficient mutual exclusion method in distributed systems |
title_full |
An efficient mutual exclusion method in distributed systems |
title_fullStr |
An efficient mutual exclusion method in distributed systems |
title_full_unstemmed |
An efficient mutual exclusion method in distributed systems |
title_sort |
efficient mutual exclusion method in distributed systems |
publishDate |
1994 |
url |
http://collections.mun.ca/cdm/ref/collection/theses2/id/181686 |
genre |
Newfoundland studies University of Newfoundland |
genre_facet |
Newfoundland studies University of Newfoundland |
op_source |
Paper copy kept in the Centre for Newfoundland Studies, Memorial University Libraries |
op_relation |
Electronic Theses and Dissertations (18.85 MB) -- http://collections.mun.ca/PDFs/theses/Chen_Hao.pdf 76221247 http://collections.mun.ca/cdm/ref/collection/theses2/id/181686 |
op_rights |
The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission. |
_version_ |
1766112949401812992 |