An efficient algorithm for computing communication sets for data parallel programs with block-cyclic distribution

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present an 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 solution to the same problem. Another important contribution of the 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.

Original languageEnglish
Title of host publicationProceedings - International Conference on Parallel Processing Workshops, ICPPW 2002
EditorsStephan Olariu
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages623-631
Number of pages9
ISBN (Electronic)0769516807
DOIs
Publication statusPublished - 2002 Jan 1
EventInternational Conference on Parallel Processing Workshops, ICPPW 2002 - Vancouver, Canada
Duration: 2002 Aug 182002 Aug 21

Publication series

NameProceedings of the International Conference on Parallel Processing Workshops
Volume2002-January
ISSN (Print)1530-2016

Other

OtherInternational Conference on Parallel Processing Workshops, ICPPW 2002
CountryCanada
CityVancouver
Period02/8/1802/8/21

    Fingerprint

Keywords

  • Block-Cyclic Distributions
  • Data Parallel Programs
  • Distributed Memory Machines
  • HPF Compiler
  • Parallelizing Compiler

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Hwang, G-H. (2002). An efficient algorithm for computing communication sets for data parallel programs with block-cyclic distribution. In S. Olariu (Ed.), Proceedings - International Conference on Parallel Processing Workshops, ICPPW 2002 (pp. 623-631). [1039785] (Proceedings of the International Conference on Parallel Processing Workshops; Vol. 2002-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPPW.2002.1039785