The Journal of Supercomputing

, Volume 46, Issue 3, pp 213–236

Mapping functions and data redistribution for parallel files

Article

DOI: 10.1007/s11227-007-0165-x

Cite this article as:
Isaila, F. & Tichy, W.F. J Supercomput (2008) 46: 213. doi:10.1007/s11227-007-0165-x
  • 22 Downloads

Abstract

Data distribution in memory or on disks is an important factor influencing the performance of parallel applications. On the other hand, programs or systems, like a parallel file system, frequently redistribute data between memory and disks.

This paper presents a generalization of previous approaches of the redistribution problem. We introduce algorithms for mapping between two arbitrary distributions of a data set. The algorithms are optimized for multidimensional array partitions. We motivate our approach and present potential utilizations. The paper also presents a case study, the employment of mapping functions, and redistribution algorithms in a parallel file system.

Keywords

Parallel file systems Parallel I/O Noncontiguous I/O Multi-dimensional array redistribution Mapping functions 

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Departement of Computer ScienceUniversity Carlos IIIMadridSpain
  2. 2.Department of Computer ScienceUniversity of KarlsruheKarlsruheGermany