检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:裴颂文[1,2] 吕春龙 宁钟 顾春华[1] Pei Songwen;Lyu Chunlong;Ning Zhong;Gu Chunhua(School of Optical-Electrical & Computer Engineering, University of Shanghai for Science & Technology, Shanghai 200093, China;School of Management, Fudan University, Shanghai 200433, China)
机构地区:[1]上海理工大学光电信息与计算机工程学院,上海200093 [2]复旦大学管理学院,上海200433
出 处:《计算机应用研究》2019年第5期1433-1436,1440,共5页Application Research of Computers
基 金:上海市自然科学基金资助项目(15ZR1428600);上海市浦江人才项目(16PJ1407600);中国博士后科学基金资助项目(2017M610230);国家自然科学基金重点资助项目(61332009);国家自然科学基金面上项目(61775139)
摘 要:Codelet数据流计算模型在处理大规模并行计算任务时效果显著,但该模型目前缺少在异构多核环境中的任务调度策略。因此,提出了一种在异构多核环境下基于蚁群算法的Codelet任务调度策略。该调度策略将启发式算法与蚁群算法相融合,在发挥各自优势的同时克服了启发式算法不能得出最优解的缺陷以及蚁群算法初始信息匮乏的问题。实验结果表明,智能蚁群任务调度策略相比Codelet运行时系统中原生的动态调度和静态调度策略具有更高的执行效率。Codelet dataflow model has significant effects on gaining high performance of computing large-scale parallel tasks, but the model currently lacks scheduling policy in heterogeneous multi-core environment. Regarding to this issue, this paper proposed a Codelet task scheduling strategy by fusing ant colony algorithm with a heuristic approach in heterogeneous multicore environment. It had both advantages of the heuristic algorithm and ant colony algorithm, and it overcame both defects of the heuristic algorithm that could not derive an optimal solution and the defects of the ant colony algorithm that was lack of the initial information. The experimental result shows, the smart ant colony scheduling policy is much more efficient than the native dynamic and static scheduling policies in the runtime system implementation of the Codelet model.
关 键 词:数据流计算 Codelet模型 异构多核 蚁群算法 任务调度
分 类 号:TP303[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.151