Issue No.11 - November (1991 vol.40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.102830
<p>The problem studied is similar to the problems found in multiprocessor operating systems. The lockout problem in multiprocessor operating systems is a direct result of multiple processors attempting to process common data structures asynchronously. There are numerous such shared data structures. The models developed are applicable to the study of contention for software and hardware resources in multiprocessor operating systems. The authors introduce an approximate analytical model to evaluate the performance of asynchronous processes found in asynchronous algorithms, including the combined effects of software lockout on critical sections and on job queues, and of shared-memory access conflicts. Because of the strong similarities between the two effects, the same model can be used for both, leading to a uniform and elegant formulation. The models are combined to find the run-time efficiency of asynchronous iterations.</p>
software resources; performance evaluation; run-time efficiency; parallel asynchronous algorithms; shared data structures; hardware resources; multiprocessor operating systems; approximate analytical model; software lockout; job queues; shared-memory access conflicts; run-time efficiency; data structures; network operating systems; parallel algorithms; performance evaluation.
M. Dubois, "The Run-Time Efficiency of Parallel Asynchronous Algorithms", IEEE Transactions on Computers, vol.40, no. 11, pp. 1260-1266, November 1991, doi:10.1109/12.102830