This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance of Synchronous Parallel Algorithms with Regular Structures
January 1991 (vol. 2 no. 1)
pp. 105-116

New methods are presented for bounding and approximating the mean execution time ofpartitioning algorithm, and these methods are compared to previous approaches.Distribution-driven and program-driven simulations show that two of the methods areusually accurate to within 10% and give good estimates even when certain independenceassumptions are violated. Asymptotic approximations and upper bounds are derived forthe average execution time of multiphase algorithms when there is no contention forprocesses in the parallel phase. In addition, the authors bound the average executiontime under static and dynamic scheduling policies and determine the optimum number ofparallel tasks to be created to minimize the execution time bounds with constantscheduling overhead.

[1] J. Mohan, "Performance of parallel programs: Model and analyses," Ph.D. dissertation, Dep. Comput. Sci., Carnegie-Mellon Univ., July 1984.
[2] E.F. Gehringer, D.P. Siewiorek, and Z. Segall,Parallel Processing: The Cm*Experience, Digital Press, Billerica, Mass., 1987.
[3] M. Dubois and F.A. Briggs, "Performance of synchronized iterative processes in multiprocessor systems,"IEEE Trans. Software Eng., vol. SE-8, no. 4, pp. 419-431, July 1982.
[4] 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, pp. 153-200.
[5] J.T. Robinson, "Some analysis techniques for asynchronous multiprocessor algorithms,"IEEE Trans. Software Eng., vol. SE-5, pp. 24-31, Jan. 1979.
[6] H.A. David,Order Statistics.New York: Wiley, 1981.
[7] A. H.-S. Ang and W. H. Tang,Probability Concepts in Engineering Planning and Design Vol. II.Rainbow-Bridge, 1984.
[8] B. W. Weide, "Analytical models to explain the anomalous behavior of parallel programs," inProc. 1981 Int. Conf. Parallel Processing, Aug. 1981, pp. 183-187.
[9] C. P. Kruskal and A. Weiss, "Allocating independent subtasks on parallel processors," inProc. 1984 Int. Conf. Parallel Processing, Aug. 1984., pp. 236-240.
[10] R. G. Covington, S. Madala, V. Mehtaet al., "The Rice parallel processing testbed," inProc. 1988 ACM SIGMETRICS Conf., Santa Fe, NM, May 1988, pp. 4-11.
[11] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.

Index Terms:
Index Termsdistribution driven simulations; asymptotic approximations; synchronous parallelalgorithms; regular structures; bounding; mean execution time; partitioning algorithm;program-driven simulations; upper bounds; average execution time; multiphasealgorithms; scheduling policies; parallel tasks; execution time bounds; parallel algorithms; parallel programming; performance evaluation; scheduling
Citation:
S. Madala, J.B. Sinclair, "Performance of Synchronous Parallel Algorithms with Regular Structures," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 1, pp. 105-116, Jan. 1991, doi:10.1109/71.80193
Usage of this product signifies your acceptance of the Terms of Use.