Translator Disclaimer
Paper
1 February 1991 Packet-switching algorithm for SIMD computers and its application to parallel computer vision
Author Affiliations +
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
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

CS-BoW: a scalable parallel image recognition method
Proceedings of SPIE (March 17 2017)
Intelligent word-based text recognition
Proceedings of SPIE (February 01 1991)
High-speed thinning algorithm for character recognition
Proceedings of SPIE (July 31 2002)
Mathematical formula recognition using graph grammar
Proceedings of SPIE (April 01 1998)
Real-time optical-flow range estimation on the iWarp
Proceedings of SPIE (March 11 1993)
NOSC Advanced Systolic Array Processor (ASAP)
Proceedings of SPIE (November 25 1987)

Back to Top