Communication Problems In Parallel Algorithms

G. C. Carlsson; H. B. Sexton; M. J. Shensa; C. G. Wright

doi:10.1117/12.936446

28 November 1983 Communication Problems In Parallel Algorithms

G. C. Carlsson, H. B. Sexton, M. J. Shensa, C. G. Wright

Proceedings Volume 0431, Real-Time Signal Processing VI; (1983) https://doi.org/10.1117/12.936446
Event: 27th Annual Technical Symposium, 1983, San Diego, United States

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.

Citation Download Citation

G. C. Carlsson, H. B. Sexton, M. J. Shensa, and C. G. Wright "Communication Problems In Parallel Algorithms", Proc. SPIE 0431, Real-Time Signal Processing VI, (28 November 1983); https://doi.org/10.1117/12.936446

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