Supporting irregular distributions using data-parallel languages
TL;DR: Languages such as Fortran D provide irregular distribution schemes that can efficiently support irregular problems and compilers can incorporate runtime procedures to automatically support these distributions.
read more
Abstract: Languages such as Fortran D provide irregular distribution schemes that can efficiently support irregular problems Irregular distributions can also be emulated in HPF Compilers can incorporate runtime procedures to automatically support these distributions >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Approaches for integrating task and data parallelism
Henri E. Bal,Matthew Haines +1 more
TL;DR: Four programming systems that attempt to cleanly integrate the two forms of parallelism in a programming model are described: Fx, Opus, data-parallel Orca, and Braid.
121
Parallelizing molecular dynamics programs for distributed-memory machines
Ynan-Shin Hwang,Raja Das,Joel H. Saltz,M. Hodoscek,B.R. Brooks +4 more
- 01 Jun 1995
TL;DR: An application of CHAOS is presented that can be used to support efficient execution of irregular problems on distributed memory machines and reveals that taking computational load into account is essential.
67
Runtime support and compilation methods for user-specified irregular data distributions
TL;DR: Two new ideas by which a High Performance Fortran compiler can deal with irregular computations effectively are described and performance results for these mechanisms from a Fortran 90D compiler implementation are presented.
Portable and scalable algorithms for irregular all-to-all communication
Wenheng Liu,Cho-Li Wang,Viktor K. Prasanna +2 more
- 27 May 1996
TL;DR: In this paper, the authors developed portable and scalable algorithms for performing irregular all-to-all communication in high performance computing (HPC) systems, which can reduce the total number of messages transmitted, reduce the variance of the length of these messages, and overlap the communication with computation.
Portable and scalable algorithm for irregular all-to-all communication
TL;DR: The proposed algorithm reduces the total number of message start-ups and reduces node contention by smoothing out the lengths of the messages communicated and provides deterministic performance and also reduces the buffer space at the nodes during message passing.
19
References
CHARMM: A program for macromolecular energy, minimization, and dynamics calculations
Bernard R. Brooks,Robert E. Bruccoleri,Barry D. Olafson,David J. States,S. Swaminathan,Martin Karplus +5 more
TL;DR: The CHARMM (Chemistry at Harvard Macromolecular Mechanics) as discussed by the authors is a computer program that uses empirical energy functions to model macromolescular systems, and it can read or model build structures, energy minimize them by first- or second-derivative techniques, perform a normal mode or molecular dynamics simulation, and analyze the structural, equilibrium, and dynamic properties determined in these calculations.
15.5K
Partitioning sparse matrices with eigenvectors of graphs
TL;DR: In this paper, it is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph.
•Book
Supercompilers for parallel and vector computers
Hans P. Zima,Barbara Chapman +1 more
- 01 Jan 1990
TL;DR: This paper presents a meta-modelling architecture for supercompilers that automates the very labor-intensive and therefore time-heavy and expensive process of learning and optimization of supercomputing systems.
778
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
TL;DR: This work uses a binary decomposition of the domain to partition it into rectangles requiring equal computational effort, and studies the communication costs of mapping this partitioning onto different multiprocessors: a mesh- connected array, a tree machine, and a hypercube.
Programming in Vienna Fortran
TL;DR: This paper presents the language features of Vienna Fortran for FORTRAN 77, together with examples illustrating the use of these features and discusses the advantages of a shared memory programming paradigm while explicitly controlling the data distribution.