Comparison of scalable parallel matrix multiplication libraries

This paper compares two general library routines for performing parallel distributed matrix multiplication. The PUMMA algorithm utilities block scattered data layout, whereas BiMMeR utilizes virtual 2-D torus wrap. The algorithmic differences resulting from these different layouts are discussed us well as the general issues associated with different data layouts for library routines. Results on the Intel Delta for the two matrix multiplication algorithms are presented.<>