Hypergraph partitioning for automatic memory hierarchy management

Proceedings of the 2006 ACM/IEEE Conference on Supercomputing, SC'06

Volumn , Issue , 2006, Pages

  Krishnamoorthy, Sriram ^a   Catalyurek, Umit ^b   Nieplocha, Jarek ^c   Rountev, Atanas ^a   Sadayappan, P ^a  

^a Dept of Computer Science and Engineering ^*

^b OHIO STATE UNIVERSITY   (United States)

^c PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC MEMORY HIERARCHY MANAGEMENT; HYPERGRAPH PARTITIONING; OPTIMIZATION PROBLEMS; SECONDARY STORAGE;

COMPUTATION THEORY; DATA PROCESSING; GRAPH THEORY; INFORMATION MANAGEMENT; OPTIMIZATION; PARALLEL PROGRAMMING;

DATA STORAGE EQUIPMENT;

EID: 34548291021     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1188455.1188558     Document Type: Conference Paper

References (24)

1. AHMED, N., MATEEV, N., AND PINGALI, K. 2000. Synthesizing transformations for locality enhancement of imperfectly nested loops. In Proc. ACM Intl. Conf. on Supercomputing, 141-152.
2. BAUMGARTNER, G., BERNHOLDT, D., COCIORVA, D., HARRISON, R., HIRATA, S., LAM, C., NOOIJEN, M., PLTZER, R., RAMANUIAM, J., AND SADAYAPPAN, P. 2002. A High-Level Approach to Synthesis of High-Performance Codes for Quantum Chemistry. In Proc. of Supercomputing 2002.
3. CATALYÜREK, U. V., AND AYKANAT, C. 1996. Decomposing irregularly sparse matrices for parallel matrix-vector multiplications. In Proceedings of 3rd International Symposium on Solving Irregularly Structured Problems in Parallel, Irregular'96, Springer-Verlag, vol. 1117 of Lecture Notes in Computer Science, 75-86.
4. CATALYÜREK, U. V., AND AYKANAT, C. 1999. Hypergraph-partitioning based decomposition for parallel spars e-matrix vector multiplication. IEEE TPDS 10, 7, 673-693.
5. CHANG, C., KURC, T., SUSSMAN, A., ÇATALYÜREK, U. V., AND SALTZ, J. 2001. A hypergraph-based workload partitioning strategy for parallel data aggregation. In Proceedings of the Eleventh SIAM Conference on Parallel Processing for Scientific Computing, SIAM.
6. CRAWFORD, T., AND III, H. S. 2000. An Introduction to Coupled Cluster Theory for Computational Chemists. In Reviews in Computational Chemistry, K. Lipkowitz and D. Boyd, Ed., vol. 14. John Wiley & Sons, Ltd., 33-136.
7. DUFF, I. S., MARRONE, M., RADICATI, G., AND VITTOLI, C. 1997. Level 3 basic linear algebra subprograms for sparse matrices: a user-level interface. ACM Trans. Math. Softw. 23, 3, 379-401.
8. HENDRICKSON, B., AND LELAND, R. 1994. The Chaco user's guide: Version 2.0. Tech. Rep. SAND94-2692, Sandia National Laboratories.
9. HIGH PERFORMANCE COMPUTATIONAL CHEMISTRY GROUP. 2004. NWChem, A Computational Chemistry Package for Parallel Computers, Version 4.6. Pacific Northwest National Laboratory.
10. KALÉ, L., AND KRISHNAN, S. 1993. CHARM++: A Portable Concurrent Object Oriented System Based on C++. In Proceedings of OOPSLA'93, ACM Press, A.Paepcke, Ed., 91-108.
11. KARYPIS, G., AGGRAWAL, R., KUMAR, V., AND SHEKHAR, S. 1997. Multilevel hypergraph partitioning: Applications in VLSI domain. In Proc. of 34th Design Automation Conference.
12. KHANNA, G., VYDYANATHAN, N., KURC, T., CATALYUREK, U., WYCKOFF, P., SALTZ, J., AND SADAYAPPAN, P. 2005. A Hypergraph Partitioning Based Approach for Scheduling of Tasks with Batchshared I/O. In Proceedings of the 5th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2005). To Appear.
13. KODUKULA, I., AHMED, N., AND PINGALI, K. 1997. Data-centric multi-level blocking. In Proc. SIGPLAN Conf. Programming Language Design and Implementation, 346-357.
14. KRISHNAMOORTHY, S., CATALYUREK, U., NIEPLOCHA, J., ROUNTEV, A., AND SADAYAPPAN, P. 2006. An extensible global address space framework with decoupled task and data abstractions. In Proc. IPDPS Workshop on Next Generation Software.
15. KRISHNAN, S., KRISHNAMOORTHY, S., BAUMGARTNER, G., COCIORVA, D., LAM, C., SADAYAPPAN, P., RAMANUJAM, J., BERNHOLDT, D., AND CHOPPELLA, V. 2003. Data Locality Optimization for Synthesis of Efficient Out-of-Core Algorithms. In Proc. 10th Annual International Conference on High Performance Computing (HiPC), Springer Verlag, 406-417.
16. KRISHNAN, S., KRISHNAMOORTHY, S., BAUMGARTNER, G., LAM, C.-C., RAMANUJAM, J., SADAYAPPAN, P., AND CHOPPELLA, V. 2004. Efficient synthesis of out-of-core algorithms for tensor contractions using a nonlinear optimization solver. In The 18th International Parallel and Distributed Processing Symposium.
17. LIM, A. W., AND LAM, M. S. 1998. Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing 24, 3-4 (May), 445-475.
18. LIM, A., LIAO, S., AND LAM, M. 2001. Blocking and array contraction across arbitrarily nested loops using affine partitioning. In Proc. 8th ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, ACM Press, 103-112.
19. NAVARRO, J., JUAN, A., AND LANG, T. 1994. MOB Forms: A Class of Multilevel Block Algorithms for Dense Linear Algebra Operations. In Proc. ACM International Conference on Supercomputing.
20. RANDALL, K. H. 1998. Cilk: Efficient Multithreaded Computing. PhD thesis, MIT Department of Electrical Engineering and Computer Science.
21. SAHOO, S. K., KRISHNAMOORTHY, S., PANUGANTI, R., AND SADAYAPPAN, P. 2005. Integrated loop optimizations for data locality enhancement of tensor contraction expressions. In Proc. Supercomputing (SC 2005).
22. SALTZ, J., PONNUSAMY, R., SHARMA, S., MOON, B., AND DAS, R. 1995. A manual for the CHAOS runtime library. Tech. Rep. CS-TR-3437 and UMIACS-TR-95-34, University of Maryland, Department of Computer Science and UMIACS, March.
23. SINHA, A., AND KALÉ, L. 1993. A load balancing strategy for prioritized execution of tasks. In Seventh International Parallel Processing Symposium, 230-237.
24. TUMINARO, R. S., HEROUX, M., HUTCHINSON, S. A., AND SHADID, J. N. 1999. Official Aztec user's guide; Version 2.1. Tech. rep., Sandia National Laboratories.