六边形收缩阵列AT/sup 2/ measure优化

E. Milovanovic, N. Stojanovic, I. Milovanovic, T. Tokic, M. Stojcev
{"title":"六边形收缩阵列AT/sup 2/ measure优化","authors":"E. Milovanovic, N. Stojanovic, I. Milovanovic, T. Tokic, M. Stojcev","doi":"10.1109/MIEL.2002.1003336","DOIUrl":null,"url":null,"abstract":"The major features of adopting systolic arrays (SA) for special purpose processing architectures are: simple and regular design, concurrency in communications, and balancing computation with the I/O. In this paper we synthesize a family of hexagonal arrays, SA(r), that implement matrix multiplication. We have observed that the execution time of a hexagonal array, which has a minimal number of processing elements (PE) for a given problem size, can be reduced if the number of PEs is increased. Since the execution time and the number of PEs are the two most important performance measures of the systolic array, we take their product AT/sup 2/, AT/sup 2/=/spl Omega//sub r/(n)T/sub exe//sup 2/, to compare the arrays from this family. With respect to this performance measure, the best array is obtained for r=[n/2], where n is a dimension of square matrices while r indicates the extension, in terms of rows, of the array that has minimal number of processing elements for a given problem size.","PeriodicalId":221518,"journal":{"name":"2002 23rd International Conference on Microelectronics. Proceedings (Cat. No.02TH8595)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimizing AT/sup 2/ measure of hexagonal systolic arrays\",\"authors\":\"E. Milovanovic, N. Stojanovic, I. Milovanovic, T. Tokic, M. Stojcev\",\"doi\":\"10.1109/MIEL.2002.1003336\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The major features of adopting systolic arrays (SA) for special purpose processing architectures are: simple and regular design, concurrency in communications, and balancing computation with the I/O. In this paper we synthesize a family of hexagonal arrays, SA(r), that implement matrix multiplication. We have observed that the execution time of a hexagonal array, which has a minimal number of processing elements (PE) for a given problem size, can be reduced if the number of PEs is increased. Since the execution time and the number of PEs are the two most important performance measures of the systolic array, we take their product AT/sup 2/, AT/sup 2/=/spl Omega//sub r/(n)T/sub exe//sup 2/, to compare the arrays from this family. With respect to this performance measure, the best array is obtained for r=[n/2], where n is a dimension of square matrices while r indicates the extension, in terms of rows, of the array that has minimal number of processing elements for a given problem size.\",\"PeriodicalId\":221518,\"journal\":{\"name\":\"2002 23rd International Conference on Microelectronics. Proceedings (Cat. No.02TH8595)\",\"volume\":\"17 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\":\"2002 23rd International Conference on Microelectronics. Proceedings (Cat. No.02TH8595)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MIEL.2002.1003336\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 23rd International Conference on Microelectronics. Proceedings (Cat. No.02TH8595)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MIEL.2002.1003336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在特殊用途的处理体系结构中采用收缩数组(SA)的主要特点是:设计简单而规则、通信并发性和I/O计算平衡。本文合成了一类实现矩阵乘法的六边形数组SA(r)。我们观察到,对于给定的问题大小,六边形数组具有最小数量的处理元素(PE),如果PE的数量增加,则可以减少六边形数组的执行时间。由于执行时间和pe的数量是收缩阵列的两个最重要的性能指标,我们取它们的乘积AT/sup 2/, AT/sup 2/=/spl Omega//sub r/(n)T/sub exe//sup 2/,来比较这个家族的阵列。对于这种性能度量,当r=[n/2]时获得最佳数组,其中n是方阵的一个维数,而r表示对于给定的问题大小具有最小处理元素数量的数组的行数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimizing AT/sup 2/ measure of hexagonal systolic arrays
The major features of adopting systolic arrays (SA) for special purpose processing architectures are: simple and regular design, concurrency in communications, and balancing computation with the I/O. In this paper we synthesize a family of hexagonal arrays, SA(r), that implement matrix multiplication. We have observed that the execution time of a hexagonal array, which has a minimal number of processing elements (PE) for a given problem size, can be reduced if the number of PEs is increased. Since the execution time and the number of PEs are the two most important performance measures of the systolic array, we take their product AT/sup 2/, AT/sup 2/=/spl Omega//sub r/(n)T/sub exe//sup 2/, to compare the arrays from this family. With respect to this performance measure, the best array is obtained for r=[n/2], where n is a dimension of square matrices while r indicates the extension, in terms of rows, of the array that has minimal number of processing elements for a given problem size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信