Layout transformation support for the disk resident arrays framework

Authors:
Sriram Krishnamoorthy;Gerald Baumgartner;Chi-Chung Lam;Jarek Nieplocha;P. Sadayappan
Affiliations:
Department of Computer Science and Engineering, The Ohio State University, Columbus, USA 43210;Department of Computer Science, Louisiana State University, Baton Rouge, USA 70810;Department of Computer Science and Engineering, The Ohio State University, Columbus, USA 43210;Computational Sciences and Mathematics, Pacific Northwest National Laboratory, Richland, USA 99352;Department of Computer Science and Engineering, The Ohio State University, Columbus, USA 43210
Venue:
The Journal of Supercomputing
Year:
2006

Citing 13
Cited 0

FFTs in external or hierarchical memory

The Journal of Supercomputing
Efficient transposition algorithms for large matrices

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Global arrays: a nonuniform memory access programming model for high-performance computers

The Journal of Supercomputing
Multidimensional array I/O in Panda 1.0

The Journal of Supercomputing
Optimizing collective I/O performance on parallel computers: a multisystem study

ICS '97 Proceedings of the 11th international conference on Supercomputing
Very high resolution simulation of compressible turbulence on the IBM-SP system

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Space-time trade-off optimization for a class of electronic structure calculations

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Global arrays: a portable "shared-memory" programming model for distributed memory computers

Proceedings of the 1994 ACM/IEEE conference on Supercomputing
An Efficient Algorithm for Out-of-Core Matrix Transposition

IEEE Transactions on Computers
Towards Automatic Synthesis of High-Performance Codes for Electronic Structure Calculations: Data Locality Optimization

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
A high-level approach to synthesis of high-performance codes for quantum chemistry

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Disk Resident Arrays: An Array-Oriented I/O Library for Out-Of-Core Computations

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Global Arrays (GA) toolkit provides a shared-memory programming model in which data locality is explicitly managed by the programmer. It inter-operates with MPI and supports a variety of language bindings. The Disk Resident Arrays (DRA) model extends the GA programming model to secondary storage. GA and DRA together provide a convenient programming model that encourages locality-aware programming by the user, while presenting a high-level abstraction. High performance depends on the appropriate distribution of the data in the disk-resident arrays. In this paper, we discuss the addition of layout transformation support to DRA. The implementation of an efficient parallel layout transformation algorithm is done on top of existing GA/DRA functions; thus GA/DRA is itself used in implementing the enhanced DRA functionality. Experimental performance data is provided that demonstrates the effectiveness of the new layout transformation functionality.