Sciweavers

40 search results - page 2 / 8
» Loop Summarization Using Abstract Transformers
Sort
View
ICCD
2000
IEEE
135views Hardware» more  ICCD 2000»
14 years 2 months ago
A Methodology and Tool for Automated Transformational High-Level Design Space Exploration
el of abstraction by integrating a high-level estimation step. This results in a design loop which is tight led on high level of abstraction (called estimation loop in figure 1). ...
Joachim Gerlach, Wolfgang Rosenstiel
SAMOS
2004
Springer
13 years 11 months ago
Modeling Loop Unrolling: Approaches and Open Issues
Abstract. Loop unrolling plays an important role in compilation for Reconfigurable Processing Units (RPUs) as it exposes operator parallelism and enables other transformations (e.g...
João M. P. Cardoso, Pedro C. Diniz
CAV
2009
Springer
165views Hardware» more  CAV 2009»
13 years 9 months ago
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
Sven Verdoolaege, Gerda Janssens, Maurice Bruynoog...
IPPS
2010
IEEE
13 years 3 months ago
DynTile: Parametric tiled loop generation for parallel execution on multicore processors
Abstract--Loop tiling is an important compiler transformation used for enhancing data locality and exploiting coarsegrained parallelism. Tiled codes in which tile sizes are runtime...
Albert Hartono, Muthu Manikandan Baskaran, J. Rama...
CGO
2003
IEEE
13 years 11 months ago
Optimizing Memory Accesses For Spatial Computation
In this paper we present the internal representation and optimizations used by the CASH compiler for improving the memory parallelism of pointer-based programs. CASH uses an SSA-b...
Mihai Budiu, Seth Copen Goldstein