Packet-switching algorithm for SIMD computers and its application to parallel computer vision

Massimo Maresca

doi:10.1117/12.25324

1 February 1991 Packet-switching algorithm for SIMD computers and its application to parallel computer vision

Massimo Maresca

Proceedings Volume 1384, High-Speed Inspection Architectures, Barcoding, and Character Recognition; (1991) https://doi.org/10.1117/12.25324
Event: Advances in Intelligent Robotics Systems, 1990, Boston, MA, United States

Abstract

Single Instruction Multiple Data stream (SIMD) parallel computers are employed in a number of application fields such as computer vision requiring large computing power and exhibiting massive parallelism. When the data dependencies among the processes which an algorithm has been split into are known " a priori" " ad hoc" interconnection topologies give good performance. On the contrary when the algorithm graph is not known " a priori" low cornmunication overhead can be achieved by packet switching communication. This paper describes how packet switching can be done in SIMD parallel computers

Citation Download Citation

Massimo Maresca "Packet-switching algorithm for SIMD computers and its application to parallel computer vision", Proc. SPIE 1384, High-Speed Inspection Architectures, Barcoding, and Character Recognition, (1 February 1991); https://doi.org/10.1117/12.25324

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