Memory efficient parallel matrix multiplication operation for irregular problems

Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed matrices. Our approach relies on a distribution independent algorithm that provides dynamic load balancing by exploiting data locality and achieves performance as good as the traditional approach which relies on temporary arrays with regular distribution, data redistribution, and matrix multiplication for regular matrices to handle the irregular case. The proposed algorithm is memoryefficient because temporary matrices are not needed. This feature is critical for systems like the IBM Blue Gene/L that offer very limited amount of memory per node. The experimental results demonstrate very good performance across the range of matrix distributions and problem sizes motivated by real applications. Categories and Subject Descriptors

• Type: Conference
• Year: 2006
• Where: CF
• Authors: Manojkumar Krishnan, Jarek Nieplocha
• Keywords: CF 2006, Dense Matrices, Regular Distribution, Regular Matrices