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

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.© (1990) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

This publication has 0 references indexed in Scilit: