|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| L. Kleinrock, J.H. Huang, "On Parallel Processing Systems: Amdahl's Law Generalized and Some Results on Optimal Design," IEEE Transactions on Software Engineering, vol. 18, no. 5, pp. 434-447, May, 1992. | |||
| BibTex | x | ||
| @article{ 10.1109/32.135776, author = {L. Kleinrock and J.H. Huang}, title = {On Parallel Processing Systems: Amdahl's Law Generalized and Some Results on Optimal Design}, journal ={IEEE Transactions on Software Engineering}, volume = {18}, number = {5}, issn = {0098-5589}, year = {1992}, pages = {434-447}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.135776}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - On Parallel Processing Systems: Amdahl's Law Generalized and Some Results on Optimal Design IS - 5 SN - 0098-5589 SP434 EP447 EPD - 434-447 A1 - L. Kleinrock, A1 - J.H. Huang, PY - 1992 KW - Amdahl law; optimal design; parallel processing system; speedup result; power; general queuing; computer-communication systems; optimal job input; performance indices; discrete model; continuous model; computer communications software; operating systems (computers); parallel processing; queueing theory VL - 18 JA - IEEE Transactions on Software Engineering ER - | |||
The authors model a job in a parallel processing system as a sequence of stages, each of which requires a certain integral number of processors for a certain interval of time. They derive the speedup of the system for two cases: systems with no arrivals, and systems with arrivals. In the case with no arrivals, their speedup result is a generalization of Amdahl's law (G.M. Amdahl, 1967). They extend the notion of power as previously applied to general queuing and computer-communication systems to their case of parallel processing systems. They find the optimal job input and the optimal number of processors to use so that power is maximized. Many of the results for the case of arrivals are the same as for the case of no arrivals. It is found that the average number of jobs in the system with arrivals equals unity when power is maximized. They also model a job in such a way that the number of processors required continuously varies over time. The same performance indices and parameters studied in the discrete model are evaluated for this continuous model.
[1] G. M. Amdahl, "Validity of the single processor approach to achieving large scale computing capabilities,"Proc. AFIPS, vol. 30, 1967.
[2] R. E. Benn, J. L. Gustafson, and R. E. Montry, "Development and analysis of scientific application programs on a 1024-processor hypercube," Sandia Nat. Labs., Albuquerque, NM, Tech. Rep. SAND 88-0317, Feb. 1988.
[3] E. G. Coffman and P. J. Denning,Operating Systems Theory. Englewood Cliffs, NJ: Prentice-Hall, 1973.
[4] D. L. Eager, J. Zahorjan, and E. D. Lazowska, "Speedup versus efficiency in parallel systems,"IEEE Trans. Computers, vol. 38, pp. 408-423, Mar. 1989.
[5] H. R. Gail, "On the optimization of computer network power," Ph.D. diss., Computer Sci. Dept., UCLA, Sept. 1983.
[6] E. Gelenbe,Multiprocessor Performance. New York: Wiley, 1989.
[7] J. L. Gustafson, "Re-evaluating Amdahl's Law,"Commun. ACM, vol. 31, no. 5, pp. 532-533, 1988.
[8] J. Huang, "On the behavior of algorithms in a multiprocessing environment," Ph.D. diss., Computer Sci. Dept., UCLA, 1988.
[9] L. Kleinrock,Queueing Systems, vol. 1,Theory. New York: Wiley-Interscience, 1975.
[10] L. Kleinrock,Queueing Systems, vol. 2,Computer Applications. New York: Wiley-Interscience, 1976.
[11] L. Kleinrock, "On flow control in computer networks," inConf. Rec., Int. Conf. on Communications, June 1978, vol. 2, pp. 27.2.1-27.2.5.
[12] L. Kleinrock, "Power and deterministic rules of thumb for probabilistic problems in computer communications," inConf. Rec., Int. Conf. on Communications, June 1979, pp. 43.1.1-43.1.10.
[13] K. C. Kung, "Concurrency in parallel processing systems," Ph.D. diss., Computer Sci. Dept., UCLA, 1984.
[14] J. D. C. Little, "A proof of the queueing formulaL =λW,"Operations Res., vol. 9, pp. 383-387, 1961.
[15] K. C. Sevcik, "Characterization of parallelism in applications and their use in scheduling,"ACM SIGMETRICS, pp. 171-180, 1989.