ZONE SCHEDULING

被引:11
作者
HWANG, CT
HSU, YC
机构
[1] Department of Computer Science, University of California, Riverside
关键词
D O I
10.1109/43.238029
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a new technique is presented for the resource constrained scheduling problem in high level synthesis. This approach works by successively partitioning the control steps into zones and solving each of them by a 0-1 integer linear programming technique. By specifying the maximum number of 0-1 variables involved within a zone, the model can be turned into an optimal ILP scheduling, a list scheduling, or one in between with different speed/quality characteristics. Experiments show that better results than those achieved by list scheduling have been obtained with an acceptable computation overhead.
引用
收藏
页码:926 / 934
页数:9
相关论文
共 21 条
[1]  
ARYA S, 1985, IEEE T COMPUTERS NOV, P981
[2]   PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS - A BRANCH AND BOUND APPROACH [J].
CHRISTOFIDES, N ;
ALVAREZVALDES, R ;
TAMARIT, JM .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 29 (03) :262-273
[3]  
DAVIDSON S, 1981, IEEE T COMPUT, P460
[4]  
DEMAN H, 1986, IEEE DESIGN TEST DEC, P13
[5]  
GAJSKI DD, SILICON COMPILATION, P1
[6]  
GIRCZYC EF, 1984, THESIS CARLETON U OT
[7]  
HAFER L, 1983, IEEE T COMPUTER JAN, P4
[8]   A FORMAL APPROACH TO THE SCHEDULING PROBLEM IN HIGH-LEVEL SYNTHESIS [J].
HWANG, CT ;
LEE, JH ;
HSU, YC .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1991, 10 (04) :464-475
[9]  
KUNG SY, 1985, VLSI MODERN SIGNAL P, P258
[10]  
LIN SZ, 1991, NOV P ICCAD 91, P38