This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Speedup Versus Efficiency in Parallel Systems
March 1989 (vol. 38 no. 3)
pp. 408-423
The tradeoff between speedup and efficiency that is inherent to a software system is investigated. The extent to which this tradeoff is determined by the average parallelism of the software system, as contrasted with other, more detailed, characterizations, is shown. The extent to which both speedup and efficiency can simultaneously be poor is bound: it is shown that for any software system and

[1] G. M. Amdahl, "Validity of the single processor approach to achieving large-scale computing capabilities," inProc. AFIPS, vol. 30, 1967, pp. 483-485.
[2] T. C. Chen, "Overlap and pipeline processing," inIntroduction to Computer Architecture, H. Stone, Ed. SRA, 1975, pp. 375-431.
[3] P. J. Denning, "Working sets past and present,"IEEE Trans. Software Eng., vol. SE-6, no. 1, pp. 64-84, 1980.
[4] P. J. Denning and J. P. Buzen, "The operational analysis of queueing network models,"ACM Comput. Surveys, vol. 10, pp. 225-261, Sept. 1978.
[5] G. Fayolle, P. J. B. King, and I. Mitrani, "On the execution of programs by many processors," inProc. Performance'83. Amsterdam: North-Holland, 1983, pp. 217-228.
[6] R. L. Graham, "Bounds for certain multiprocessing anomalies,"Bell Syst. Tech. J., vol. 45, pp. 1563-1581, 1966.
[7] J. R. Gurd, C. C. Kirkham, and I. Watson, "The Manchester prototype dataflow computer,"Commun. ACM, vol. 28, no. 1, pp. 34-52, Jan. 1985.
[8] P. Heidelberger and K. S. Trivedi, "Queueing network models for parallel processing with asynchronous tasks,"IEEE Trans. Comput., vol. C-31, no. 11, pp. 1099-1109, 1982.
[9] L. Kleinrock,Queueing Systems: Vol. 2, Computer Applications. New York: Wiley, 1976.
[10] L. Kleinrock, "Power and deterministic rules of thumb for probabilistic problems in computer communications," inProc. Int. Conf. Commun, 1979, pp. 43.1.1-43.1.10.
[11] D. J. Kuck, "A survey of parallel machine organization and programming,"ACM Computing Surv., vol. 9, no. 1, Mar. 1977.
[12] D. J. Kucket al., "The effects of program restructuring, algorithm change and architecture choice on program parallelism," inProc. Int. Conf. Parallel Processing, 1984, pp. 129-138.
[13] B. Kumar and T. A. Gonsalves, "Modelling and analysis of distributed software systems," inProc. 7th ACM Symp. Oper. Syst. Principles, 1979, pp. 2-8.
[14] K. C-Y. Kung, "Concurrency in parallel processing systems," UCLA CSD Rep. 840039, Comput. Sci. Dep. Univ. of California, Los Angeles, 1984.
[15] M. Minsky and S. Papert, "On some associative, parallel and analog computations," inAssociative Information Technologies, E. J. Jacks, Ed New York: Elsevier North Holland, 1971.
[16] R. R. Muntz and J.W.-N. Wong, "Asymptotic properties of closed queueing network models," inProc. 8th Princeton Conf. Inform. Sci. Syst., 1974, pp. 348-352.

Index Terms:
parallel systems; speedup; efficiency; software system; average parallelism; parallel programming; program testing.
Citation:
D.L. Eager, J. Zahorjan, E.D. Lazowska, "Speedup Versus Efficiency in Parallel Systems," IEEE Transactions on Computers, vol. 38, no. 3, pp. 408-423, March 1989, doi:10.1109/12.21127
Usage of this product signifies your acceptance of the Terms of Use.