Performance of a parallel bispectrum estimation code

Edward A. Carmona; Charles L. Matson

doi:10.1117/12.49835

1 December 1991 Performance of a parallel bispectrum estimation code

Edward A. Carmona, Charles L. Matson

Proceedings Volume 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II; (1991) https://doi.org/10.1117/12.49835
Event: San Diego, '91, 1991, San Diego, CA, United States

Abstract

We compare the performance of three parallel supercomputers executing a bispectrum estimation code used to remove distortions from astronomical data. We discuss the issues in parallelizing the code on an 8-processor shared-memory CRAY Y-MP and a 1024-processor distributed-memory nCUBE machine. Results show that elapsed times on the nCUBE machine are comparable to those on the CRAY Y-MP. Execution of the nCUBE was more than 40 times faster than that of a single processor CRAY-2 resulting in more than 50 times better cost performance. Cost performance on the nCUBE is more than 25 times better than an 8- processor CRAY Y-MP.

Citation Download Citation

Edward A. Carmona and Charles L. Matson "Performance of a parallel bispectrum estimation code", Proc. SPIE 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II, (1 December 1991); https://doi.org/10.1117/12.49835

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available