矩阵计算中最优线性收缩阵列族的合成

[1988] Proceedings. International Conference on Systolic Arrays Pub Date : 1988-05-25 DOI:10.1109/ARRAYS.1988.18044

V.K.P. Kumar, Yi-Chen Tsai

{"title":"矩阵计算中最优线性收缩阵列族的合成","authors":"V.K.P. Kumar, Yi-Chen Tsai","doi":"10.1109/ARRAYS.1988.18044","DOIUrl":null,"url":null,"abstract":"A method is proposed for designing a family of linear systolic arrays for matrix-oriented problems for which two-dimensional arrays have been designed. The design exhibits a tradeoff between local storage, s, and number of processing elements, n. The arrays are linear, with each processor having storage O(s),1<or=s<or=n, for n*n matrix problems. The input matrices are fed as two-speed data streams using fast and slow channels to satisfy the dependencies in the algorithm. The technique leads to simpler designs with fewer number of processors and improved delay from input to output, compared to a previous family of linear arrays.<<ETX>>","PeriodicalId":339807,"journal":{"name":"[1988] Proceedings. International Conference on Systolic Arrays","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Synthesizing optimal family of linear systolic arrays for matrix computations\",\"authors\":\"V.K.P. Kumar, Yi-Chen Tsai\",\"doi\":\"10.1109/ARRAYS.1988.18044\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method is proposed for designing a family of linear systolic arrays for matrix-oriented problems for which two-dimensional arrays have been designed. The design exhibits a tradeoff between local storage, s, and number of processing elements, n. The arrays are linear, with each processor having storage O(s),1<or=s<or=n, for n*n matrix problems. The input matrices are fed as two-speed data streams using fast and slow channels to satisfy the dependencies in the algorithm. The technique leads to simpler designs with fewer number of processors and improved delay from input to output, compared to a previous family of linear arrays.<<ETX>>\",\"PeriodicalId\":339807,\"journal\":{\"name\":\"[1988] Proceedings. International Conference on Systolic Arrays\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. International Conference on Systolic Arrays\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARRAYS.1988.18044\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. International Conference on Systolic Arrays","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARRAYS.1988.18044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

本文提出了一种设计线性收缩阵列的方法，该方法适用于已设计二维阵列的面向矩阵问题。该设计在本地存储空间s和处理元素数量n之间进行了权衡。阵列是线性的，每个处理器具有存储空间O(s)，1>

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Synthesizing optimal family of linear systolic arrays for matrix computations

A method is proposed for designing a family of linear systolic arrays for matrix-oriented problems for which two-dimensional arrays have been designed. The design exhibits a tradeoff between local storage, s, and number of processing elements, n. The arrays are linear, with each processor having storage O(s),1>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1988] Proceedings. International Conference on Systolic Arrays

自引率

0.00%

发文量