Search
Now showing items 1-10 of 18
Static Type Inference for Specialization in a Telescoping Compiler
(2004-09-01)
The telescoping languages approach achieves high performance from applications encoded as high-level scripts. The core idea is to pre-compile underlying libraries to generate multiple variants optimized for use indifferent ...
Object-Oriented Type Inference for Telescoping Languages
(2004)
The telescoping-languages approach achieves high performance from applications encoded as high-level scripts. The core idea is to pre-compile underlying libraries to generate multiple variants optimized for use indifferent ...
Transforming Complex Loop Nests For Locality
(2002-02-19)
Because of the increasing gap between the speeds of processors and standard memory chips, many compiler techniques have been developed to enhance locality of applications. This paper focuses on automatically optimizing ...
Resource Constrained Loop Fusion
(2003-09-03)
Embedded processors have limited on-chip memory. Fusing loops that use the same data can reduce the distance between accesses to the same memory location, avoiding costly off-chip memory transfer. Most existing greedy ...
A simple, fast dominance algorithm
(2006-01-11)
The problem of finding the dominators in a control-flow graph has a long history in the literature. The original algorithms suffered from a large asymptotic complexity but were easy to understand. Subsequent work improved ...
Scalable Grid Application Scheduling via Decoupled Resource Selection and Scheduling
(2006-01-20)
Over the past years grid infrastructures have been deployed at larger and larger scales, with envisioned deployments incorporating tens of thousands of resources. Therefore, application scheduling algorithms can become ...
Scalarizing Fortran 90 Array Syntax
(2001-03-30)
Array syntax is an important feature introduced in Fortran 90. It adds more expressive power to the language by allowing operations and assignments on the array sections. Programmers will benefit from this new feature ...
Domain-Specific Type Inference for Library Generation in a Telescoping Compiler
(2004-04-14)
Telescoping languages is a strategy for allowing users to develop code in high-level, domain-specific languages and still achieve high performance. It uses extensive offline processing of the library defining the language. ...
Iterative Data-flow Analysis, Revisited
(2004-03-26)
The iterative algorithm is widely used to solve instances of data-flow analysis problems. The algorithm is attractive because it is easy to implement and robust in its behavior. The theory behind the algorithm shows that, ...
Evaluating a Model for Cache Conflict Miss Prediction
(2005-04-10)
Cache conflict misses can cause severe degradation in application performance. Previous research has shown that for many scientific applications majority of cache misses are due to conflicts in cache. Although, conflicts ...