Publication Date

5-2020

Date of Final Oral Examination (Defense)

12-6-2019

Type of Culminating Activity

Dissertation

Degree Title

Doctor of Philosophy in Computing

Department

Computer Science

Supervisory Committee Chair

Catherine R.M. Olschanowsky, Ph.D.

Supervisory Committee Member

Elena Sherman, Ph.D.

Supervisory Committee Member

Steven Cutchin, Ph.D.

Supervisory Committee Member

Donna Calhoun, Ph.D.

Abstract

This research presents an intermediate compiler representation that is designed for optimization, and emphasizes the temporary storage requirements and execution schedule of a given computation to guide optimization decisions. The representation is expressed as a dataflow graph that describes computational statements and data mappings within the polyhedral compilation model. The targeted applications include both the regular and irregular scientific domains.

The intermediate representation can be integrated into existing compiler infrastructures. A specification language implemented as a domain specific language in C++ describes the graph components and the transformations that can be applied. The visual representation allows users to reason about optimizations. Graph variants can be translated into source code or other representation. The language, intermediate representation, and associated transformations have been applied to improve the performance of differential equation solvers, or sparse matrix operations, tensor decomposition, and structured multigrid methods.

DOI

10.18122/td/1654/boisestate

Download

Share

COinS