IMPLEMENTATION OF APPLY ON A TRANSPUTER ARRAY

被引:6
|
作者
WANG, H
DEW, PM
WEBB, JA
机构
[1] UNIV OXFORD,COMP LAB,PROGRAMMING RES GRP,OXFORD OX1 3QD,ENGLAND
[2] UNIV LEEDS,SCH COMP STUDIES,LEEDS LS2 9JT,W YORKSHIRE,ENGLAND
[3] CARNEGIE MELLON UNIV,DEPT COMP SCI,PITTSBURGH,PA 15213
来源
CONCURRENCY-PRACTICE AND EXPERIENCE | 1991年 / 3卷 / 01期
关键词
D O I
10.1002/cpe.4330030104
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Apply 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 code.
引用
收藏
页码:43 / 54
页数:12
相关论文
共 50 条