Compile-time estimation of communication costs for data parallel programs

Journal of Parallel and Distributed Computing

Volumn 39, Issue 1, 1996, Pages 46-65

  Fahringer, Thomas ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (26)

1. 1. A. Agarwal. Performance tradeoffs in multithreaded processors. IEEE Trans. Parallel Distrib. Syst. 3(5), 525-539, Sept. 1992.
2. 2. S. P. Amarasinghe, J. M. Anderson, and M. S. Lam. An Overview of a Compiler for Scalable Parallel Machines. In Proceedings of the 6th Workshop on Languages and Compilers for Parallel Computing, Portland, OR, Aug. 1993, pp. 253-272. Springer-Verlag, Berlin/New York.
3. 3. P. Banerjee, J. A. Chandy, M. Gupta, J. G. Holm, A. Lain, D. J. Palermo, S. Ramaswamy, and E. Su. The PARADIGM compiler for distributed-memory message passing multicomputers. In Proceedings of the First International Workshop on Parallel Processing, Bangalore, India, Dec. 1994, pp. 322-330.
4. 4. S. Benkner, S. Andel, R. Blasko, P. Brezany, A. Celic, B. Chapman, M. Egg, T. Fahringer, J. Hulman, Y. Hou, E. Kelc, E. Mehofer, H. Moritsch, M. Paul, K. Sanjari, V. Sipkova, B. Velkov, B. Wender, and H. Zima. Vienna Fortran Compilation System-Version 2.0-User's Guide, Oct. 1995.
5. 5. S. Bokhari. Communication overhead on the intel iPSC-860 Hypercube. ICASE Interim Report 10, NASA Contractor Report 182055, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA 23665, May 1990.
6. 6. S. Bokhari. Communication Overhead on the Intel Paragon, IBM SP2 and Meiko CS-2. ICASE Interim Report No. 28, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA 23665, Aug. 1995.
7. 7. M. Berry, D. Chen, P. Koss, D. Kuck, S. Lo, Y. Pang, R. Roloff, A. Sameh, E. Clementi, S. Chin, D. Schneider, G. Fox, P. Messina, D. Walker, C. Hsuing, J. Schwarzmeier, K. Lue, S. Orzag, F. Seidl, O. Johnson, G. Swenson, R. Goodrum, and J. Martin. The PERFECT club benchmarks: Effective performance evaluation of supercomputers. Int. J. Supercomputing Appl. 3(3), 5-40, 1989.
8. 8. T. Fahringer. The Weight Finder, An advanced profiler for Fortran programs. In Automatic Parallelization, New Approaches to Code Generation, Data Distribution, and Performance Prediction. Vieweg Advanced Studies in Computer Science, Verlag Vieweg, Wiesbaden, Germany, Mar. 1993.
9. 3T to guide the parallelization and optimization effort under the Vienna Fortran compilation system. In IEEE Proc. of the Scalable High Performance Computing Conference 1994, Knoxville, TN, May 1994.
10. 10. T. Fahringer. Estimating and Optimizing Performance for Parallel Programs. IEEE Comput. 28(11), 47-56, Nov. 1995.
11. 11. T. Fahringer. Automatic Performance Prediction of Parallel Programs. Kluwer Academic, Boston, MA, Mar. 1996.
12. 12. T. Fahringer. Toward Symbolic Performance Prediction of Parallel Programs. In IEEE Proc. of the 1996 International Parallel Processing Symposium, Honolulu, Hawaii, Apr. 1996, pp. 474-478.
13. 13. T. Fahringer and H. Zima. A static parameter based performance prediction tool for parallel programs. In Proc. of the 7th ACM International Conference on Supercomputing, Tokyo, Japan, July 1993. Invited Paper.
14. 14. G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors, Vols. 1 and 2, Prentice Hall, Englewood Cliffs, NJ, 1988.
15. 15. M. Gupta and P. Banerjee. Compile-time estimation of communication costs on multicomputers. In Proc. Sixth International Parallel Processing Symposium, Beverly Hills, CA, Mar. 1992.
16. 16. S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, and C. Tseng. An overview of the Fortran D programming system. In Proc. of the 4th Workshop on Languages and Compilers for Parallel Computing, Santa Clara, CA, Aug. 1991.
17. 17. High Performance FORTRAN Language Specification. Technical Report, Version 1.0, Rice University, Houston, TX, May 1993.
18. 18. U. Kremer. Automatic Data Layout for Distributed Memory Machines. Ph.D. thesis, Rice University, Technical Report CRPC-TR9559-S, Oct. 1995.
19. 19. F. McMahon. The Livermore Fortran Kernels Test of the Numerical Performance Range, pages 143-186. Elsevier Science B.V., North Holland, Amsterdam, 1988.
20. 20. G. Pfister and V. Norton. Hot spot contention combining in multistage interconnection networks. In Proc. of the 1985 International Conference on Parallel Processing, pp. 790-797, 1985.
21. 21. B. A. Rosenfeld. Multi-dimensional Spaces, Chap. 5, pp. 169-173. Nauka, Moscow, 1966. [In Russian]
22. 22. V. Sarkar. Partitioning and Scheduling Parallel Programs for Multiprocessor. MIT Press, Cambridge, MA, 1989.
23. 23. C. Tseng. An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. Ph.D. thesis, Rice University, Jan. 1993.
24. 24. W. Vetterling, S. Teukolsky, W. Press, and B. Flannery. Numerical Recipes: Example Book (FORTRAN). Cambridge, Univ. Press, 1990.
25. 25. K. Wang. A Framework for Static, Precise Performance Prediction for Superscalar-Based Parallel Computers. In H. Sips, Ed., Proceedings of the 4th International Workshop on Compilers for Parallel Computers, Delft, The Netherlands, Dec. 1993, pp. 413-427.
26. 26. H. Zima, P. Brezany, B. Chapman, P. Mehrotra, and A. Schwald. Vienna Fortran. A language specification. Technical report, ICASE, Hampton, VA, 1992. ICASE Internal Report 21.