Sciweavers

258 search results - page 16 / 52
» Compiler Optimization-Space Exploration
Sort
View
LCTRTS
1998
Springer
14 years 2 months ago
Non-local Instruction Scheduling with Limited Code Growth
Instruction scheduling is a necessary step in compiling for many modern microprocessors. Traditionally, global instruction scheduling techniques have outperformed local techniques....
Keith D. Cooper, Philip J. Schielke
JUCS
2008
182views more  JUCS 2008»
13 years 9 months ago
Modularizing Theorems for Software Product Lines: The Jbook Case Study
: A goal of software product lines is the economical assembly of programs in a family of programs. In this paper, we explore how theorems about program properties may be integrated...
Don S. Batory, Egon Börger
LISP
2008
104views more  LISP 2008»
13 years 9 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
LCTRTS
1999
Springer
14 years 2 months ago
Optimizing for Reduced Code Space using Genetic Algorithms
Code space is a critical issue facing designers of software for embedded systems. Many traditional compiler optimizations are designed to reduce the execution time of compiled cod...
Keith D. Cooper, Philip J. Schielke, Devika Subram...
CODES
2001
IEEE
14 years 1 months ago
RS-FDRA: a register sensitive software pipelining algorithm for embedded VLIW processors
The paper proposes a novel software-pipelining algorithm, Register Sensitive Force Directed Retiming Algorithm (RSFDRA), suitable for optimizing compilers targeting embedded VLIW ...
Cagdas Akturan, Margarida F. Jacome