The eciency of HPF with respect to irregular applications is still largely unproven. While recent work has shown that a highly irregular hierarchical n-body force calculation method can be implemented in HPF, we have found that the implmentation contains ine- ciencies which cause it to run up to a

Abstract The efficiency of HPF with respect to irregular applications is still largely unproven. While recent work has shown that a highly irregular hierarchical n-body force calculation method can be implemented in HPF, we have found that the implmentation contains inefficiencies which cause

, file transfer rates, and processing performance. The evaluation includes a computational fluid dynamics code and an N-body gravitational simulation program. It is shown that the Beowulf architecture provides a new operating point in performance to cost for high performance workstations, especially

This paper describes our experiences developing high-performance code for astrophysical N-body simulations. Recent N-body methods are based on an adaptive tree structure. The tree must be built and maintained across physically distributed memory; moreover, the communication requirements

N-body simulations pose load balancing problems mainly due to the irregularity of the distribution of particles and to the different processing requirements of particles in the interior and of those near the boundary of the computation space. In the past, most of the methods to overcome performance

Computer architects must determine how to most effectively use finite computational resources when running simulations to evaluate new architectural ideas. To facilitate efficient simulations with a range of benchmark programs, we have developed the MinneSPEC input set for the SPEC CPU 2000

This report describes the implementation of Water, an N-body simulation program that runs on a distributed architecture. It is ported from a shared memory implementation. The program is written in C and runs on a pool of idle workstations under the Amoeba distributed operating system. The results

This dissertation studies issues critical to efficient N-body simulations on parallel computers. The N-body problem poses several challenges for distributed-memory implementation: adaptive distributed data structures, irregular data access patterns, and irregular and adaptive communication patterns

Abstract. N-Body simulation algorithms are amongst the most commonly used within the field of scientific computing. Especially in computational astrophysics, they are used to simulate gravitational scenarios for solar systems or galactic collisions. Parallel versions of such N-Body algorithms have

The grid paradigm for distributed computation provides an interesting framework for the simulation of dense stellar systems, which remains a great challenge for astrophysicists. In this work we apply a distributed simulation model to the astrophysical N-body problem: the High Level Architecture