Award Abstract # 0541409
ST-CRTS: Search-Based Model-Driven Framework for Compiler Optimizations

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: LOUISIANA STATE UNIVERSITY
Initial Amendment Date: May 15, 2006
Latest Amendment Date: May 15, 2006
Award Number: 0541409
Award Instrument: Standard Grant
Program Manager: Almadena Chtchelkanova
achtchel@nsf.gov
 (703)292-7498
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: May 15, 2006
End Date: April 30, 2011 (Estimated)
Total Intended Award Amount: $300,000.00
Total Awarded Amount to Date: $300,000.00
Funds Obligated to Date: FY 2006 = $300,000.00
History of Investigator:
  • Gerald Baumgartner (Principal Investigator)
    gb@csc.lsu.edu
  • Jagannathan Ramanujam (Co-Principal Investigator)
Recipient Sponsored Research Office: Louisiana State University
202 HIMES HALL
BATON ROUGE
LA  US  70803-0001
(225)578-2760
Sponsor Congressional District: 06
Primary Place of Performance: Louisiana State University
202 HIMES HALL
BATON ROUGE
LA  US  70803-0001
Primary Place of Performance
Congressional District:
06
Unique Entity Identifier (UEI): ECQEYCHRNKJ4
Parent UEI:
NSF Program(s): COMPILERS,
EPSCoR Co-Funding
Primary Program Source: app-0106 
app-0406 
Program Reference Code(s): 7329, 9150, 9216, HPCC
Program Element Code(s): 732900, 915000
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Background

The difficulty of developing high-performance software using the available languages and tools is being recognized as one of the most significant challenges today in the effective use of high-performance computers. As computers have increased in achievable performance, making it feasible to accurately model more complex phenomena, the time and effort required to develop the software has become the bottleneck in many areas of science and engineering.
This proposal seeks to develop a performance-model driven a compiler optimization framework that integrates the algebraic model for loop representation/transformation with a search-based approach for loop fusion, loop tiling and data/work partitioning. The result of the project will make scientific applications, such as quantum chemistry calculations, and other parallel modeling and simulations, easier programmable, and will cut project implementation and development time.



Intellectual Merit

The goal of this proposal is to develop a framework for compiler optimization that performs loop transformations using performance models such as cache miss cost, disk I/O cost, and inter-processor communication cost, that can be expected to correlate directly with measured performance. Since it will generally be infeasible to analytically determine optimal parameters, or even create cost models that are expressible as algebraic functions of pertinent parameters, our approach is to use search strategies in a potentially large parameter space. This novel optimization framework has potential for high payoffs in generating high-performance code.

Broader Impact

Compiler technology can be very effective in reducing the time for developing applications in
several areas of science and engineering without sacrificing performance. There is an increasing need for automated support that can relieve the burden from users, of low-level details needed to optimize performance. The framework we propose to build will be applicable to a number of high-level language models such as Matlab, Global Arrays, UPC, Co-Array Fortran, ZPL etc. The development will be done in the Open64 framework and the resulting software will be made available to others. It is anticipated that the developed framework will be valuable to researchers in academia and research laboratories. Finally, this proposal includes the development of new courses and the training of two graduate students.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 18)
A. Allam, J. Ramanujam, G. Baumgartner, and P. Sadayappan "Memory Minimization for Tensor Contractions using Integer Linear Programming" In Proc. Workshop on Performance Optimization for High-Level Languages and Libraries (POHLL-06), held in conjunction with the 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2006) , 2006
A. Hartono, Q. Lu, X. Gao, S. Krishnamoorthy, M. Nooijen, G. Baumgartner, D. Bernholdt, R. Pitzer, J. Ramanujam, A. Rountev, and P. Sadayappan "Identifying Cost-Effective Common Subexpressions to Reduce Operation Count in Tensor Contraction Evaluations" In Proc. International Conference on Computational Science 2006 (ICCS 2006), Part I, Reading, UK, Lecture Notes in Computer Science, Vol. 3991, Springer-Verlag , 2006 , p.267
Baskaran, MM; Vydyanathan, N; Bondhugula, UK; Ramanujam, J; Rountev, A; Sadayappan, P "Compiler-Assisted Dynamic Scheduling for Effective Parallelization of Loop Nests on Multicore Processors" ACM SIGPLAN NOTICES , v.44 , 2009 , p.219 View record at Web of Science
Bondhugula, U; Hartono, A; Ramanujam, J; Sadayappan, P "A practical automatic polyhedral parallelizer and locality optimizer" ACM SIGPLAN NOTICES , v.43 , 2008 , p.101 View record at Web of Science
Gao, X; Krishnamoorthy, S; Sahoo, SK; Lam, CC; Baumgartner, G; Ramanujam, J; Sadayappan, P "Efficient search-space pruning for integrated fusion and tiling transformations" CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE , v.19 , 2007 , p.2425 View record at Web of Science 10.1002/cpe.118
Hartono, A; Lu, QD; Henretty, T; Krishnamoorthy, S; Zhang, HJ; Baumgartner, G; Bernholdt, DE; Nooijen, M; Pitzer, R; Ramanujam, J; Sadayappan, P "Performance Optimization of Tensor Contraction Expressions for Many-Body Methods in Quantum Chemistry" JOURNAL OF PHYSICAL CHEMISTRY A , v.113 , 2009 , p.12715 View record at Web of Science 10.1021/jp905121
H. Salamy and J. Ramanujam "Optimal Address Register Allocation for Arrays in DSP Applications" Proc. 6th IEEE Workshop on Embedded Systems for Real-Time Multimedia (ESTIMedia 2008) , 2008 , p.67
H. Salamy and J. Ramanujam "Storage Optimization through Code Size Reduction for Digital Signal Processors" Proc. 6th IEEE Workshop on Embedded Systems for Real-Time Multimedia (ESTIMedia 2008) , 2008 , p.107
Jinpyo Hong and J. Ramanujam "Memory Offset Assignment for DSPs" Proc. 2007 International Conference on Embedded Systems and Software (ICESS-07) , 2007
Lam, CC; Rauber, T; Baumgartner, G; Cociorva, D; Sadayappan, P "Memory-optimal evaluation of expression trees involving large objects" COMPUTER LANGUAGES SYSTEMS & STRUCTURES , v.37 , 2011 , p.63 View record at Web of Science 10.1016/j.cl.2010.09.00
M. Baskaran, N. Vydhyanathan, U. Bondhugula, J. Ramanujam, A. Rountev, and P. Sadayappan "Compiler-Assisted Dynamic Scheduling for Effective Parallelization of Loop Nests on Multicore Processors" Proc. 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2009) , 2009 , p.219
(Showing: 1 - 10 of 18)

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page