Speedup Versus Efficiency in Parallel Systems

IEEE Transactions on Computers

Volumn 38, Issue 3, 1989, Pages 408-423

  Eager, Derek L ^a   Zahorjan, John ^b   Lazowska, Edward D ^b  

^a UNIVERSITY OF SASKATCHEWAN   (Canada)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Bounds on performance; computer system performance analysis; parallel computing; parallel software; parallel software structure; performance

Indexed keywords

COMPUTER SOFTWARE;

AVERAGE PROCESSOR UTILIZATION; EXECUTION TIME-EFFICIENCY PROFILE; MAXIMUM POSSIBLE SPEEDUP;

COMPUTER SYSTEMS, DIGITAL;

EID: 0024627264     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.21127     Document Type: Article

References (16)

1. G.M. Amdahl, “Validity of the single processor approach to achieving large-scale computing capabilities,” in Proc. AFIPS, vol. 30, 1967, pp. 483–485.
2. T.C. Chen, “Overlap and pipeline processing,” in Introduction 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,” Comput. Surveys, vol. 10, no. 3, pp. 225–261, 1978.
5. G. Fayolle, P.J.B. King, and I. Mitrani, “On the execution of programs by many processors,” in Proc. 9th Int. Symp. Comput. Perform. Modeling, Measurement Eval. 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, 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,” in Proc. Int. Conf. Commun., 1979, pp. 43.1.1–43.1.10.
11. D.J. Kuck, “A survey of parallel machine organization and programming,” ACM Comput. Surveys, vol. 9, no. 1, pp. 29–59, 1977.
12. D.J. Kuck et al., “The effects of program restructuring, algorithm change and architecture choice on program parallelism, “in Proc. Int. Conf. Parallel Processing, 1984, pp. 129–138.
13. B. Kumar and T.A. Gonsalves, “Modelling and analysis of distributed software systems,” in Proc. 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,” in Associative 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,” in Proc. 8th Princeton Conf. Inform. Sci. Syst., 1974, pp. 348–352.