Packing/unpacking using MPI user-defined datatypes for efficient data redistribution

Sheng Wen Bai, Chu Sing Yang, Tsung Chuan Huang

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


In many parallel programs, run-time data redistribution is usually required to enhance data locality and reduce remote memory access on the distributed memory multicomputers. Research on data redistribution algorithms has recently matured. The time required to generate data sets and processor sets is much lesser than before. Therefore, packing/unpacking has become a relatively high cost in redistribution. In this paper, we present methods to perform BLOCK-CYCLIC(s) to BLOCK-CYCLIC(t) redistribution, using MPI user-defined datatypes. This method reduces the required memory buffers and avoids unnecessary movement of data. Theoretical models are presented to determine the best method for redistribution. The methods were implemented on an IBM SP2 parallel machine to evaluate the performance of the proposed methods. The experimental results indicate that this approach can clearly improve the redistribution in most cases.

Original languageEnglish
Pages (from-to)1721-1728
Number of pages8
JournalIEICE Transactions on Information and Systems
Issue number7
Publication statusPublished - 2004 Jul

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence


Dive into the research topics of 'Packing/unpacking using MPI user-defined datatypes for efficient data redistribution'. Together they form a unique fingerprint.

Cite this