Using integer sets for data-parallel program analysis and optimization

V Adve, J Mellor-Crummey - Proceedings of the ACM SIGPLAN 1998 …, 1998 - dl.acm.org
In this paper, we describe our experience with using an abstract integer-set framework to
develop the Rice dHPF compiler, a compiler for High Performance Fortran. We present …

Algorithmic redistribution methods for block-cyclic decompositions

AP Petitet, JJ Dongarra - IEEE Transactions on Parallel and …, 1999 - ieeexplore.ieee.org
This article presents various data redistribution methods for block-partitioned linear algebra
algorithms operating on dense matrices that are distributed in a block-cyclic fashion …

Generating local addresses and communication sets for data-parallel programs

S Chatterjee, JR Gilbert, FJE Long, R Schreiber… - ACM SIGPLAN …, 1993 - dl.acm.org
Generating local addresses and communication sets is an important issue in distributed-
memory implementations of data-parallel languages such as High Performance Fortran. We …

Generating local addresses and communication sets for data-parallel programs

S Chatterjee, JR Gilbert, FJE Long, R Schreiber… - Journal of Parallel and …, 1995 - Elsevier
Generating local addresses and communication sets is an important issue in distributed-
memory implementations of data-parallel languages such as High Performance Fortran. We …

Opus: A coordination language for multidisciplinary applications

B Chapman, M Haines, P Mehrotra… - Scientific …, 1997 - Wiley Online Library
Data parallel languages, such as High Performance Fortran, can be successfully applied to
a wide range of numerical applications. However, many advanced scientific and …

Deinsum: Practically I/O optimal multi-linear algebra

AN Ziogas, G Kwasniewski, T Ben-Nun… - … Conference for High …, 2022 - ieeexplore.ieee.org
Multilinear algebra kernel performance on modern massively-parallel systems is determined
mainly by data movement. However, deriving data movement-optimal distributed schedules …

A linear-time algorithm for computing the memory access sequence in data-parallel programs

K Kennedy, N Nedeljkovic, A Sethi - ACM SIGPLAN Notices, 1995 - dl.acm.org
Data-parallel languages, such as High Performance Fortran, are widely regarded as a
promising means for writing portable programs for distributed-memory machines. Novel …

[PDF][PDF] Efficient address generation for block-cyclic distributions

K Kennedy, N Nedeljkovic, A Sethi - Proceedings of the 9th International …, 1995 - dl.acm.org
Advanced features of modern data-parallel languages, such as High Performance Fortran,
require new techniques in compilers and run-time systems. We present efficient methods for …

[图书][B] A relational approach to the automatic generation of sequential sparse matrix codes

PV Stodghill - 1997 - search.proquest.com
This thesis presents techniques for automatically generating sparse codes from dense
matrix algorithms through a process called sparse compilation. We will start by recognizing …

Compiling parallel sparse code for user-defined data structures

V Kotlyar, K Pingali, P Stodghill - 1997 - ecommons.cornell.edu
We describe how various sparse matrix and distribution formats can be handled using the
{\em relational} approach to sparse matrix code compilation. This approach allows for the …