Loop based scheduling for high level synthesis

Author

Al-Sukhni, Hassan F. ; Youssef, Habib ; Sait, Sadiq M. ; Benten, Muhammad S T

Author_Institution

Dept. of Comput. Eng., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia

fYear

1995

fDate

28-31 Mar 1995

Firstpage

76

Lastpage

81

Abstract

This paper describes a new loop based scheduling algorithm. The algorithm aims at reducing the runtime processing complexity of path based scheduling techniques. It partitions the control flow graph of the input specification into subgraphs before scheduling the different paths of each subgraph. Benchmark tests as well as simulation results on the scheduling algorithm indicate that the proposed algorithm results in sizeable reduction in runtime

Keywords

computational complexity; digital simulation; high level synthesis; performance evaluation; scheduling; benchmark tests; control flow graph; high level synthesis; input specification; loop based scheduling; path based scheduling; runtime processing complexity; scheduling algorithm; subgraphs; Benchmark testing; Circuit testing; Flow graphs; High level synthesis; Minerals; Partitioning algorithms; Petroleum; Processor scheduling; Runtime; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers and Communications, 1995., Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on

Conference_Location

Scottsdale, AZ

Print_ISBN

0-7803-2492-7

Type

conf

DOI

10.1109/PCCC.1995.472508

Filename

472508