A Benchmark Of Two Parallel Computers: Experiments With Three Machine Vision Problems

Tapio Seppanen; Vesa Vuohtoniemi; Matti Pietikainen

doi:10.1117/12.969831

1 March 1990 A Benchmark Of Two Parallel Computers: Experiments With Three Machine Vision Problems

Tapio Seppanen, Vesa Vuohtoniemi, Matti Pietikainen

Proceedings Volume 1193, Intelligent Robots and Computer Vision VIII: Systems and Applications; (1990) https://doi.org/10.1117/12.969831
Event: 1989 Symposium on Visual Communications, Image Processing, and Intelligent Robotics Systems, 1989, Philadelphia, PA, United States

Abstract

A benchmark was carried out to explore the differences in the speed-up behavior of two multiprocessors, a shared memory computer (Butterfly Parallel Processor, BPP) and a distributed memory computer (HATHI-2). Three vision problems were used in the tests: an algorithm for border tracking, a generalized Hough transform and a matching of attributed relational graphs. The results indicate that the HATHI-2 outperforms the BPP if the parallel program does not contain very intensive communication bursts.

Citation Download Citation

Tapio Seppanen, Vesa Vuohtoniemi, and Matti Pietikainen "A Benchmark Of Two Parallel Computers: Experiments With Three Machine Vision Problems", Proc. SPIE 1193, Intelligent Robots and Computer Vision VIII: Systems and Applications, (1 March 1990); https://doi.org/10.1117/12.969831

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