检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:熊焕亮[1,2] 吴沧海[1] 匡桂娟[2,3] 杨文姬[1]
机构地区:[1]江西农业大学软件学院,南昌330045 [2]同济大学计算机科学与技术系,上海200092 [3]青岛农业大学理学与信息学院,山东青岛266109
出 处:《计算机应用》2014年第12期3417-3423,共7页journal of Computer Applications
基 金:国家863计划项目(2009AA012201);国家自然科学基金资助项目(61272107;61202173;61103068;61402244);上海市优秀学科带头人计划项目(10XD1404400);教育部网络时代的科技论文快速共享专项(20110740001);江西省教育厅科技计划项目(GJJ14282)
摘 要:在固定结构的需求下,并行计算无法通过规模扩展提升其计算性能。针对此类并行计算可扩展问题,分析影响可扩展性的并行任务因素及体系结构因素,采用带权图对并行任务及体系结构进行建模,并提出一种关键路径不变的可扩展方法,其核心思想是固定图结构,仅合理地调整图节点权值和边权值。通过进一步推导,得出一些关于新扩展方法的性质结论。应用网格计算模拟工具Sim Grid开展的实验结果表明,所提出的扩展方法能有效解决此类扩展问题,且保持速度效率不变。Extending in parallel computing is an effective approach to achieve higher computing performance. However, under the constraint of the fixed structure, it is difficult to improve the performance of parallel computing only by extending its scale simply. Concerning such extension problem of parallel computing, this paper investigated the factors from architecture and parallel tasks which affect its scalability, and modeled the architecture as well as parallel tasks by the weighted graph. Then, an extension method was proposed that the critical path remained unchanged. The novel extension method, in essence, did not change the graph' s structure and only adjusts the graph' s weights. Additionally, some conclusions about the new extension method were drawn by further derivation. Finally, the simulative experiments on the platform SimGrid were conducted to test the effectiveness of the proposed extension method. The results show that the proposed method can solve such extension problem, and at the same time it also realize isospeed-e extension, it can help guide practical extensions of parallel computing.
关 键 词:并行计算 固定结构 算法与机器 图建模 扩展方法
分 类 号:TP338[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222