Semaphore Solutions for General Mutual Exclusion Problems
Description:
Automatic generation of starvation-free semaphore solutions to general mutual exclusion problems is discussed. A reduction approach is introduced for recognizing edge-solvable problems, together with an O(N^2) algorithm for graph reduction, where N is the number of nodes. An algorithm for the automatic generation of starvation-free edge-solvable solutions is presented. The solutions are proved to be very efficient. For general problems, there are two ways to generate efficient solutions. One as…
more
Date:
August 1988
Creator:
Yue, Kwok B. (Kwok Bun)
Partner:
UNT Libraries