Sciweavers

51 search results - page 10 / 11
» Coloring Heuristics for Register Allocation
Sort
View
CASES
2009
ACM
13 years 5 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
DAGM
2007
Springer
14 years 1 months ago
Stochastic Optimization of Multiple Texture Registration Using Mutual Information
Abstract. We consider the problem of simultaneously registering several images to a 3D model. We propose a global approach based on mutual information that extends previous methods...
Ioan Cleju, Dietmar Saupe
DAC
1995
ACM
13 years 11 months ago
Code Optimization Techniques for Embedded DSP Microprocessors
—We address the problem of code optimization for embedded DSP microprocessors. Such processors (e.g., those in the TMS320 series) have highly irregular datapaths, and conventiona...
Stan Y. Liao, Srinivas Devadas, Kurt Keutzer, Stev...
ASPLOS
1998
ACM
13 years 11 months ago
Compiler-Controlled Memory
Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a reasonable level...
Keith D. Cooper, Timothy J. Harvey
PLDI
2005
ACM
14 years 1 months ago
Demystifying on-the-fly spill code
Modulo scheduling is an effective code generation technique that exploits the parallelism in program loops by overlapping iterations. One drawback of this optimization is that reg...
Alex Aletà, Josep M. Codina, Antonio Gonz&a...