Title :
A heuristic approach to datapath scheduling of complex conditional structure
Author :
Nakamura, Satoru ; Yamada, Akihisa ; Shirakawa, Isao
Author_Institution :
Dept. of Inf. Syst. Eng., Osaka Univ., Japan
Abstract :
This paper proposes a new heuristic approach to the time-constrained datapath scheduling with complex conditional structures. This algorithm intends to select the best of all solutions attained by the iterative refinement process. Experimental results demonstrate that this algorithm attains optimal results in most cases and can be applied to a practical scale of datapath scheduling
Keywords :
data flow graphs; high level synthesis; iterative methods; scheduling; behavioural description; complex conditional structure; heuristic approach; high-level synthesis; iterative refinement process; time-constrained datapath scheduling; Boolean functions; Cost function; Data structures; Hardware; Heuristic algorithms; Information systems; Iterative algorithms; Iterative methods; Scheduling algorithm; Testing;
Conference_Titel :
Microelectronics and VLSI, 1995. TENCON '95., IEEE Region 10 International Conference on
Print_ISBN :
0-7803-2624-5
DOI :
10.1109/TENCON.1995.496361
