Efficient layout transformation for disk-based multidimensional arrays

  • Authors:

  • Sriram Krishnamoorthy;Gerald Baumgartner;Chi-Chung Lam;Jarek Nieplocha;P. Sadayappan

  • Affiliations:

  • Department of Computer Science and Engineering, The Ohio State University, Columbus, OH;Department of Computer Science, Louisiana State University, Baton Rouge, LA;Department of Computer Science and Engineering, The Ohio State University, Columbus, OH;Pacific Northwest National Laboratory, Computational Sciences and Mathematics, Richland, WA;Department of Computer Science and Engineering, The Ohio State University, Columbus, OH

  • Venue:
  • HiPC'04 Proceedings of the 11th international conference on High Performance Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

I/O libraries such as PANDA and DRA use blocked layouts for efficient access to disk-resident multi-dimensional arrays, with the shape of the blocks being chosen to match the expected access pattern of the array Sometimes, different applications, or different phases of the same application, have very different access patterns for an array In such situations, an array's blocked layout representation must be transformed for efficient access In this paper, we describe a new approach to solve the layout transformation problem and demonstrate its effectiveness in the context of the Disk Resident Arrays (DRA) library The approach handles re-blocking and permutation of dimensions Results are provided that demonstrate the performance benefit as compared to currently available mechanisms.