
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D. Sarkar, "Cost and TimeCost Effectiveness of Multiprocessing," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 704712, June, 1993.  
BibTex  x  
@article{ 10.1109/71.242152, author = {D. Sarkar}, title = {Cost and TimeCost Effectiveness of Multiprocessing}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {4}, number = {6}, issn = {10459219}, year = {1993}, pages = {704712}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.242152}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Cost and TimeCost Effectiveness of Multiprocessing IS  6 SN  10459219 SP704 EP712 EPD  704712 A1  D. Sarkar, PY  1993 KW  Index Termsefficiency; performance; pipelined computers; parallel algorithms; multiprocessor systems; cost effectiveness; timecost effectiveness; multiprocessing systems; parallel algorithms; performance evaluation VL  4 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Speedup and efficiency, two measures for performance of pipelined computers, are nowused to evaluate performance of parallel algorithms for multiprocessor systems. However, these measures consider only the computation time and number of processors used and do not include the number of the communication links in the system. The author defines two new measures, cost effectiveness and timecost effectiveness, for evaluatingperformance of a parallel algorithm for a multiprocessor system. From these two measures two characterization factors for multiprocessor systems are defined and used to analyze some wellknown multiprocessor systems. It is found that for a given penalty function, every multiprocessor architecture has an optimal number of processors that produces maximum profit. If too many processors are used, the higher cost of the system reduces the profit obtained from the faster solution. On the other hand, if too few processors are used, the penalty paid for taking a longer time to obtain the solution reduces the profit.
[1] J. B. Andrews and C. D. Polychronopoulos, "An analytical approach to performance/cost modeling of parallel computers,"J. Parallel Distributed Comput., vol. 12, 1991.
[2] M. Annaraton, E. Arnould, T. Gross, H. Kung, M. Lam, O. Menzilcioglu, and J. Webb, "The Warp computer: Architecture, implementation, and performance,"IEEE Trans. Comput., vol. C36, pp. 15231538, Dec. 1987.
[3] G. H. Barnes, R. Brown, M. Kato, D. Kuck, D. Soltnic, and R. Stokes, "The Illiac IV computer,"IEEE Trans. Comput., vol. C17, 1968.
[4] S. A. Browning, "The tree machine: A highly concurrent computing environment," Ph.D. dissertation, California Instit. of Technol., 1980.
[5] H. Burkhart and R. Millen, "Performancemeasurement tools in a multiprocessor environment,"IEEE Trans. Comput., vol. 38, 1989.
[6] D. L. Eager, J. Zahorjan, and E. D. Lazowska, "Speedup versus efficiency in parallel systems,"IEEE Trans. Comput., vol. 38, 1989.
[7] T.Y. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., vol. 14, 1981.
[8] D. B. Gannon and J. V. Rosendale, "On the impact of communication complexity on the design of parallel numerical algorithms,"IEEE Trans. Comput., vol. C33, 1984.
[9] Intel Corp.,iPSC Systems Overview, Order No. 175278002, 1986.
[10] R. W. Hockney, "Characterizing computers and optimizing the FACR(l) Poissonsolver on parallel unicomputers,"IEEE Trans. Comput., vol. C31, 1983.
[11] C. P. Kruskal and M. Snir, "A unified theory of interconnection network structure,"Theoret. comput. Sci., vol. 48, pp. 7594, 1986.
[12] M. Kumar, "Measuring parallelism in computationintensive scientific/engineering applications,"IEEE Trans. Comput., vol. 37, 1988.
[13] F. T. Leighton, "New lower bound techniques for VLSI," inProc. 22nd Annu. IEEE Symp. Foundations Comput. Sci., 1981.
[14] D. M. Nicol and F. H. Willard, "Problem size, parallel architecture, and optimal speedup,"J. Parallel Distributed Comput., vol. 5, 1988.
[15] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[16] D. A. Reed and H. D. Schwetman, "Costperformance bounds for multimicrocomputer networks,"IEEE Trans. Comput., vol. C32, 1983.
[17] M. Satyanarayan, "Multiprocessing: An annotated bibliography,"IEEE Comput. Mag., vol. 13, 1980.
[18] I. D. Scherson and P. F. Corbett, "Communications overhead and the expected speedup of multidimensional meshconnected parallel processors,"J. Parallel Distributed Comput., vol. 11, 1991.
[19] U. Viskin, "Synchronous parallel computation  A survey," Tech. Rep. 71, Courant Institute, New York, NY, 1983.
[20] D. F. Vrsalovic, D. P. Siewiorek, Z. Z. Segall, and E. F. Gehringer, "Performance prediction and calibration for a class of multiprocessrs,"IEEE Trans. Comput., vol. 37, 1988.