Neighborhood Access Problem In Image Parallel Machines

Per-Erik Danielsson

doi:10.1117/12.965953

17 March 1983 Neighborhood Access Problem In Image Parallel Machines

Per-Erik Danielsson

Proceedings Volume 0359, Applications of Digital Image Processing IV; (1983) https://doi.org/10.1117/12.965953
Event: 26th Annual Technical Symposium, 1982, San Diego, United States

Abstract

Image parallelism implies a SIMD-architecture where a two-dimensional array of processors and memory modules are controlled by a central master control unit. It is emphasized that effective access of artribrarily sized neighborhoods (which is everso common in image processors) are distributed over the image plane. The access and interconnection problem for such an architecture is shown to have several possible solutions with different trade-offs. No existing design presents good solutions of the neighborhood access problem. It is shown that a proper design in this respect results in a 13-fold increase in speed compared to what has recently been reported for the MPP.

Citation Download Citation

Per-Erik Danielsson "Neighborhood Access Problem In Image Parallel Machines", Proc. SPIE 0359, Applications of Digital Image Processing IV, (17 March 1983); https://doi.org/10.1117/12.965953

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