Fast Matrix Multiplication in Dynamic SMP Clusters with Communication on the Fly in Systems on Chip Technology

  • Authors:
  • Marek Tudruj;Lukasz Masko

  • Affiliations:
  • Polish Academy of Sciences, Poland;Polish-Japanese Institute of Information Technology, Poland

  • Venue:
  • PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper concerns numerical computations in a new shared memory system architecture oriented towards systems on chip technology. Dynamically reconfigurable processor clusters which adjust at program run-time to computation and communication requirements of programs and a new data exchange method between processors - called "communication on the fly" are main assumed architectural features. They provide a synergy of processor switching between clusters with data reads on the fly by many processors in the cluster while being written by the switched processor into memory. The paper presents results of simulated execution of matrix multiplication parallel program graphs. Considered graphs are based on two data decomposition methods: recursive division of matrices into squares and division into stripes. Elementary serial multiplications of square submatrices in parallel algorithms are done using Strassen method. The experiments show high efficiency of the proposed matrix multiplication method.