The fast fourier transform and sparse matrix computations: a study of two applications on teh HORIZON supercomputer

Authors:
D. A. Carlson;J. M. Conroy
Affiliations:
Supercomputing Research Center, Institute for Defense Analyses, 4380 Forbes Boulevard, Lanham, MD;Supercomputing Research Center, Institute for Defense Analyses, 4380 Forbes Boulevard, Lanham, MD
Venue:
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Year:
1988

Citing 6
Cited 1

The fast Fourier transform and its applications

The fast Fourier transform and its applications
The horizon supercomputing system: architecture and software

Proceedings of the 1988 ACM/IEEE conference on Supercomputing
A processor architecture for horizon

Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Analysis of a 3D toroidal network for a shared memory architecture

Proceedings of the 1988 ACM/IEEE conference on Supercomputing
An Adaptation of the Fast Fourier Transform for Parallel Processing

Journal of the ACM (JACM)
Parallel Solution of Arbitrarily Sparse Linear Systems

Parallel Solution of Arbitrarily Sparse Linear Systems

The horizon supercomputing system: architecture and software

Proceedings of the 1988 ACM/IEEE conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

As part of the HORIZON project currently underway at the Supercomputing Research Center, a set of application programs are being written and their performance is being evaluated. This paper discusses two of these applications: the fast Fourier transform and sparse matrix computations. For both problems, we develop efficient implementations that take advantage of HORIZON's many unique features, including fined-grained synchronization, multiple instruction streams, and a horizontal instruction set. Our results indicate that HORIZON will offer very high performance, sometimes in excess of a sustained rate of one floating point operation per tick.