The who)e graph was scheduled using force-directed list scheduling (FDLS) algorithm, and the upper bound of the length of sub-schedule sequence whose each merging node could accommodate was estimated.
英
美
释义
借助弹力引导列表调度(FDLS)的调度结果得出子图调度长度上界,并据此在归并过程中去除不可行的局部序列。
把海词放在桌面上,查词最方便
触屏版
|
电脑版
©2003 - 2024 海词词典(Dict.cn)
立即下载