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

fYear

1995

fDate

6-10 Nov 1995

Firstpage

155

Lastpage

158

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;

fLanguage

English

Publisher

ieee

Conference_Titel

Microelectronics and VLSI, 1995. TENCON '95., IEEE Region 10 International Conference on

Print_ISBN

0-7803-2624-5

Type

conf

DOI

10.1109/TENCON.1995.496361

Filename

496361

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3536207