Towards automatic translation of OpenMP to MPI

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2005, Pages 189-198

  Basumallik, Ayon ^a   Eigenmann, Rudolf ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Commodity Clusters; Compiler Techniques; MPI; OpenMP; Performance

Indexed keywords

COMMODITY CLUSTERS; COMPILER TECHNIQUES; MPI; OPENMP;

COMPUTER PROGRAM LISTINGS; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; PERFORMANCE;

PROGRAM COMPILERS;

EID: 32844474242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1088149.1088174     Document Type: Conference Paper

References (38)

1. T. Abdelrahman and T. Wong. Compiler support for data distribution on NUMA multiprocessors. Journal of Supercomputing, 12(4):349-371, October 1998.
2. C. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel. Treadmarks: Shared Memory Computing on Networks of Workstations. IEEE Computer, 29(2):18-28, 1996.
3. V. Aslot, M. Domeika, R. Eigenmann, G. Gaertner, W. B. Jones, and B. Parady. SPEComp: A New Benchmark Suite for Measuring Parallel Computer Performance. In Proc. of the Workshop on OpenMP Applications and Tools (WOMPAT200I), Lecture Notes in Computer Science, 2104, pages 1-10, July 2001.
4. D. H. Bailey, E. Barszcz, J. T. Barton, D. S. Browning, R. L. Carter, D. Dagum, R. A. Fatoohi, P. O. Frederickson, T. A. Lasinski, R. S. Schreiber, H. D. Simon, V. Venkatakrishnan, and S. K. Weeratunga. The NAS Parallel Benchmarks. The International Journal of Supercomputer Applications, 5(3):63-73, Fall 1991.
5. 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 The First International Workshop on Parallel Processing, pages 322-330, Bangalore, India, Dec. 1994.
6. J. Bircsak, P. Craig, R. Crowell, Z. Cvetanovic, J. Harris, C. Nelson, and C. Offner. Extending OpenMP for NUMA Machines. In Proc. of the IEEE/ACM Supercomputing'2000: High Performance Networking and Computing Conference (SC2000), November 2000.
7. W. Blume and R. Eigenmann. The range test: a dependence test for symbolic, non-linear expressions. In Proceedings of the 1994 ACM/IEEE conference on Supercomputing, pages 528-537. ACM Press, 1994.
8. Z. Bozkus, L. Meadows, S. Nakamoto, V. Schuster, and M. Young. Pghpf-an optimizing high performance fortran compiler for distributed memory machines. Sci. Program., 6(1):29-40, 1997.
9. D. Callahan and K. Kennedy. Analysis of interprocedural side effects in a parallel programming environment. J. Parallel Distrib. Comput., 5(5):517-550, 1988.
10. B. Chapman, P. Mehrotra, and H. Zima. Enhancing OpenMP with features for Locality Control. Technical Report TR99-02, Inst. for Software Technology and Parallel Systems, U. Vienna, www.par.univie.ac.at., 1999.
11. D. E. Culler, A. C. Arpaci-Dusseau, S. C. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, and K. A. Yelick. Parallel Programming in Split-C. In Supercomputing, pages 262-273, 1993.
12. F. Darema, D. A. George, V. A. Norton, and G. F. Pfister. A single-program-multiple-data computational model for epex/fortran. Parallel Computing, 7(1):11-24, 1988.
13. R. Das, M. Uysal, J. Saltz, and Y.-S. S. Hwang. Communication optimizations for irregular scientific computations on distributed memory architectures. Journal of Parallel and Distributed Computing, 22(3):462-478, 1994.
14. T. El-Ghazawi and F. Cantonnet. "upc performance and potential: a npb experimental study". In Proceedings of the 2002 ACM/IEEE conference on Supercomputing, pages 1-26. IEEE Computer Society Press, 2002.
15. T. El-Ghazawi, W. Carlson, and J. Draper. UPC Language Specifications V1.0, Feb. 2001.
16. M. P. I. Forum. MPI: A Message-Passing Interface Standard. Technical Report UT-CS-94-230, 1994.
17. M. Frumkin, H. Jin, and J. Yan. Implementation of NAS Parallel Benchmarks in High Performance Fortran. Technical Report NAS-98-009.
18. M. Gupta, E. Schonberg, and H. Srinivasan. A unified framework for optimizing communication in data-parallel programs:. IEEE Transactions on Parallel and Distributed Systems, 7(7):689-704, 1996.
19. P. Havlak and K. Kennedy. An implementation of interprocedural bounded regular section analysis. IEEE Transactions on Parallel and Distributed Systems, 2(3):350-360, 1991.
20. High Performance Fortran Forum. High Performance Fortran language specification, version 1.0. Technical Report CRPC-TR92225, Houston, Tex., 1993.
21. Y. Hu, H. Lu, A. Cox, and W. Zwaenepoel. OpenMP for Networks of SMPs. Journal of Parallel and Distributed Computing, 60(12):1512-1530, December 2000.
22. H. Jin, M. Frumkin, and J. Yan. The OpenMP Implementation of NAS Parallel Benchmarks and Its Performance. Technical Report NAS-99-011.
23. K. Kennedy and N. Nedeljković. Combining dependence and data-flow analyses to optimize communication. In Proceedings of the 9th International Parallel Processing Symposium, Santa Barbara, CA, 1995.
24. C. Koelbel, D. Loveman, R. Schreiber, G. S. Jr., and M. Zosel. The High Performance Fortran Handbook. MIT Press, 1994.
25. U. Kremer. Automatic data layout for distributed memory machines. Technical Report TR96-261, 14, 1996.
26. S.-I. Lee, T. A. Johnson, and R. Eigenmann. Cetus - An Extensible Compiler Infrastructure for Source-to-Source Transformation. In Proc. of the Workshop on Languages and Compilers for Parallel Computing(LCPC'03), pages 539-553. (Springer-Verlag Lecture Notes in Computer Science), Oct. 2003.
27. J. Li and M. Chen. Generating explicit communication from shared-memory program references. In Proceedings of the 1990 ACM/IEEE conference on Supercomputing, pages 865-876. IEEE Computer Society, 1990.
28. J. Li and M. Chen. Compiling communication-efficient programs for massively parallel machines. IEEE Trans. Parallel Distrib. Syst., 2(3):361-376, 1991.
29. Y. Lin and D. Padua. Compiler analysis of irregular memory accesses. In Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, pages 157-168. ACM Press, 2000.
30. H. Lu, S. Dwarkadas, A. L. Cox, and W. Zwaenepoel. Quantifying the performance differences between PVM and TreadMarks. Journal of Parallel and Distributed Computing, 43(2):65-78, 1997.
31. S.-J. Min, A. Basumallik, and R. Eigenmann. Optimizing OpenMP programs on Software Distributed Shared Memory Systems. International Journal of Parallel Programming, 31(3):225-249, June 2003.
32. S.-J. Min, A. Basumallik, and R. Eigenmann. Supporting realistic OpenMP applications on a commodity cluster of workstations. In OpenMP Shared Memory Parallel Programming: International Workshop on OpenMP Applications and Tools, WOM-PAT 2003, Toronto, Canada, June 26-27, 2003. Proceedings Editors: M.J. Voss (Ed.), pages 170 - 179, 2003.
33. OpenMP Forum. OpenMP: A Proposed Industry Standard API for Shared Memory Programming. Technical report, October 1997.
34. Y. Paek, J. Hoeflinger, and D. Padua. Efficient and precise array access analysis. ACM Trans. Program. Lang. Syst., 24(1):65-109, 2002.
35. W. M. Pottenger and R. Eigenmann. Idiom recognition in the Polaris Parallelizing Compiler. In International Conference on Supercomputing, pages 444-448, 1995.
36. V. Schuster and D. Miles. Distributed OpenMP, Extensions to OpenMP for SMP Clusters. In Proc. of the Workshop on OpenMP Applications and Tools (WOMPAT2000), July 2000.
37. R. von Hanxleden, K. Kennedy, C. H. Koelbel, R. Das, and J. H. Saltz. Compiler analysis for irregular problems in Fortran D. In 1992 Workshop on Languages and Compilers for Parallel Computing, number 757, pages 97-111, New Haven, Conn., 1992. Berlin: Springer Verlag.
38. J. Zhu and J. Hoeflinger. Compiling for a Hybrid Programming Model Using the LMAD Representation. In Proc. of the 14th annual workshop on Languages and Compilers for Parallel Computing (LCPC200I), August 2001.