Experimental evaluation of affine schedules for matrix multiplication on the MasPar architecture

Abstract

This paper reports an experimental study on the suitability of systolic algorithm scheduling methods to the automatic parallelization of algorithms on SIMD computers. We consider the matrix multiplication on the MasPar MP-1 architecture. We comparatively study different scheduling methods and the blocking of the best resulting algorithms.<>