期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Fast combination of scheduling chains under resource and time constraints
1
作者 WANG Ji-min PAN Xue-zeng +1 位作者 WANG Jie-bing SUN Kang 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2007年第1期119-126,共8页
Scheduling chain combination is the core of chain-based scheduling algorithms, the speed of which determines the overall performance of corresponding scheduling algorithm. However, backtracking is used in general comb... Scheduling chain combination is the core of chain-based scheduling algorithms, the speed of which determines the overall performance of corresponding scheduling algorithm. However, backtracking is used in general combination algorithms to traverse the whole search space which may introduce redundant operations, so performance of the combination algorithm is generally poor. A fast scheduling chain combination algorithm which avoids redundant operations by skipping “incompatible” steps of scheduling chains and using a stack to remember the scheduling state is presented in this paper to overcome the problem. Experimental results showed that it can improve the performance of scheduling algorithms by up to 15 times. By further omitting unnecessary operations, a fast algorithm of minimum combination length prediction is developed, which can improve the speed by up to 10 times. 展开更多
关键词 Fast combination algorithm chain-based scheduling algorithm High-level synthesis (HLS) Minimum length prediction
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部