浏览全部资源
扫码关注微信
1. 北京理工大学计算机系
2. 北京理工大学自动控制系
3. 北京理工大学计算机系北京理工大学自动控制系
Published:1996
移动端阅览
[1]李淳,刘明业,吴沧浦.基于功能单元最大利用率的调度算法[J].电子学报,1996(02):6-10+16.
李淳, 刘明业, 吴沧浦. An Algorithm Based on the Maximum Utility-Ratio of the Function Units[J]. Acta Electronica Sinica, 1996, (2).
[1]李淳,刘明业,吴沧浦.基于功能单元最大利用率的调度算法[J].电子学报,1996(02):6-10+16. DOI:
李淳, 刘明业, 吴沧浦. An Algorithm Based on the Maximum Utility-Ratio of the Function Units[J]. Acta Electronica Sinica, 1996, (2). DOI:
高级综合中调度决定系统运行速度与造价的折衷,调度问题为NP问题,本文将调度问题看作为多目标优化问题,并提出一种基于功能单元最大利用率的调度算法,以较低的时间复杂度求得调度问题的最优或近似最优解。该算法不仅可求解时间约束下的调度问题,也可求解造价约束下的调度问题。
In high-level synthesis
trade-off of speed and cost is decided by scheduling
which is an NP-complete problem
In this paper
it is regarded as a multi criteria problem
An algorithm based on the maximum utility-ratio of the function units is put forword
Using this algorithm
optimal or near optimal solution can be gained with lower computing complexity
It can solve not only the problem under the time constraints
but also that under the cost contraints.
0
Views
31
下载量
3
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution