| Summary: | 碩士 === 國立臺灣大學 === 電機工程學系 === 86 === In this thesis we proposed a new token-based mutual exclusion
algorithm for distributed systems. It is based on actual networks
instead of fully-connected logical networks to reduce message
count and shorten response time. This algorithm does not need
FIFO-order communication links, is suitable for systems with low
bandwidth and heavy load, and can be simply implemented without
using complex sequence numbers and timestamps.
We evaluated this algorithm in a simulation environment of
three network topologies (hypercube, 3D mesh and 2D mesh),
mutiple network sizes and system load levels, and compared its
message count and response time with three other typical
algorithms. We found that our algorithm has the best performance
in 86% of the test conditions and performs especially well in
systems with low bandwidth and heavy load. Therefore we assert
that distributed mutual exclusion algorihms based on actual
networks have better performance.
|
|---|
