An approach for increasing the flexibility of systolic arrays

A. Barbir, J. Aravena
{"title":"An approach for increasing the flexibility of systolic arrays","authors":"A. Barbir, J. Aravena","doi":"10.1109/SSST.1990.138200","DOIUrl":null,"url":null,"abstract":"A study is made of the operations of systolic arrays. A graph is developed to present array operation as a function of the compute cycle. A description is given of a computational procedure to determine such a graph. The graph representation is used to analyze the operation of an array and to detect special cases with reduced computational complexity. A matrix-vector multiplication array is used as a case study. Manipulation of the graph representation is used to determine sparsity patterns in the input data matrices. The resulting forms generate matrix products computable in reduced time.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.1990.138200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A study is made of the operations of systolic arrays. A graph is developed to present array operation as a function of the compute cycle. A description is given of a computational procedure to determine such a graph. The graph representation is used to analyze the operation of an array and to detect special cases with reduced computational complexity. A matrix-vector multiplication array is used as a case study. Manipulation of the graph representation is used to determine sparsity patterns in the input data matrices. The resulting forms generate matrix products computable in reduced time.<>
一种增加收缩阵列灵活性的方法
研究了收缩阵列的操作。开发了一个图来表示数组操作作为计算周期的函数。给出了确定这种图的计算过程的描述。图表示用于分析数组的操作,并在降低计算复杂度的情况下检测特殊情况。一个矩阵-向量乘法数组被用作一个案例研究。图形表示的操作用于确定输入数据矩阵中的稀疏模式。所得到的形式产生的矩阵乘积可在缩短的时间内计算
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信