High Performance Fortran for Highly Irregular Problems
1997 (English)Conference paper (Refereed)
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 ...
Place, publisher, year, edition, pages
1997. 13-24 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-63849OAI: oai:DiVA.org:kth-63849DiVA: diva2:482839
In Proceedings of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
NR 201408052012-01-242012-01-24Bibliographically approved