2003Unpublished venueRequires access

Compile time data transfer analysis

W. Zhang, Ernst L. Leiss

Open publisher page 1 citations

Abstract

The design and implementation of compilers for high performance compiler systems require a thorough understanding of the target architecture to deliver the highest level of performance. It is important to know the I/O behavior on memory hierarchies. The compile time data transfer analysis computes an accurate approximation on the number of data transfers between main and secondary memory when the least recently used replacement policy is applied. This analysis is performed at compile time; since some details are unknown, simplifying assumptions have to be accepted from the outset. The analyzer estimates in reasonable precision the number of page transfers that a program needs for execution, based on the parameters of the system available at compile time. The results reflect the real behavior of the system when executing the program and can therefore be used to compare situations derived for the same program after code restructuring.

About this research paper

What this paper is about

The design and implementation of compilers for high performance compiler systems require a thorough understanding of the target architecture to deliver the highest level of performance. It is important to know the I/O behavior on memory hierarchies. The compile time data transfer analysis computes an accurate approximation on the number of data transfers between main and secondary memory when the least recently used replacement policy is applied. This analysis is performed at compile time; since some details are unknown, simplifying assumptions have to be accepted from the outset. The analyzer estimates in reasonable precision the number of page transfers that a program needs for execution, based on the parameters of the system available at compile time. The results reflect the real behavior of the system when executing the program and can therefore be used to compare situations derived for the same program after code restructuring.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The design and implementation of compilers for high performance compiler systems require a thorough understanding of the target architecture to deliver the highest level of performance. It is important to know the I/O behavior on memory hierarchies. The compile time data transfer analysis computes an accurate approximation on the number of data transfers between main and secondary memory when the least recently used replacement policy is applied. This analysis is performed at compile time; since some details are unknown, simplifying assumptions have to be accepted from the outset. The analyzer estimates in reasonable precision the number of page transfers that a program needs for execution, based on the parameters of the system available at compile time. The results reflect the real behavior of the system when executing the program and can therefore be used to compare situations derived for the same program after code restructuring.

Key concepts: Compiler, Computer science, Compile time, Transfer (computing), Execution time, Programming language, Parallel computing, Optimizing compiler

Related papers

Back to paper searchBrowse research topicsOriginal source
Compile time data transfer analysis — Research Paper | ScholarLens