Surrounding theorem: developing parallel programs for matrix-convolutions

  • Authors:

  • Kento Emoto;Kiminori Matsuzaki;Zhenjiang Hu;Masato Takeichi

  • Affiliations:

  • Department of Mathematical Informatics, University of Tokyo;Department of Mathematical Informatics, University of Tokyo;Department of Mathematical Informatics, University of Tokyo;Department of Mathematical Informatics, University of Tokyo

  • Venue:
  • Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, but development of efficient parallel programs on two-dimensional arrays is known to be hard. To solve this problem, we have proposed a skeletal framework on two-dimensional arrays based on the theory of constructive algorithmics. It supports users, even with little knowledge about parallel machines, to develop systematically both correct and efficient parallel programs on two-dimensional arrays. In this paper, we apply our framework to the matrix-convolutions often used in image filters and difference methods. We show the efficacy of the framework by giving a general parallel program for the matrix-convolutions described with the skeletons, and a theorem that optimizes the general program into an application-specific one.