Sciweavers

3750 search results - page 557 / 750
» Code Optimization for Code Compression
Sort
View
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
16 years 3 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
CC
2001
Springer
146views System Software» more  CC 2001»
15 years 11 months ago
Alias Analysis by Means of a Model Checker
We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can signi...
Vincenzo Martena, Pierluigi San Pietro
LISP
2008
104views more  LISP 2008»
15 years 6 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
GLVLSI
2007
IEEE
141views VLSI» more  GLVLSI 2007»
16 years 24 days ago
Transition-activity aware design of reduction-stages for parallel multipliers
We propose an interconnect reorganization algorithm for reduction stages in parallel multipliers. It aims at minimizing power consumption for given static probabilities at the pri...
Saeeid Tahmasbi Oskuii, Per Gunnar Kjeldsberg, Osc...
LCTRTS
2007
Springer
16 years 18 days ago
Tetris: a new register pressure control technique for VLIW processors
The run-time performance of VLIW (very long instruction word) microprocessors depends heavily on the effectiveness of its associated optimizing compiler. Typical VLIW compiler pha...
Weifeng Xu, Russell Tessier