TIMESPACE MAPPING FOR REGULAR ARRAYS
作者:
PEN-YUANG CHANG,
JONG-CHUANG TSAY,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 1996)
卷期:
Volume 10,
issue 1-2
页码: 37-48
ISSN:1063-7192
年代: 1996
DOI:10.1080/10637199608915604
出版商: Taylor & Francis Group
关键词: Equivalent transformation;regular array;regular iterative algorithm;regularization;reindexing;spacetime mapping;systolic array;timespace mapping;uniform recurrence equations
数据来源: Taylor
摘要:
A simple but powerful method, timespace mapping, for restructuring parallel algorithms and regular arrays is discussed. It combines the index vector and the time schedule of a given parallel algorithm into a new index vector, which in turn becomes the basic building block of a new and equivalent parallel algorithm. With timespace mapping, we can avoid the complex procedure of reindexing and restructure a regular array to an equivalent one.
点击下载:
PDF (167KB)
返 回