article · 1997
High Performance Fortran for Highly Irregular Problems
Charlie Hu, Y. Charlie, Hu S. Lennart, Johnsson Shang--hua Teng
Cited by 0Abstract and details only
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. 1 Introduction Data parallel programming provides an effective way to write ...
Cite this paper
Hu, C., Charlie, Y., Lennart, H. S., & Teng, J. S.-H. (1997). High Performance Fortran for Highly Irregular Problems.
Hu, Charlie, et al. “High Performance Fortran for Highly Irregular Problems.” 1997.
Hu, Charlie, Y. Charlie, Hu S. Lennart, and Johnsson Shang--hua Teng. 1997. “High Performance Fortran for Highly Irregular Problems.”
Hu, C. et al. (1997) ‘High Performance Fortran for Highly Irregular Problems’.
@article{hu1997high,
title = {{High Performance Fortran for Highly Irregular Problems}},
author = {Hu, Charlie and Charlie, Y. and Lennart, Hu S. and Teng, Johnsson Shang--hua},
year = {1997}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.