矩阵-向量乘法的一组双向收缩数组

Modern Problems of Radio Engineering, Telecommunications and Computer Science (IEEE Cat. No.02EX542) Pub Date : 2002-08-07 DOI:10.1109/TCSET.2002.1015869

I. Milovanovic, E. Milovanovic, T. Tokic, N. Stojanovic, M. Stojcev

{"title":"矩阵-向量乘法的一组双向收缩数组","authors":"I. Milovanovic, E. Milovanovic, T. Tokic, N. Stojanovic, M. Stojcev","doi":"10.1109/TCSET.2002.1015869","DOIUrl":null,"url":null,"abstract":"In this paper we derive exact formulas for synthesis of the family of bidirectional linear systolic arrays (BLSA) for matrix-vector multiplication. According to these formulas, optimal arrays with respect to the number of processing elements for a given problem size, execution time and AT measure are identified.","PeriodicalId":370891,"journal":{"name":"Modern Problems of Radio Engineering, Telecommunications and Computer Science (IEEE Cat. No.02EX542)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A family of bidirectional systolic arrays for matrix-vector multiplication\",\"authors\":\"I. Milovanovic, E. Milovanovic, T. Tokic, N. Stojanovic, M. Stojcev\",\"doi\":\"10.1109/TCSET.2002.1015869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we derive exact formulas for synthesis of the family of bidirectional linear systolic arrays (BLSA) for matrix-vector multiplication. According to these formulas, optimal arrays with respect to the number of processing elements for a given problem size, execution time and AT measure are identified.\",\"PeriodicalId\":370891,\"journal\":{\"name\":\"Modern Problems of Radio Engineering, Telecommunications and Computer Science (IEEE Cat. No.02EX542)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Modern Problems of Radio Engineering, Telecommunications and Computer Science (IEEE Cat. No.02EX542)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TCSET.2002.1015869\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Modern Problems of Radio Engineering, Telecommunications and Computer Science (IEEE Cat. No.02EX542)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TCSET.2002.1015869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文导出了用于矩阵-向量乘法的双向线性收缩阵列族的精确合成公式。根据这些公式，针对给定的问题大小、执行时间和AT度量，确定了与处理元素数量有关的最优数组。

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

查看原文本刊更多论文

A family of bidirectional systolic arrays for matrix-vector multiplication

In this paper we derive exact formulas for synthesis of the family of bidirectional linear systolic arrays (BLSA) for matrix-vector multiplication. According to these formulas, optimal arrays with respect to the number of processing elements for a given problem size, execution time and AT measure are identified.

求助全文

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

来源期刊

Modern Problems of Radio Engineering, Telecommunications and Computer Science (IEEE Cat. No.02EX542)

自引率

0.00%

发文量