Performance of Concurrency Control Algorithms in Distributed Systems
AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH
Pagination or Media Count:
The performance of concurrency control algorithms is explored in the context of pessimistic distributed mutual exclusion algorithms. A detailed model of the underlying asynchronous distributed system and its parameters are defined for fail-free systems and systems where processes may fail. New performance metrics are proposed as a means to measure the efficiency of distributed mutual exclusion algorithms. A model of distributed mutual exclusion algorithms and analytical approximations of their performance are developed. Simulation results of five selected distributed mutual exclusion algorithms on fully-connected, star and ring topologies are cataloged. Finally, simulation results of four selected distributed mutual exclusion algorithms on a fully-connected topology where processes may fail are cataloged. Conclusions are drawn as to which algorithm is most appropriate for particular environments.
- Computer Systems