Synthesis of orthogonal systolic arrays for fault-tolerant matrix multiplication

M. Stojcev, E. Milovanovic, S. Marković, I. Milovanovic
{"title":"Synthesis of orthogonal systolic arrays for fault-tolerant matrix multiplication","authors":"M. Stojcev, E. Milovanovic, S. Marković, I. Milovanovic","doi":"10.1109/MIEL.2010.5490472","DOIUrl":null,"url":null,"abstract":"This paper presents a procedure for designing fault-tolerant systolic array with orthogonal interconnects and bidirectional data flow (2DBOSA) for matrix multiplication. The method employs space-time redundancy to achieve fault-tolerance. The obtained array has Ω = n(n+2) processing elements, and total execution time of Ttot = 6n -5. The array can tolerate single transient errors and the majority of multiple error patterns with high probability. Compared to hexagonal array of same dimensions, the number of I/O pins is reduced for approximately 30%.","PeriodicalId":271286,"journal":{"name":"2010 27th International Conference on Microelectronics Proceedings","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 27th International Conference on Microelectronics Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MIEL.2010.5490472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper presents a procedure for designing fault-tolerant systolic array with orthogonal interconnects and bidirectional data flow (2DBOSA) for matrix multiplication. The method employs space-time redundancy to achieve fault-tolerance. The obtained array has Ω = n(n+2) processing elements, and total execution time of Ttot = 6n -5. The array can tolerate single transient errors and the majority of multiple error patterns with high probability. Compared to hexagonal array of same dimensions, the number of I/O pins is reduced for approximately 30%.
容错矩阵乘法正交收缩阵列的合成
本文提出了一种用于矩阵乘法的正交互连和双向数据流容错收缩阵列(2DBOSA)设计方法。该方法利用空时冗余实现容错。得到的数组有Ω = n(n+2)个处理元素,总执行时间Ttot = 6n -5。该阵列可以高概率地容忍单个瞬态错误和大多数多种错误模式。与相同尺寸的六边形阵列相比,I/O引脚数量减少了约30%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信