并行系统可扩性分析研究

Study of the Scalability Analysis for the Parallel Systems

分析了几种已有的可扩性分析模型 ,并对传统的时间受限与存储受限加速比定律作了新的解释。在此基础上 ,概括出了可扩性分析的本质 ,定义了一类一般意义下同构机器与并行算法组成的并行系统的可扩性模型 ,并由此出发 ,提出了三种新的可扩性模型 :等平均I/O需求模型 ,等平均通信需求模型和等利用率模型。最后探讨了工作站机群与并行算法组成的并行系统的可扩性分析。

Several existed models for scalability analysis are introduced. The time-constraint and memory-constraint speedup laws are analyzed from a new viewpoint. Based on these models, we extract the essential of this metric and give a generalized definition for it when the parallel system is composed of a parallel algorithm and an isomorphic architecture. From this definition, present three other models for scalability analysis: equal-average-I/O-requirements model, equal-average-communication-requirements model and equal-utilization model. Finally, We discuss the extension of these models to cluster of workstation systems.