跳到主要导航 跳到搜索 跳到主要内容

Optimization of parallel I/O for Cannon's algorithm based on Lustre

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Matrix multiplication is one of the most important operations in linear algebra, widely used in many fields of science and engineering. Cannon's algorithm is a classical distributed algorithm for matrix multiplication for two-dimensional meshes. Generally, MPI-IO is used for its I/O requirements. However it has been well documented that MPI-IO performs poorly in a Lustre file system environment. As the scale of matrix multiplication increased, this problem trends to be serious, becoming one key factor impacting performance of the program. In order to improve the performance of Collective I/O of Cannon's program, we proposed a new aggregation pattern (Stripe-continuous aggregation pattern), which fully considers the stripping mechanism and lock protocol of Lustre file system. The theoretical analysis and experimental results show that the pattern can make full use of the capacity of Lustre file system compared with the other patterns, and improve the I/O performance of the Cannon's program efficiently.

源语言英语
主期刊名Proceedings - 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012
31-35
页数5
DOI
出版状态已出版 - 2012
活动11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012 - Guilin, 中国
期限: 19 10月 201222 10月 2012

出版系列

姓名Proceedings - 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012

会议

会议11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2012
国家/地区中国
Guilin
时期19/10/1222/10/12

指纹

探究 'Optimization of parallel I/O for Cannon's algorithm based on Lustre' 的科研主题。它们共同构成独一无二的指纹。

引用此