A radar simulation program for a 1024-processor hypercube

Authors:
J. L. Gustafson;R. E. Benner;M. P. Sears;T. D. Sullivan
Affiliations:
Sandia National Laboratories, Albuquerque, NM;Sandia National Laboratories, Albuquerque, NM;Sandia National Laboratories, Albuquerque, NM;Sandia National Laboratories, Albuquerque, NM
Venue:
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Year:
1989

Citing 5
Cited 2

The cosmic cube

Communications of the ACM - Special section on computer architecture
Proceedings of the Second Conference on Hypercube Multiprocessors on Hypercube multiprocessors

Proceedings of the Second Conference on Hypercube Multiprocessors on Hypercube multiprocessors
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1

SIGARCH Third Conference on Hypercube Concurrent Computers and Applications
Modeling the interaction of light between diffuse surfaces

SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques

Massively parallel computing and the mid-course tracking problem

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Massively parallel methods for engineering and science problems

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

We have developed a fast parallel version of an existing synthetic aperture radar (SAR) simulation program, SRIM. On a 1024-processor NCUBE hypercube it runs an order of magnitude faster than on a CRAY X-MP or CRAY Y-MP processor. This speed advantage is coupled with an order of magnitude advantage in machine acquisition cost. SRIM is a somewhat large (30,000 lines of Fortran 77) program designed for uniprocessors; its restructuring for a hypercube provides new lessons in the task of altering older serial programs to run well on modern parallel architectures. We describe the techniques used for parallelization, and the performance obtained. Several novel parallel approaches to problems of task distribution, data distribution, and direct output were required. These techniques increase performance and appear to have general applicability for massive parallelism. We describe the hierarchy necessary to dynamically manage (i.e., load balance) a large ensemble. The ensemble is used in a heterogeneous manner, with different programs on different parts of the hypercube. The heterogeneous approach takes advantage of the independent instruction streams possible on MIMD machines.