Skip navigation


  • DSpace logo
  • Home
  • Collections
  • Researcher Profile
  • Explore by
    • Researcher Profile
  • VGU library
  • Help
  • User Guide
  • Sign on to:
    • My DSpace
    • Receive email
      updates
    • Edit Account details

VGU RESEARCH REPOSITORY


Please use this identifier to cite or link to this item: https://epub.vgu.edu.vn/handle/dlibvgu/1718
DC FieldValueLanguage
dc.contributor.authorHuynh Minh Trieten_US
dc.date.accessioned2023-10-26T03:52:22Z-
dc.date.available2023-10-26T03:52:22Z-
dc.date.issued2023-
dc.identifier.urihttps://epub.vgu.edu.vn/handle/dlibvgu/1718-
dc.description.abstractDistributed systems frequently rely on mutual exclusion algorithms to maintain properties such as liveness and safety, often addressing concerns like race conditions and deadlocks. However, the majority of existing algorithm descriptions or specifications operate under the assumption of ideal network conditions, devoid of external faults. This thesis provides a quantitative evaluation of these algorithms when subjected to network anomalies. Presented in this thesis is a prototype that serves as a template adaptable to various mutual exclusion implementations. Utilizing the Hypothesis testing framework, the prototype assesses algorithmic correctness and later simulates faulty network conditions through fault injection techniques. Data from multiple test runs are then collected for subsequent analysis. Three prominent algorithms—Ricart-Agrawala, Maekawa, and Token Ring—are evaluated in this thesis. The findings indicate that Maekawa’s algorithm exhibits superior performance in terms of reduced message complexity and enhanced resilience to delays. These attributes suggest that Maekawa’s algorithm may be particularly well-suited for real-world applications where system scalability and message latency are critical factors.en_US
dc.language.isoenen_US
dc.rightsAttribution-NonCommercial 4.0 International*
dc.rights.urihttps://creativecommons.org/licenses/by-nc/4.0/*
dc.titleLatency and fault tolerance: An analysis of mutual exclusion algorithms in distributed systemsen_US
dc.typeThesisen_US
item.languageiso639-1other-
item.fulltextWith Fulltext-
item.grantfulltextrestricted-
Appears in Collections:Computer Science (CS)
Files in This Item:
File Description SizeFormat Existing users please Login
Latency and Fault Tolerance an analysis of Mutual Exclusion Algorithms.pdf1.81 MBAdobe PDF
Show simple item record

Page view(s)

144
checked on Apr 4, 2026

Download(s)

44
checked on Apr 4, 2026

Google ScholarTM

Check


This item is licensed under a Creative Commons License Creative Commons

© Copyright 2020 by Vietnamese - German University Library.
Add: Ring road 4, Quarter 4, Thoi Hoa Ward, Ben Cat City, Binh Duong Province
Tel.:(0274) 222 0990. Ext.: 70206