An approach to communication-efficient data redistribution

Authors:
S. D. Kaushik;C.-H. Huang;R. W. Johnson;P. Sadayappan
Affiliations:
Department of Computer and Information Science, The Ohio State University, Columbus, OH;Department of Computer and Information Science, The Ohio State University, Columbus, OH;Department of Computer Science, St. Cloud State University, St. Cloud, MN;Department of Computer and Information Science, The Ohio State University, Columbus, OH
Venue:
ICS '94 Proceedings of the 8th international conference on Supercomputing
Year:
1994

Citing 14
Cited 22

Topics in matrix analysis

Topics in matrix analysis
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Compiler optimizations for Fortran D on MIMD distributed-memory machines

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Compile-time generation of regular communications patterns

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Vienna Fortran—a Fortran language extension for distributed memory multiprocessors

Languages, compilers and run-time environments for distributed memory machines
Computer support for machine-independent parallel programming in Fortran D

Languages, compilers and run-time environments for distributed memory machines
Generating local addresses and communication sets for data-parallel programs

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Implementing a parallel C++ runtime system for scalable parallel systems

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Compiling Communication-Efficient Programs for Massively Parallel Machines

IEEE Transactions on Parallel and Distributed Systems
Compile-Time Estimation of Communication Costs on Multicomputers

IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
On-Line Communication on Circuit-Switched Fixed Routing Meshes

IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Efficient Compilation of Array Statements for Private Memory Multicomputers

Efficient Compilation of Array Statements for Private Memory Multicomputers
A methodology for generating data distributions to optimize communication

SPDP '92 Proceedings of the 1992 Fourth IEEE Symposium on Parallel and Distributed Processing

Processor Mapping Techniques Toward Efficient Data Redistribution

IEEE Transactions on Parallel and Distributed Systems
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution

IEEE Transactions on Parallel and Distributed Systems
Efficient Methods for kr → r and r → kr Array Redistribution1

The Journal of Supercomputing
Efficient Algorithms for Block-Cyclic Array Redistribution Between Processor Sets

IEEE Transactions on Parallel and Distributed Systems
Efficient Methods for Multi-Dimensional Array Redistribution

The Journal of Supercomputing
A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution

IEEE Transactions on Parallel and Distributed Systems
A compilation method for communication—efficient partitioning of DOALL loops

Compiler optimizations for scalable parallel systems
Automatic Compilation of Loops to Exploit Operator Parallelism on Configurable Arithmetic Logic Units

IEEE Transactions on Parallel and Distributed Systems
A framework for performance-based program partitioning

Progress in computer research
A Generalized Processor Mapping Technique for Array Redistribution

IEEE Transactions on Parallel and Distributed Systems
Efficient algorithms for block-cyclic array redistribution between processor sets

SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
A framework for performance-based program partitioning

Progress in computer research
A Framework for Efficient Data Redistribution on Distributed Memory Multicomputers

The Journal of Supercomputing
Efficient Algorithms for Array Redistribution

IEEE Transactions on Parallel and Distributed Systems
Generating communication sets of array assignment statements for block-cyclic distribution on distributed memory parallel computers

Parallel Computing
Automatic Analysis of Loops to Exploit Operator Parallelism on Reconfigurable Systems

LCPC '98 Proceedings of the 11th International Workshop on Languages and Compilers for Parallel Computing
A pipeline technique for dynamic data transfer on a multiprocessor grid

International Journal of Parallel Programming
Memory efficient parallel matrix multiplication operation for irregular problems

Proceedings of the 3rd conference on Computing frontiers
An Efficient Communication Scheduling Method for the Processor Mapping Technique Applied Data Redistribution

The Journal of Supercomputing
A flexible processor mapping technique toward data localization for block-cyclic data redistribution

The Journal of Supercomputing
A message passing strategy for array redistributions in a torus network

The Journal of Supercomputing
Efficient multidimensional data redistribution for resizable parallel computations

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the development of efficient methods for performing data redistribution of arrays on distributed-memory machines. Data redistribution is important for the distributed-memory implementation of data parallel languages such as High Performance Fortran. An algebraic representation of regular data distributions is used to develop an analytical model for evaluating the communication cost of data redistribution. Using this algebraic representation and the analytical model, an approach to communication-efficient data redistribution is developed. Implementation results on the Intel iPSC/860 are reported.