High performance Fortran for highly irregular problems
Y. Charlie Hu,S. Lennart Johnsson,Shang-Hua Teng +2 more
- 21 Jun 1997
- Vol. 32, Iss: 7, pp 13-24
TL;DR: The experimental results demonstrate that efficient data parallel (HPF) implementations of highly nonuniform problems are feasible with the proper language/compiler/runtime support and the data parallel N--body code provides a much needed "benchmark" code for evaluating and improving HPF compilers.
read more
Abstract: We present a general data parallel formulation for highly irregular problems in High Performance Fortran (HPF). Our formulation consists of(1) a method for linearizing irregular data structures (2) a data parallel implementation (in HPF) of graph partitioning algorithms applied to the linearized data structure, (3) techniques for expressing irregular communication and nonuniform computations associated with the elements of linearized data structures.We demonstrate and evaluate our formulation on a parallel, hierarchical N--body method for the evaluation of potentials and forces of nonuniform particle distributions. Our experimental results demonstrate that efficient data parallel (HPF) implementations of highly nonuniform problems are feasible with the proper language/compiler/runtime support. Our data parallel N--body code provides a much needed "benchmark" code for evaluating and improving HPF compilers.
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
Efficient large-scale access control for Internet/intranet information systems
Qi Lu,Shang-Hua Teng +1 more
- 05 Jan 1999
TL;DR: This work uses the interval tree, a popular data structure in computational geometry, to efficiently execute the access-right checking method and presents an efficient method for the access control problem in which there are a large number of users and access groups.
93
Cache-efficient matrix transposition
Siddhartha Chatterjee,Sandeep Sen +1 more
- 01 Jan 2000
TL;DR: This work investigates the memory system performance of several algorithms for transposing an N/spl times/N matrix in-place, where N is large and the relative contributions of the data cache, the translation lookaside buffer, register tiling, and the array layout function to the overall running time.
A Comparison of Locality Transformations for Irregular Codes
Hwansoo Han,Chau-Wen Tseng +1 more
TL;DR: Experimental results show GPART matches the performance of more sophisticated partitioning algorithms to with 6%-8%, with a small fraction of the overhead, making it useful for optimizing programs whose running times are not known.
57
Improving Locality for Adaptive Irregular Scientific Codes
Hwansoo Han,Chau-Wen Tseng +1 more
- 10 Aug 2000
TL;DR: A cost model is developed which can be employed to calculate an efficient optimization frequency and may be applied dynamically instrumenting the program to measure execution time per time-step iteration and shows locality optimization may be used to improve performance even for adaptive codes.
Software Support For Improving Locality in Scientific Codes
Hwansoo Han,Gabriel Rivera,Chau-Wen Tseng +2 more
- 01 Jan 2001
TL;DR: This work proposes to develop and evaluate software support for improving locality for advanced scientific applications, and investigates compiler and run-time techniques needed to achieve high performance on both sequential and parallel machines.
29
References
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
George Karypis,Vipin Kumar +1 more
TL;DR: This work presents a new coarsening heuristic (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of theSize of the final partition obtained after multilevel refinement, and presents a much faster variation of the Kernighan--Lin (KL) algorithm for refining during uncoarsening.
A hierarchical O(N log N) force-calculation algorithm
Josh Barnes,Piet Hut +1 more
TL;DR: A novel method of directly calculating the force on N bodies that grows only as N log N is described, using a tree-structured hierarchical subdivision of space into cubic cells, each is recursively divided into eight subcells whenever more than one particle is found to occupy the same cell.
4.2K
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.
A Multi-Level Algorithm For Partitioning Graphs
Bruce Hendrickson,Robert W. Leland +1 more
- 08 Dec 1995
TL;DR: A multilevel algorithm for graph partitioning in which the graph is approximated by a sequence of increasingly smaller graphs, and the smallest graph is then partitioned using a spectral method, and this partition is propagated back through the hierarchy of graphs.
1.2K
•Book
The Rapid Evaluation of Potential Fields in Particle Systems
Leslie Greengard
- 07 Apr 1988
TL;DR: In this paper, an algorithm for the rapid evaluation of the potential and force fields in large-scale ensembles of particles is presented, which requires an amount of work proportional to the number of particles.
1.2K