An efficient algorithm for communication set generation of data parallel programs with block-cyclic distribution

研究成果: 雜誌貢獻文章同行評審

4 引文 斯高帕斯(Scopus)

摘要

Data parallel programming languages, such as High Performance Fortran, are widely regarded as a promising means for writing portable programs for distributed-memory machines. In this paper, we present a new algorithm for computing the communication sets in array section movements with block-cyclic (cyclic (k) in HPF) distribution. Our framework can handle multi-level alignments, multi-dimensional arrays, array intrinsic functions, affine indices and axis exchanges in the array subscript. Instead of employing the linear diophantine equation solver, a new algorithm which does not rely on the linear diophantine equation solver to calculate communication sets is proposed. We use formal proof and experimental results to show that it is more efficient than previous solutions to the same problem. Another important contribution of this paper is that we prove that the compiler is able to compute efficiently the communication sets of block-cyclic distribution as long as the block sizes of the arrays are set to be identical or the lowest common multiple (LCM) of block sizes is not a huge integer. We demonstrate it by thorough complexity analyses and extensive experimental results.

原文英語
頁(從 - 到)473-501
頁數29
期刊Parallel Computing
30
發行號4
DOIs
出版狀態已發佈 - 2004 四月 1

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence

指紋 深入研究「An efficient algorithm for communication set generation of data parallel programs with block-cyclic distribution」主題。共同形成了獨特的指紋。

引用此