Analyzing Scalability of Parallel Algorithms and Architectures

Journal of Parallel and Distributed Computing

Volumn 22, Issue 3, 1994, Pages 379-391

  Kumar, Vipin ^a   Gupta, Anshul ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3543092493     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1994.1099     Document Type: Article

References (60)

1. Aki, S. G. The Design and Analysis of Parallel Algorithms. Pren-tice-Hall, Englewood Cliffs, NJ, 1989.
2. Amdahl, G. M. Validity of the single processor approach to achieving large scale computing capabilities. AFIPS Conference Proceedings. 1967, pp. 483-485.
3. Barton, M. L., and Withers, G. R. Computing performance as a function of the speed, quantity, and the cost of processors. Proceedings Supercomputing '89, pp. 759-764.
4. Belkhale, K. P., and Baneijee, P. Approximate algorithms for the partitionable independent task scheduling problem. Proceedings of the 1990 International Conference on Parallel Processing, pp. 1-72 to 1-75.
5. Bertsekas, D. P., and Tsitsiklis, J. N. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ, 1989.
6. Carmona, E. A., and Rice, M. D. A model of parallel performance. Technical Report AFWL-TR-89-01. Air Force Weapons Laboratory, April 1989.
7. Carmona, E. A., and Rice, M. D. Modeling the serial and parallel fractions of a parallel algorithm. J. Parallel Distrih. Comput. 13, 3 (Nov. 1991), 286-298.
8. Chandran, S., and Davis, L. S. An approach to parallel vision algorithms. In Porth, R. (Ed.). Parallel Processing. SIAM. Philadelphia, 1987.
9. Eager, D. L., Zahorjan, J., and Lazowska, E. D. Speedup versus efficiency in parallel systems. IEEE Trans. Comput. 38, 3 (1989). 408-423.
10. Flatt, H. P. Further applications of the overhead model for parallel systems. Technical Report G320-3540. IBM Corporation, Palo Alto Scientific Center, July 1990.
11. Flatt, H. P. and Kennedy, K. Performance of parallel processors. Parallel Comput. 12 (1989), 1-20.
12. Fox, G. C., Johnson, M., Lyzenga, G., Otto, S. W., Salmon, J., and Walker, D. Solving Problems on Concurrent Processors, Vol. 1. Prentice-Hall, Englewood Cliffs, NJ. 1988.
13. Grama, A., Gupta, A., and Kumar, V. Isoefficiency: Measuring the scalability of parallel algorithms and architectures. IEEE Parallel Distrib. Technol. 1, 3 (Aug. 1993), 12-21. Also available as Technical Report TR 93-24, Department of Computer Science, University of Minnesota, Minneapolis, MN.
14. Grama, A., Kumar, V. and Nageshwara Rao, V. Experimental evaluation of load balancing techniques for the hypercube. Proceedings of the Parallel Computing 91 Conference, 1991, 497-514.
15. Gupta, A., and Kumar, V. The scalability of matrix multiplication algorithms on parallel computers. Technical Report TR 91-54. Department of Computer Science, University of Minnesota. Minneapolis, MN, 1991. A short version appears in Proceedings of 1993 International Conference on Parallel Processing, pp. 111-115-111-119.
16. Gupta, A., and Kumar, V. Performance properties of large scale parallel systems. J. ParallelDistribut. Comput. 19 (1993), 234-244. Also available as Technical Report TR 92-32, Department of Computer Science, University of Minnesota, Minneapolis, MN.
17. Gupta, A., and Kumar, V. A scalable parallel algorithm for sparse matrix factorization. Technical Report 94-19, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1994.
18. Gupta, A., and Kumar, V. The scalability of FFT on parallel computers. IEEE Trans. Parallel Distribut. Systems 4, 8 (Aug. 1993), 922-932. A detailed version available as Technical Report TR 90-53, Department of Computer Science, University of Minnesota, Minneapolis, MN.
19. Gupta, A., Kumar, V., and Sameh, A. H. Performance and scalability of preconditioned conjugate gradient methods on parallel computers. IEEE Trans. Parallel Distribut. Systems, to appear. Also available as Technical Report TR 92-64, Department of Computer Science, University of Minnesota, Minneapolis, MN. A short version appears in Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993, pp. 664-674.
20. Gustafson, J. L. Reevaluating Amdahl’s Law. Comm. ACM, 31, 5 (1988), 532-533.
21. Gustafson, J. L. The consequences of fixed time performance measurement. Proceedings of the 25th Haw aii International Conference on System Sciences. 1992. Vol. 111, pp. 113-124.
22. Hill, M. D. What is scalability? Comput. Architecture News 18, 4 (1990).
23. Hwang, K. Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, New York, 1993.
24. Jenq, J.-F., and Sahni, S. All pairs shortest paths on a hypercube multiprocessor. Proceedings of the 1987 International Conference on Parallel Processing, 1987, pp. 713-716.
25. Johnsson, S. L., and Ho, C.-T. Optimum broadcasting and personalized communication in hypercubes, IEEE Trans. Comput. 38, 9 (Sept. 1989), 1249-1268.
26. Karp, A. H., and Flatt, H. P. Measuring parallel processor performance. Comm. ACM 33, 5 (1990), 539-543.
27. Kruskal, C. P., Rudolph, L., and Snir, M. A complexity theory of efficient parallel algorithms. Technical Report RC13572, IBM TJ-Watson Research Center. Yorktown Heights, NY, 1988.
28. Kumar, V., Grama, A., Gupta, A., and Karypis, G. Introduction to Parallel Computing: Design and Analysis of Algorithms. Ben-jamin-Cummings, Redwood City, CA, 1993.
29. Kumar, V., Grama, A., and Rao, V. N. Scalable load balancing techniques for parallel computers. Technical report. Technical Report 91-55, Computer Science Department, University of Minnesota, 1991; J. Parallel Distrib. Comput. 1994, 60-79.
30. Kumar, V., and Rao, V. N. Parallel depth-first search. II. Analysis. Int. J. Parallel Programming 16, 6 (1987), 501-519.
31. Kumar, V., and Rao, V. N. Load balancing on the hypercube architecture. Proceedings of the Fourth Conference on Hypercubes, Concurrent Computers, and Applications. 1989, pp. 603-608.
32. Kumar, V., and Rao, V. N. Scalable parallel formulations of depth-first search. In Kumar, V., Gopalakrishnan, P. S., and Kanal, L. N. (Eds.). Parallel Algorithms for Machine Intelligence and Vision. Springer-Verlag, New York, 1990.
33. Kumar, V., and Singh, V. Scalability of parallel algorithms for the all-pairs shortest path problem. J. Parallel Distrib. Comput. 13, 2 (Oct. 1991), 124-138. A short version appears in the Proceedings of the International Conference on Parallel Processing, 1990.
34. Kung, H. T. Memory requirements for balanced computer architectures. Proceedings of the 1986 IEEE Symposium on Computer Architecture. pp. 49-54.
35. Lee, J., Shragowitz, E., and Sahni, S. A hypercube algorithm for the 0/1 knapsack problem. Proceedings of 1987 International Conference on Parallel Processing, pp. 699-706.
36. Leuze, M. R., Dowdy, L. W., and Park, K. H. Multiprogramming a distributed-memory multiprocessor. Concurrency: Practice and Experience 1, 1 (Sept. 1989), 19-33.
37. Ma, Y. W. E., and Shea, D. G. Downward scalability of parallel architectures. Proceedings of the 1988 International Conference on Supercomputing, pp. 109-120.
38. Marinescu, D. C., and Rice, J. R. On high level characterization of parallelism. Technical Report CSD-TR-1011, CAPO Report CER-90-32, Computer Science Department, Purdue University, West Lafayette, IN, revised June 1991. J. Parallel Distrib. Comput. 1993, to appear.
39. Messina, P. Emerging supercomputer architectures. Technical Report C3P 746, Concurrent Computation Program, California Institute of Technology, Pasadena, CA, 1987.
40. Moler, C. Another look at Amdahl’s law. Technical Report TN-02-0587-0288, Intel Scientific Computers, 1987.
41. Nicol, D. M., and Willard, F. H. Problem size, parallel architecture, and optimal speedup. J. Parallel Distrih. Comput. 5, 4 (Aug. 1988). 404-420.
42. Nussbaum, D., and Agarwal, A. Scalability of parallel machines. Comm. ACM 34, 3 (1991), 57-61.
43. Park, K. H., and Dowdy, L. W. Dynamic partitioning of multiprocessor systems. Int. J. Parallel Processing 18, (1989). 91-120.
44. Quinn, M. J., and Yoo, Y. B. Data structures for the efficient solution of graph theoretic problems on tightly-coupled M1MD computers. Proceedings of the 1984 International Conference on Parallel Processing, pp. 431-438.
45. Ranka, S., and Sahni, S. Hypercuhe Algorithms for Image Processing and Pattern Recognition. Springer-Verlag, New York, 1990.
46. Rao, V. N. and Kumar, V. Parallel depth-first search. 1. Implementation. Int. J. Parallel Programming 16, 6 (1987), 479-499.
47. Singh, V., Kumar, V., Agha, G., and Tomlinson, C. Scalability of parallel sorting on mesh multicomputers. Int. J. Parallel Programming 20, 2 (1991). A short version of this paper appears in the Proceedings of the Fifth International Parallel Processing Symposium, 1991.
48. Sun, X.-H., and Gustafson, J. L. Toward a better parallel performance metric. Parallel Comput. 17 (Dec. 1991). 1093-1109. Also avadable as Technical Report 1S-5053. UC-32, Ames Laboratory, Iowa State University.
49. Sun, X.-H., and Ni, L. M. Another view of parallel speedup. Proceedings Supercomputing '90. 1990, pp. 324-333.
50. Sun, X.-H., and Rover, D. T. Scalability of parallel algorithm-machine combinations. Technical Report 1S-5057, Ames Laboratory, Iowa State University, April 1991. IEEE Trans. Parallel Distrih. Systems, to appear.
51. Tang, Z., and Li, G.-J. Optimal granularity of grid iteration problems. Proceedings of the 1990 International Conference on Parallel Processing, pp. 1-111-1-118.
52. Van-Catledge, F. A. Toward a general model for evaluating the relative performance of computer systems. Int. J. Supercomputer Appl. 3, (1989). 100-108.
53. Vitter, J. S., and Simons, R. A. New classes for parallel complexity: A study of unification and other complete problems for P. IEEE Trans. Comput. (May 1986).
54. Woo, J., and Sahni, S. Hypercube computing: Connected components. J. Supercomputing (1991). Also available as TR 88-50 from the Department of Computer Science. University of Minnesota, Minneapolis, MN 55455.
55. Woo, J., and Sahni, S. Computing biconnected components on a hypercube. J. Supercomputing (June 1991). Also available as TR 89-7 from the Department of Computer Science, University of Minnesota, Minneapolis, MN.
56. Worley, P. H. Information requirements and the implications for parallel computation. Ph.D. Thesis, Stanford University, Department of Computer Science, Palo Alto, CA. June 1988.
57. Worley, P. H. The effect of time constraints on scaled speedup. SIAM J. Sci. Statist. Comput. 11, 5 (1990). 838-858.
58. Worley, P. H. Limits on parallelism in the numerical solution of linear pdes. SIAM J. Sci. Statist. Comput. (Jan. 1991).
59. Zhou, X. Bridging the gap between Amdahl's law and Sandia laboratory’s result. Comm. ACM 32, 8 (1989), 1014-1015.
60. Zorbas, J. R., Reble, D. J., and VanKooten, R. E. Measuring the scalability of parallel computer systems. Proceedings Supercomputing '89, 1989. pp. 832-841.