科研之友
微信
新浪微博
Facebook
分享链接
摘要
Scalability is a very important performance metric of parallel computing, but the traditional scalability metrics only try to reflect the parallel computing scalability from one side, which is difficult to fully measure its comprehensive performance. This paper studies scalability metrics deeply and fully. We choose a group of key metrics from lots of performance parameters and normalize them, then characterize the overall performance of parallel computing by the area of Kiviat graph which is posed by the group of key parameters. Thereby, we propose a novel scalability metric about iso-area of performance for parallel computing which measures the scalability of parallel computing by comparing the initial area of the Kiviat graph with the extended one. And the relationship between the new metric and the traditional ones is further analyzed. Finally, the novel metric is applied to address the scalability of the matrix multiplication algorithm under LogP model, and the experiments about extension are carried out on cluster platforms by running the program for the algorithm in order to further validate the effectiveness of the new metric. It is significant to improve parallel computing architecture and to tune parallel algorithm design.
- 出版日期2014
- 单位同济大学
