期刊文献+

SMP集群系统的可扩放性分析

Analysis on Scalability of SMP Cluster System
下载PDF
导出
摘要 随着并行计算技术的快速发展和SMP集群的普及,可扩放性已经成为并行应用程序设计和实现方面最重要的性能之一。但传统的可扩放性评价准则不能对SMP集群的可扩放性进行较精准的评价。为此,在分析SMP集群中处理器集合的特性和传统等效率模型并掌握其优缺点以及分析并行计算速度的基础上,给出了一种适合SMP集群系统效率的定义,并基于该定义提出了一种新的可扩放性评价准则(改进的等效率可扩放性评价准则)。该新准则可用来评价并行算法和SMP集群相结合的可扩放性。为验证所提出评价准则的有效性,在集群平台上运行矩阵乘法程序进行了相关的扩放性实验。实验结果表明,所提出的新评价准则对算法和并行机的最优匹配有指导作用,同时有助于对并行算法的设计和改进。 With the rapid development of parallel computing technology and the popularity of SMP clusters, scalability has become one of the most important performance for parallel application program design and implementation. However, the traditional scalability metric cannot evaluate the scalability of SMP cluster accurately. Therefore, the definition has been proposed to describe the efficiency of SMP cluster system based on the analysis of the property of the set of processors and the ISO-efficiency function in SMP duster, understanding their merits and deficiencies, as well as the analysis of the parallel execution speed. Then a new metric,improved ISO-efficiency metric, has been proposed, which can be used to measure and evaluate the scalability of parallel algorithms and SMP cluster. The extension exper- iments have been carded out on the cluster platforms by running the program for the matrix multiplication algorithm in order to validate the effectiveness of the new evaluation criteria. Experimental results show that the new evaluation criterion has guided the optimal matc- hing of the parallel application and the parallel machines. Thus it is helpful to the design and the improvement of parallel algorithms.
作者 田青 祝永志
出处 《计算机技术与发展》 2017年第6期95-98,105,共5页 Computer Technology and Development
基金 山东省自然科学基金(ZR2013FL015) 山东省研究生教育创新资助计划(SDYY12060)
关键词 并行计算 SMP集群 可扩放性 等效率 parallel computing SMP clusters scalability ISO-efficiency
  • 相关文献

参考文献7

二级参考文献59

  • 1迟利华,刘杰,胡庆丰.数值并行计算可扩展性评价与测试[J].计算机研究与发展,2005,42(6):1073-1078. 被引量:10
  • 2迟利华.大型稀疏线性方程组在分布式存储环境下的并行计算:博士学位论文[M].长沙:国防科学技术大学计算机学院,1998..
  • 3[1]Johnston WE. The case for using commercial symmetric multiprocessors as supercomputers, http://www-itg.lbl.gov/~johnston/Scientific. Comp. Arch/Scientific. Comp. Arch.fm.html
  • 4[2]Top500. http://www.topS00.org
  • 5[3]Kumar V, Rao VN. Parallel depth first search, Part Ⅱ: Analysis. International Journal of Parallel Programming, 1987,16(6):501~519.
  • 6[4]Sun XH, Rover DT. Scalability of parallel algorithm-machine combinations. IEEE Trans. on Parallel Distributed Systems, 1994,5(6):599~613.
  • 7[5]Zhang XD, Yan Y, He K. Latency metric: An experimental method for measuring and evaluating parallel program and architecture scalability. Journal of Parallel and Distributed Computing, 1994,22(3):392~410.
  • 8[6]Ji YC, An H, Ding WQ, Chen GL. A scalability metric for algorithm-machine on NOW and MPP. In: Proc. of the 4th Int'l Conf. on High-Performance Computing in Asia-Pacific Region. 2000. 405~407.
  • 9[7]Dawning-2000. http://202.38.76.202/dawn2000
  • 10[8]NHPCC(Hefei). http://nhpcc.ustc.edu.cn

共引文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部