Sciweavers

2038 search results - page 16 / 408
» Loops under Strategies
Sort
View
IPL
2008
118views more  IPL 2008»
13 years 7 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
SC
2005
ACM
14 years 1 months ago
Integrated Loop Optimizations for Data Locality Enhancement of Tensor Contraction Expressions
A very challenging issue for optimizing compilers is the phase ordering problem: In what order should a collection of compiler optimizations be performed? We address this problem ...
Swarup Kumar Sahoo, Sriram Krishnamoorthy, Rajkira...
MICRO
1992
IEEE
133views Hardware» more  MICRO 1992»
13 years 11 months ago
Code generation schema for modulo scheduled loops
Software pipelining is an important instruction scheduling technique for efficiently overlapping successive iterations of loops and executing them in parallel. Modulo scheduling i...
B. Ramakrishna Rau, Michael S. Schlansker, Parthas...
CC
2007
Springer
14 years 1 months ago
Preprocessing Strategy for Effective Modulo Scheduling on Multi-issue Digital Signal Processors
To achieve high resource utilization for multi-issue Digital Signal Processors (DSPs), production compilers commonly include variants of the iterative modulo scheduling algorithm. ...
Doosan Cho, Ravi Ayyagari, Gang-Ryung Uh, Yunheung...
AAAI
2004
13 years 9 months ago
Loop Formulas for Circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
Joohyung Lee, Fangzhen Lin