Share Email Print

Proceedings Paper

Communication Problems In Parallel Algorithms
Author(s): G. C. Carlsson; H. B. Sexton; M. J. Shensa; C. G. Wright
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We discuss the relationship between communication constraints for families of processor arrays and the time complexity of problem solution for sorting and matrix multiplication. We then describe what seems a promising family of arrays for achieving near optimal time complexity for these and other problems.

Paper Details

Date Published: 28 November 1983
PDF: 6 pages
Proc. SPIE 0431, Real-Time Signal Processing VI, (28 November 1983); doi: 10.1117/12.936446
Show Author Affiliations
G. C. Carlsson, UCSD (United States)
H. B. Sexton, Naval Ocean Systems Center (United States)
M. J. Shensa, Naval Ocean Systems Center (United States)
C. G. Wright, Duke University (United States)

Published in SPIE Proceedings Vol. 0431:
Real-Time Signal Processing VI
Keith Bromley, Editor(s)

© SPIE. Terms of Use
Back to Top