版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:University of Nis̆ Faculty of Electronic Engineering P.O. Box 73 Beogradska 14 18000 Nis̆ Serbia
出 版 物:《COMPUTERS & MATHEMATICS WITH APPLICATIONS》 (Comput Math Appl)
年 卷 期:1997年第33卷第6期
页 面:17-35页
核心收录:
学科分类:08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
主 题:matrix multiplication data dependency systolic arrays mapping
摘 要:The objective of this paper is to provide a systematic methodology for the design of space-time optimal pure planar systolic arrays for matrix multiplication. The procedure is based on data dependence approach. By the described procedure, we obtain ten different systolic arrays denoted as S-1 to S-10 classified into three classes according to interconnection patterns between the processing elements. Common properties of all systolic array designs are: each systolic array consists of n(2) processing elements, near-neighbour communications, and active execution time of 3n - 2 time units. Compared to designs found in the literature, our procedure always leads to systolic arrays with optimal number of processing elements. The improvement in space domain is not achieved at the cost of execution time or PEs complexity. We present mathematically- rigorous procedure which gives the exact ordering of input matrix elements at the beginning of the computation. Examples illustrating the methodology are shown.