skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Exploring the Effect of Compiler Optimizations on the Reliability of HPC Applications

Authors:
ORCiD logo [1]
  1. ORNL
Publication Date:
Research Org.:
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1376448
DOE Contract Number:
AC05-00OR22725
Resource Type:
Conference
Resource Relation:
Conference: 22nd IEEE Workshop on Dependable Parallel, Distributed and Network-Centric Systems - Orlando, Florida, United States of America - 5/29/2017 12:00:00 AM-6/2/2017 12:00:00 AM
Country of Publication:
United States
Language:
English

Citation Formats

ASHRAF, RIZWAN A. Exploring the Effect of Compiler Optimizations on the Reliability of HPC Applications. United States: N. p., 2017. Web. doi:10.1109/IPDPSW.2017.7.
ASHRAF, RIZWAN A. Exploring the Effect of Compiler Optimizations on the Reliability of HPC Applications. United States. doi:10.1109/IPDPSW.2017.7.
ASHRAF, RIZWAN A. Mon . "Exploring the Effect of Compiler Optimizations on the Reliability of HPC Applications". United States. doi:10.1109/IPDPSW.2017.7. https://www.osti.gov/servlets/purl/1376448.
@article{osti_1376448,
title = {Exploring the Effect of Compiler Optimizations on the Reliability of HPC Applications},
author = {ASHRAF, RIZWAN A.},
abstractNote = {},
doi = {10.1109/IPDPSW.2017.7},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Mon May 01 00:00:00 EDT 2017},
month = {Mon May 01 00:00:00 EDT 2017}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • Regular data dependence checking on sparse codes usually results in very conservative estimates of actual dependences that will occur at run-time. Clearly, this is caused by the usage of compact data structures that are necessary to exploit sparsity in order to reduce storage requirements and computational time. However, if the compiler is presented with dense code and automatically converts it into code that operates on sparse data structures, then the dependence information obtained by analysis on the original code can be used to exploit potential concurrency in the generated code. In this paper the authors present synchronization generating and manipulatingmore » techniques that are based on this concept.« less
  • Abstract not provided.
  • No abstract prepared.
  • No abstract prepared.
  • We have built a benchmark suite including a number of scientific applications, named test suite, for study of compilation and optimization techniques. Currently, we have Gaussian elimination, FFT, N-body simulation, and other codes in the test suite. We present in this paper the techniques of optimizing program partitioning. Gaussian elimination is used as an example to show how to select the best partitioning pattern with performance evaluation.