Performance Comparison of Randomized and Deterministic Mutual Exclusion Algorithms
Date
2014-09-30
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Mutual exclusion is a well known in distributed computing. Mutual exclusion comes into existence when n processes try to access the Critical Section at the same time. It prevents any two processes from accessing the Critical Section simultaneously. Mutual exclusion is a
standard building block for shared memory algorithms.
This thesis presents the performance comparison of various Randomized and Deterministic mutual exclusion algorithms. The performance of these algorithms is compared in the same environment and using the same platform. To perform these comparison tests, time taken by processes to execute mutual exclusion algorithms is measured in isolation, and in data structures (implemented based on mutual exclusion algorithms). Diff erent test cases have been considered to gain some insight about how diff erent algorithms behave under diff erent levels of contention. These test cases involve various combinations of insertion, deletion and look-up operations.
From this comparison tests, we gain some insight about which mutual exclusion algorithms are most resilient to contention. We can use this knowledge while doing concurrent programming. We can choose our mutual exclusion locks based on insertions, deletions and look-ups
in the concurrent programming.
Description
Keywords
Computer Science
Citation
Kahlon, A. (2014). Performance Comparison of Randomized and Deterministic Mutual Exclusion Algorithms (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/27292