Sciweavers

177 search results - page 4 / 36
» Minimal Data Dependence Abstractions for Loop Transformation...
Sort
View
IPL
2008
118views more  IPL 2008»
14 years 9 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
ASAP
2006
IEEE
110views Hardware» more  ASAP 2006»
15 years 3 months ago
Loop Transformation Methodologies for Array-Oriented Memory Management
Abstract – The storage requirements in data-dominant signal processing systems, whose behavior is described by arraybased, loop-organized algorithmic specifications, have an imp...
Florin Balasa, Per Gunnar Kjeldsberg, Martin Palko...
ET
2010
83views more  ET 2010»
14 years 8 months ago
Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems
—Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. For the class of static affine program...
Sven Verdoolaege, Martin Palkovic, Maurice Bruynoo...
ISPA
2004
Springer
15 years 2 months ago
An Inspector-Executor Algorithm for Irregular Assignment Parallelization
Abstract. A loop with irregular assignment computations contains loopcarried output data dependences that can only be detected at run-time. In this paper, a load-balanced method ba...
Manuel Arenaz, Juan Touriño, Ramon Doallo
ICPP
1995
IEEE
15 years 1 months ago
Fusion of Loops for Parallelism and Locality
Loop fusion improves data locality and reduces synchronization in data-parallel applications. However, loop fusion is not always legal. Even when legal, fusion may introduce loop-...
Naraig Manjikian, Tarek S. Abdelrahman