Show simple item record

dc.contributor.advisorWoelfel, Philipp
dc.contributor.advisorGolab, Wojciech
dc.contributor.authorKahlon, Amandeep
dc.date.accessioned2014-09-30T22:10:40Z
dc.date.available2014-11-17T08:00:52Z
dc.date.issued2014-09-30
dc.date.submitted2014en
dc.identifier.citationKahlon, A. (2014). Performance Comparison of Randomized and Deterministic Mutual Exclusion Algorithms (Unpublished master's thesis). University of Calgary, Calgary, AB. doi:10.11575/PRISM/27292en_US
dc.identifier.urihttp://hdl.handle.net/11023/1892
dc.description.abstractMutual 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.en_US
dc.language.isoeng
dc.rightsUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.
dc.subjectComputer Science
dc.titlePerformance Comparison of Randomized and Deterministic Mutual Exclusion Algorithms
dc.typemaster thesis
dc.publisher.facultyGraduate Studies
dc.publisher.institutionUniversity of Calgaryen
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/27292
thesis.degree.nameMaster of Science
thesis.degree.nameMS
thesis.degree.nameMSc
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Calgary
atmire.migration.oldid2724
dc.publisher.placeCalgaryen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record