Some Modifications of the Tournament Algorithm for the Mutual Exclusion Problem

Yoshihide IGARASHI

IEICE TRANSACTIONS on Information and Systems   Vol.E82-D    No.2    pp.368-375
Publication Date: 1999/02/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Algorithm and Computational Complexity
asynchronous processes,  concurrency,  distributed system,  lockout-freedom,  mutual exclusion,  shared memory,  

Full Text: PDF>>
Buy this Article

We propose two lockout-free (starvation-free) mutual exclusion algorithms for the asynchronous multi-writer/reader shared memory model. The first algorithm is a modification of the well-known tournament algorithm for the mutual exclusion problem. By the modification we can speed up the original algorithm. The running time of the modified algorithm from the entrance of the trying region to the entrance of the critical region is at most (n-1)c+O(nl), where n is the number of processes, l is an upper bound on the time between successive two steps of each process, and c is is an upper bound on the time that any user spends in the critical region. The second algorithm is a further modification of the first algorithm. It is designed so that some processes have an advantage of access to the resource over other processes.