Implementation of Apply on a transputer array
作者:
Han Wang,
Peter M. Dew,
Jon A. Webb,
期刊:
Concurrency: Practice and Experience
(WILEY Available online 1991)
卷期:
Volume 3,
issue 1
页码: 43-54
ISSN:1040-3108
年代: 1991
DOI:10.1002/cpe.4330030104
出版商: John Wiley&Sons, Ltd
数据来源: WILEY
摘要:
AbstractApply is a machine‐independent, low‐level image processing language for expressing local window operations. It has two main advantages: (1) it significantly reduces the programming effort, and (2) it can be mapped onto a wide range of parallel computers. In this paper we report our recent experience on implementing Apply on a Meiko Computing Surface (transputer array machine) using a farmer/gather model. The performance of the Meiko implementation on a number of edge detection algorithms including the popular Canny operator is analysed. Results suggest that the performance of Apply generated code represents peak performance and it is likely to be as efficient as hand‐written
点击下载:
PDF
(711KB)
返 回