可变结构的并行计算中任务粒度细化可扩展方法  

Extension by Refining Task Granularity for Parallel Computation with Variable Structures

作　　者：熊焕亮[1,2,3] 曾国荪[1,3] 

机构地区：[1]同济大学电子与信息工程学院,上海200092 [2]江西农业大学软件学院,江西南昌330045 [3]国家高性能计算机工程技术中心同济分中心,上海200092

出　　处：《同济大学学报（自然科学版）》2016年第10期1636-1644,共9页Journal of Tongji University:Natural Science

基　　金：上海市优秀学科带头人计划(10XD1404400);江西省自然科学基金(20161BAB212047;20151BAB207040);华为创新研究计划(IRP-2013-12-03);高效能服务器和存储技术国家重点实验室开放基金(2014HSSA10);江西省教育厅科研项目(GJJ150426)

摘　　要：首先评估并行任务及体系结构中影响可扩展性的关键因素,并对并行任务及体系结构进行图建模.然后,提出一种DAG任务粒度细化的可扩展方法,本质上是变换图的结构、调整图节点权值和边权值.进一步推导得出一些关于新扩展方法的有用结论.最后,应用网格模拟工具SimGrid开展实验,结果表明所提出的扩展方法,能实现可变结构并行计算的等速度效率扩展,对于并行计算扩展实践有指导意义.Aiming at such extension problem in parallel computation, this paper evaluates the key factors from parallel tasks and architecture which affect the scalability, and then models parallel tasks as well as architecture by the weighted graph. Especially, we propose the extension method of refining task granularity to realize an extension in parallel computation. The extension method transforms the graph＇s structure and adjusts the weights of its nodes and edges in essence. Additionally, by further derivation, some significant conclusions about the new extension methods are drawn. Finally, the simulative experiments are conducted on the platform SimGrid to verify the effectiveness of the proposed extension methods. The results show that the new methods can realize iso-speed-e extension in parallel computation withvariable structures, which is helpful for its practical extension.

关 键 词：并行计算 机器与算法 可变结构 扩展方法 

分 类 号：TP338[自动化与计算机技术—计算机系统结构]