Heuristic algorithm for the resource constrained scheduling problem during high-level synthesis

Abstract

Scheduling is considered the most important task in a high-level synthesis process. A heuristic algorithm based on the A search to find optimal schedules quickly is presented. This algorithm reduces the computational effort required to obtain the best schedules on a pre-defined datapath by effectively pruning the non-promising search space. The pruning… (More)
DOI: 10.1049/iet-cdt:20070162

Topics

7 Figures and Tables

Cite this paper

@article{Wu2009HeuristicAF, title={Heuristic algorithm for the resource constrained scheduling problem during high-level synthesis}, author={Yi-Hsin Wu and Cheng-Juei Yu and Sheng-De Wang}, journal={IET Computers & Digital Techniques}, year={2009}, volume={3}, pages={43-51} }