Share Email Print

Proceedings Paper

Attempt to solve memory access conflict problem in multiprocessor environment multiFunction distributed shared-memory architecture
Author(s): Min Gong
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Tasks in Machine Vision are highly computation intensive. It will take a very long time to process these tasks with conventional computers. Tightly coupled shared memory multiprocessor systems are very suitable for those tasks. However, memory access conflicts raise a serious problem in Shared Memory Multiprocessor Systems. It limits the system size and reduces the system performance. This paper will describe a Multifunction Distributed Shared Memory architecture, which makes it possible to reduce memory access conflicts to minimum and increase equivalent bandwidth of the memory system up to N times (N stands for the number of MFDSM segments mapped into the same system address). Only critical resources have to be accessed mutual exclusively. A classical correlation image matching problem is taken as an example to describe the principle and to analyze the performance of MFDSM. A software simulation package is introduced and simulation results are given.

Paper Details

Date Published: 1 March 1992
PDF: 8 pages
Proc. SPIE 1615, Machine Vision Architectures, Integration, and Applications, (1 March 1992); doi: 10.1117/12.58811
Show Author Affiliations
Min Gong, Helsinki Univ. of Technology (Finland)

Published in SPIE Proceedings Vol. 1615:
Machine Vision Architectures, Integration, and Applications
Bruce G. Batchelor; Michael J. W. Chen; Frederick M. Waltz, Editor(s)

© SPIE. Terms of Use
Back to Top