DMCA
A Code-Motion Pruning Technique for Global Scheduling (2000)
| Venue: | ACM Transactions on Design Automation of Electronic Systems (TODAES |
| Citations: | 1 - 0 self |
BibTeX
@ARTICLE{Santos00acode-motion,
author = {Luiz C. V. Dos Santos and M.J.M. Heijligers and C.A.J. van Eijk and J.T.J. van Eijndhoven and J.A.G. Jess},
title = {A Code-Motion Pruning Technique for Global Scheduling},
journal = {ACM Transactions on Design Automation of Electronic Systems (TODAES},
year = {2000},
volume = {5},
pages = {1--38}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In the high--level synthesis of ASICs or in the code generation for ASIPs, the presence of conditionals in the behavioral description represents an obstacle to exploit parallelism. Most existing methods use greedy choices in such a way that the search space is limited by the applied heuristics. For example, they might miss opportunities to optimize across basic block boundaries when treating conditional execution. We propose a constructive method which allows generalized code motions. Scheduling and code motion are encoded in the form of a unified resource--constrained optimization problem. In our approach many alternative solutions are constructed and explored by a search algorithm, while optimal solutions are kept in the search space. Our method can cope with issues like speculative execution and code duplication. Moreover, it can tackle constraints imposed by the advance choice of a controller, such as pipelined--control delay and limited branch capabilities. The underlying timing m...
Keyphrases
code-motion pruning technique global scheduling search space code motion high level synthesis optimal solution speculative execution advance choice search algorithm greedy choice behavioral description limited branch capability code duplication control delay applied heuristic code generation optimization problem basic block boundary conditional execution approach many alternative solution unified resource constructive method
