Some Modifications of the Tournament Algorithm for the Mutual Exclusion Problem
Yoshihide Igarashi, Hironobu Kurumazaki, Yasuaki Nishitani · 1999
Introduction Mutual exclusi) i a problem ofmanagiO access to asiz(4 iz(4]fiz)4z resource that can only support one user at ati/I An earlyalgori/) for the mutual exclusic problem was proposed byDiL4z(] [6]. TheorizOP/ versi/ of the DiPL//]fiz algori/] was presented on a modelassumiI a shared memorywio atomi read and wri] operatiP]fi The DiF//z/]fi algoriz/ guarantees mutualexclusi/] buti does not guaranteehi]z/PO el faiz(O44 SubsequentalgorifizF areie]z vements on the Di4FLz]fiz algori]fi by guaranteein fain]F to the die]z( t users [15], [16], weakeniF the type of shared memory [1]--[3], [5], [7]--[10], ordescrifiFL algorifiFL i more clearly speciFO shared memory models [9], [12], [13]. The tournament algori]fi for the mutual exclusic problemi orim]FPI( from the tournament protocol of Peterson andFi]FI [16]. Si]. the shared memory model usedi the tournament protocoli not clear enough to analyzeil runni] tini we use the tournament algorifi( descri ed i terms of I/O automatai t