检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:熊焕亮[1,2,3] 曾国荪[1,3] 吴沧海[2] 匡桂娟[1,3,4] 何火娇[2]
机构地区:[1]同济大学计算机科学与技术系,上海201804 [2]江西农业大学软件学院,南昌330045 [3]国家高性能计算机工程技术中心同济分中心,上海201804 [4]青岛农业大学理学与信息科学学院,山东青岛266109
出 处:《计算机应用》2014年第3期663-667,共5页journal of Computer Applications
基 金:国家863计划项目(2009AA012201);国家自然科学基金资助项目(61363041;61272107;61202173;61103068);上海市优秀学科带头人计划项目(10XD1404400);教育部网络时代的科技论文快速共享专项研究课题(20110740001)
摘 要:针对以往关于可扩展性研究中未充分考虑并行执行时间因素,可扩展性与并行执行时间的关系仍未研究清楚的问题,深入和全面研究延迟可扩展性和并行执行时间的关系,得出并证明了不同算法-机器组合体在相同初始状态下进行延迟扩展后,若执行更快的组合体具有更好的延迟扩展性,则该组合体在扩展后仍将保持更快等重要结论。这些结论丰富了可扩展性和并行执行时间关系的研究内容,为并行计算延迟扩展获得理想扩展性能提供了理论依据。最后,通过对不同算法-机器组合体进行扩展实验,进一步验证了结论的有效性。Concerning the problem that previous studies on the scalability do not fully consider parallel execution time, and the relationships between latency scalability and parallel execution time have not been yet studied thoroughly, this paper studied the relationships between latency scalability and parallel execution time deeply and fully. Thereby some important conclusions were drawn, and they were about the relationships between latency scalability and parallel execution time after different algorithm-machines were extended from the same initial state. Then the proof of the above conclusions was given in this paper. The derived conclusions enriched the research content about the relationships between latency scalability and parallel execution time and provided a theoretical basis for obtaining ideal latency scalability of parallel computing. Finally the important conclusions and analytical expressions were verified through experimental results obtained for different algorithmmachines.
分 类 号:TP338[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.191