All Words
Exact Phrase
Title Search Only
advanced search
Digital Archives Initiative
Memorial University - Electronic Theses and Dissertations 2
Anthropology
Aquaculture
Archaeology
Biochemistry
Biology
Biopsychology
Chemistry
Classics
Community Health
Computational Science
Computer Science
Counselling Centre
Earth Sciences
Economics
Education
Educational Administration
Educational Psychology
Engineering
English
Environmental Science
Folklore
French and Spanish
Geography
German and Russian
History
Human Kinetics and Recreation
Linguistics
Marine Studies
Mathematics and Statistics
Medicine
Nursing
Pharmacy
Philosophy
Physics and Physical Oceanography
Political Science
Psychology
Religious Studies
Social Work
Sociology
Toxicology
Women's Studies
home
browse
preferences
my favorites
about/feedback
recent uploads
help/search tips
Français
menu off
add document to favorites
:
add page to favorites
:
reference url
back to results
:
previous
:
next
Search this object:
0
hit(s) ::
previous hit
:
next hit
View:
document description
page description
page & text
previous page
:
next page
Document Description
Title
An
efficient
mutual
exclusion
method
in
distributed
systems
Author
Chen
,
Hao
Description
Thesis
(M.Sc.)--Memorial
University
of
Newfoundland
,
1994.
Computer
Science
Date
1994
Pagination
viii, 70 leaves : ill.
Subject
Distributed
operating
systems
(Computers);
Electronic
data
processing--Distributed
processing;
Computer
algorithms
Degree
M.Sc.
Degree Grantor
Memorial University of Newfoundland. Dept. of Computer Science
Discipline
Computer Science
Language
Eng
Notes
Bibliography:
leaves
65-70.
Abstract
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.
Type
Text
Resource Type
Electronic
thesis
or
dissertation
Format
Image/jpeg;
Application/pdf
Source
Paper copy kept in the Centre for Newfoundland Studies, Memorial University Libraries
Local Identifier
76221247
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.
Collection
Electronic
Theses
and
Dissertations
Scanning Status
Completed
PDF File
(18.85
MB)
--
http://collections.mun.ca/PDFs/theses/Chen_Hao.pdf
CONTENTdm file name
181868.cpd