Optimizing irregular shared-memory applications for clusters

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2008, Pages 256-265

  Min, Seung Jai ^a   Eigenmann, Rudolf ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Compiler analysis; Irregular data accesses; MPI; OpenMP; Performance; Runtime techniques

Indexed keywords

COMPILER ANALYSIS; IRREGULAR DATA ACCESSES; MPI; OPENMP; PERFORMANCE; RUNTIME TECHNIQUES;

APPLICATIONS; COMPUTERS; INTELLIGENT CONTROL; MESSAGE PASSING; OPTIMIZATION;

BENCHMARKING;

EID: 57349170100     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375527.1375566     Document Type: Conference Paper

References (29)

1. G. Agrawal and J. Saltz. Interprocedural compilation of irregular applications for distributed memory machines. In Supercomputing'95: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), page 48, New York, NY, USA, 1995. ACM Press.
2. C. Amza, A. 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, February 1996.
3. J. Balart, M. Gonzalez, X. Martorell, E. Ayguade, and J. Labarta. Runtime Address Space Computation for SDSM Systems. In The 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC 2006), pages 330-344, 2006.
4. A. Basumallik and R. Eigenmann. Towards Automatic Translation of OpenMP to MPI. In ICS'05: Proceedings of the 19th annual international conference on Supercomputing, pages 189-198, New York, NY, USA, 2005. ACM Press.
5. A. Basumallik and R. Eigenmann. Optimizing Irregular Shared-Memory Applications for Distributed-Memory Systems. In PPoPP'06: Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 119-128, New York, NY, USA, 2006. ACM Press.
6. T. Brecht and H. Sandhu. The Region Trap Library-Handling Traps on Application-Defined Regions of Memory. In ATEC'99: Proceedings of the. Annual Technical Conference on 1999 USENIX Annual Technical Conference, pages 7-7, Berkeley, CA, USA, 1999. USENIX Association.
7. B. R. Brooks, R. E. Bruccoleri, B. D. Olafson, D. J. States, S. Swaminathan, and M. Karplus. Charmm: A program for macromolecular energy, minimization, and dynamics calculations. Journal of Computational Chemistry, 4(2): 187-217, 198.3.
8. W.-Y. Chen, D. Bonachea, C. Iancu, and K. Yelick. Automatic Nonblocking Communication for Partitioned Global Address Space Programs. In ICS'07: Proceedings of the 21st annual international conference on Supercomputing, pages 158-167, New York, NY, USA, 2007. ACM.
9. R. Das, P. Havlak, J. Saltz, and K. Kennedy. Index Array Flattening through Program Transformation. In Supercomputing'95: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), page 70, New York, NY, USA, 1995. ACM Press.
10. T. El-Ghazawi, W. Carlson, and J. Draper. UPC Language Specifications, vl. 11, 2003.
11. M. P. I. Forum. MPI: A Message-Passing Interface Standard. Technical Report UT-CS-94-230, 1994.
12. P. N. Hilfinger, D. Bonachea, D. Gay, S. Graham, B. Liblit, G. Pike, and K. Yelick. Titanium Language Reference Manual. Technical report, Berkeley, CA, USA, 2001.
13. Y. Hwang, B. Moon, S. Sharma, R. Das, and J. Saltz. Runtime Support to Parallelize Adaptive Irregular Programs, 1994.
14. J. Ke, M. Burtscher, and E. Speight. Runtime Compression of MPI Messages to Improve the Performance and Scalability of Parallel Applications. In SC'04: Proceedings of the 2004 ACM/IEEE conference on Supercomputing, page 59, Washington, DC, USA, 2004. IEEE Computer Society.
15. C. Koelbel and P. Mehrotra. Compiling Global Name-Space Parallel Loops for Distributed Execution. IEEE Trans. Parallel Distrib. Syst., 2(4):440-451, 1991.
16. H. Lu, A. L. Cox, S. Dwarkadas, R. Rajamony, and W. Zwaenepoel. Compiler and Software Distributed Shared Memory Support for Irregular Applications. In PPOPP'97: Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 48-56, New York, NY, USA, 1997. ACM Press.
17. S.-J. Min. A. Basumallik, and R. Eigenmann. Optimizing OpenMP programs on Software Distributed Shared Memory Systems. Int. J. Parallel Program., 31(3):225-249, 2003.
18. S.-J. Min and R. Eigenmann. Combined Compile-Time and Runtime-Driven, Pro-active Data Movement in Software DSM Systems. In LCR'04: Proceedings of the 7th workshop on Workshop on languages, compilers, and run-time support for scalable systems, pages 1-6, New York, NY, USA, 2004. ACM Press.
19. R. Mirchandaney, J. H. Saltz, R, M. Smith, D. M. Nico, and K. Crowley. Principles of Runtime Support for Parallel Processors. In ICS'88: Proceedings of the 2nd international conference on Super computing, pages 140-152, New York, NY, USA, 1988. ACM Press.
20. B. Moon, M. Uysal, and J. Saltz. Index Translation Schemes for Adaptive Computations on Distributed Memory Multicomputer. Technical Report CS-TR-3428, 1995.
21. R. W. Numrich and J. Reid. Co-Array Fortran for Parallel Programming. SIGPLAN Fortran Forum, 17(2):1-31, 1998.
22. OpenMP Forum. OpenMP: A Proposed Industry Standard API for Shared Memory Programming. Technical report, October 1997.
23. B. Pottenger and R. Eigenmann. Idiom recognition in the polaris parallelizing compiler. In ICS'95: Proceedings of the 9th international conference on Supercomputing, pages 444-448, New York, NY, USA, 1995. ACM.
24. J. Saltz, R. Ponnusamy, S. D. Sharma, B. Moon, Y.-S. Hwang, M. Uysal, and R. Das. A Manual for the CHAOS Runtime Library. Technical Report CS-TR-3437, 1995.
25. S. D. Sharma, R. Ponnusamy, B. Moon, Y. S. Hwang, R. Das, and J. Saltz. Run-time and Compile-Time Support for Adaptive Irregular Problems. In Supercomputing'94: Proceedings of the 1994 ACM/IEEE conference on Supercomputing, pages 97-106, New York, NY, USA, 1994. ACM.
26. J. Su and K. Yelick. Automatic Support for Irregular Computations in a High-Level Language. In IPDPS'05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers, page 53.2, Washington, DC, USA, 2005. IEEE Computer Society.
27. M. Ujaldon, S. D. Sharma, J. H. Saltz, and E. L. Zapata. Run-Time Techniques for Parallelizing Sparse Matrix Problems. In Workshop on Parallel Algorithms for Irregularly Structured Problems, pages 43-57, 1995.
28. R. von Hanxleden and K. Kennedy. GIVE-N-TAKE - a balanced code placement framework. SIGPLAN Not., 29(6):107-120, 1994.
29. M. J. Zekauskas, W. A. Sawdon, and B. N. Bershad. Software Write Detection for a Distributed Shared Memory. In OSDI'94: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation, page 8, Berkeley, CA, USA, 1994. USENIX Association.