MPT-based scheduling for high-level synthesis

Author

Hsiao, Pei-Yung ; Wu, Guang-Min ; Ho, Min-Huang ; Chang, Chi-Jeng

Author_Institution

Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan

fYear

1995

fDate

31 May-2 Jun 1995

Firstpage

63

Lastpage

67

Abstract

The conventional scheduling algorithms either give a nonoptimal solution or present a long execution time in moderate cases. In this paper, we propose a branch-and-bound algorithm based on an MPT graph to solve the scheduling problem of high-level synthesis. Six efficient priority rules were developed as bound functions of the algorithm. Experimental results show that this algorithm can obtain a competitive schedule in a very short execution time

Keywords

VLSI; circuit CAD; high level synthesis; integrated circuit design; scheduling; MPT graph; MPT-based scheduling; VLSI design; bound functions; branch/bound algorithm; high-level synthesis; maximum possibility table; priority rules; scheduling algorithm; Computer industry; Computer science education; Contracts; Costs; High level synthesis; Information science; Job shop scheduling; Optimal scheduling; Processor scheduling; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

VLSI Technology, Systems, and Applications, 1995. Proceedings of Technical Papers. 1995 International Symposium on

Conference_Location

Taipei

ISSN

1524-766X

Print_ISBN

0-7803-2773-X

Type

conf

DOI

10.1109/VTSA.1995.524635

Filename

524635