Performance comparison of three tree-based mutual exclusion algorithms in a simulated distributed computing environment
In a distributed system, the design of a mutual exclusion algorithm consists of defining the protocols used to coordinate access to a shared object. A distributed algorithm for mutual exclusion is characterized by ( 1) all processes have an equal amount of information; (2) all processes make a decision based on local information. Many distributed algorithms for mutual exclusion have been proposed, but this thesis is only concerned with the token-based algorithms which involve lower communication traffic overhead than non-token-based algorithms. This thesis implements three token-based algorithms and compares their performances in terms of the average token delivery time and the total execution time in a distributed computing environment in a simulated application.
Computer algorithms, Computer network protocols
Jiang, Y. (2004). <i>Performance comparison of three tree-based mutual exclusion algorithms in a simulated distributed computing environment</i> (Unpublished thesis). Texas State University-San Marcos, San Marcos, Texas.