This Article 
 Bibliographic References 
 Add to: 
The Run-Time Efficiency of Parallel Asynchronous Algorithms
November 1991 (vol. 40 no. 11)
pp. 1260-1266

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.

[1] G. M. Baudet, "Asynchronous iterative methods for multiprocessors,"J. ACM, vol. 25, no. 2, pp. 226-244, Apr. 1978.
[2] D. Chazan and W. Miranker, "Chaotic relaxation,"Lin. Alg. Appl., vol. 2, 1969.
[3] D. Y. Chang and D. J. Kuck, "On the effective bandwidth of parallel memories,"IEEE Trans. Comput.pp. 480-489, May 1977.
[4] M. Dubois and F. A. Briggs, "Performance of synchronized iterative processes in multiprocessor systems,"IEEE Trans. Software Eng., 1982.
[5] M. Dubois, "Throughput analysis of cache-based multiprocessors with multiple buses,"IEEE Trans. Comput., vol. 37, Jan. 1988.
[6] A. Goyal and T. Agerwala, "Performance analysis of future shared storage systems,"IBM J. Res. Develop., vol. 28, no. 1, Jan. 1984.
[7] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[8] L. Kleinrock,Queuing Systems, Vol. I and II. New York: Wiley, 1976.
[9] H. T. Kung, "Synchronized and asynchronous parallel algorithms for multiprocessors," inAlgorithms and Complexity: New Directions and Recent Results, J. F. Traub, Ed. New York: Academic, 1976.
[10] J. H. Patel, "Performance of processor-memory interconnections for multiprocessors,"IEEE Trans. Comput., vol. C-30, pp. 771-780, 1981.
[11] J. H. Patel, "Analysis of multiprocessors with private cache memories,"IEEE Trans. Comput., vol. C-31, pp. 296-304, Apr. 1982.
[12] J. T. Robinson, "Some analysis techniques for asynchronous multiprocessor algorithms,"IEEE Trans. Software Eng., vol. SE-5, Jan. 1979.
[13] A. Uresin and M. Dubois, "Sufficient conditions for the convergence of asynchronous iterations,"Parallel Computing, vol. 10, pp. 83-92, 1989.
[14] T. S. Axelrod, "Effects of synchronization barriers on multiprocessor performance,"Parallel Computing, vol. 3, pp. 129-140, 1986.
[15] D. P. Bertsekas and J. N. Tsitsiklis,Parallel and Distributed Computations. Englewood Cliffs, NJ: Prentice-Hall, 1989.

Index Terms:
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, F.A. Briggs, "The Run-Time Efficiency of Parallel Asynchronous Algorithms," IEEE Transactions on Computers, vol. 40, no. 11, pp. 1260-1266, Nov. 1991, doi:10.1109/12.102830
Usage of this product signifies your acceptance of the Terms of Use.