Award Abstract # 0811457
Collaborative Research: CPA-CPL-T: An Effective Automatic Parallelization Framework for Multi-Core Architectures

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: LOUISIANA STATE UNIVERSITY
Initial Amendment Date: July 22, 2008
Latest Amendment Date: July 16, 2014
Award Number: 0811457
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: August 1, 2008
End Date: September 30, 2014 (Estimated)
Total Intended Award Amount: $250,000.00
Total Awarded Amount to Date: $250,000.00
Funds Obligated to Date: FY 2008 = $250,000.00
History of Investigator:
  • Jagannathan Ramanujam (Principal Investigator)
    jxr@ece.lsu.edu
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: 01000809DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 9150, 9218, HPCC
Program Element Code(s): 732900, 915000
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Data protection and recovery have become increasing important as business, education, and government depend more and more on digital information.
Failure events do occur such as virus attacks, user errors, defective software/firmware, hardware faults, and site failures etc that cause data damage. To ensure business continuity and minimize loss, data storage systems need data protection and recovery techniques. However, existing technologies have severe limitations and unable to recover data in many situations. This project aims at studying and understanding how data recovery is done in existing data storage systems, and designing new architectures that will overcome the limitations of existing technologies.

In order to study and understand the existing storage architectures, a new mathematical formulation will be developed to model and analyze capabilities and limitations of the storage architectures. This mathematical model provides a rigorous tool for researchers and practitioners to investigate and understand storage system architectures.
Based on the new mathematical model, a class of new data storage system architectures will be designed that will have the maximum data recoverability. The new storage architectures make it possible for organizations of different sizes to have a cost-effective data storage that provides high data availability and allows quick data recovery upon failures. In addition to the theoretical study, experimental prototypes will be developed and implemented to demonstrate the feasibility, performance, reliability, and data recoverability of newly designed storage architectures. Furthermore, the project includes an education component that advocates a shift of emphasis from CPU-centric computer engineering (CE) curriculum to data-centric CE curriculum. The new curriculum provides CE students with in depth knowledge of data processing, data communication, and data storage.

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)
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
Baskaran, Muthu Manikandan; Hartono, Albert; Tavarageri, Sanket; Henretty, Tom; Ramanujam, J.; Sadayappan, P.; ACM "Parameterized Tiling Revisited" CGO 2010: THE EIGHTH INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, PROCEEDINGS , v.8 , 2010 , p.200-209
Baskaran, Muthu Manikandan; Ramanujam, J.; Sadayappan, P.; Gupta, R "Automatic C-to-CUDA Code Generation for Affine Programs" COMPILER CONSTRUCTION, PROCEEDINGS , v.6011 , 2010 , p.244-263
Baskaran, Muthu Manikandan; Vydyanathan, Nagavijayalakshmi; Bondhugula, Uday Kumar; Ramanujam, J.; Rountev, Atanas; Sadayappan, P. "Compiler-Assisted Dynamic Scheduling for Effective Parallelization of Loop Nests on Multicore Processors" ACM SIGPLAN NOTICES , v.44 , 2009 , p.219-228
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
Fauzia, Naznin and Elango, Venmugil and Ravishankar, Mahesh and Ramanujam, J. and Rastello, Fabrice and Rountev, Atanas and Pouchet, Louis-No\"{e}l and Sadayappan, P. "Beyond Reuse Distance Analysis: Dynamic Analysis for Characterization of Data Locality Potential" ACM Trans. Archit. Code Optim. , v.10 , 2013 , p.53:1--53: 10.1145/2555289.2555309
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 "An Effective Solution to Task Scheduling and Memory Partitioning for Multi-Processor System-on-Chip" IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , v.32 , 2012 , p.717-725
H. Salamy and J. Ramanujam "An ILP Solution to Address Code Generation for Embedded Applications on Digital Signal Processors" ACM Transactions on Design Automation of Electronic Systems , v.17 , 2012 , p.xxx
H. Salamy and J. Ramanujam "Code Size Reduction for Array Intensive Applications on Digital Signal Processors" Journal of Circuits, Systems, and Computers , v.21 , 2012 , p.1-22
Lu, Qingda and Gao, Xiaoyang and Krishnamoorthy, Sriram and Baumgartner, Gerald and Ramanujam, J. and Sadayappan, P. "Empirical Performance Model-driven Data Layout Optimization and Library Call Selection for Tensor Contraction Expressions" J. Parallel Distrib. Comput. , v.72 , 2012 , p.338--352 10.1016/j.jpdc.2011.09.006
(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