A matrix-multiply unit for posits in reconfigurable logic leveraging (open)CAPI

Jianyu Chen, Z. Al-Ars, H. P. Hofstee
{"title":"A matrix-multiply unit for posits in reconfigurable logic leveraging (open)CAPI","authors":"Jianyu Chen, Z. Al-Ars, H. P. Hofstee","doi":"10.1145/3190339.3190340","DOIUrl":null,"url":null,"abstract":"In this paper, we present the design in reconfigurable logic of a matrix multiplier for matrices of 32-bit posit numbers with es=2 [1]. Vector dot products are computed without intermediate rounding as suggested by the proposed posit standard to maximally retain precision. An initial implementation targets the CAPI 1.0 interface on the POWER8 processor and achieves about 10Gpops (Giga posit operations per second). Follow-on implementations targeting CAPI 2.0 and OpenCAPI 3.0 on POWER9 are expected to achieve up to 64Gpops. Our design is available under a permissive open source license at https://github.com/ChenJianyunp/Unum_matrix_multiplier. We hope the current work, which works on CAPI 1.0, along with future community contributions, will help enable a more extensive exploration of this proposed new format.","PeriodicalId":402566,"journal":{"name":"Proceedings of the Conference for Next Generation Arithmetic","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Conference for Next Generation Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3190339.3190340","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

In this paper, we present the design in reconfigurable logic of a matrix multiplier for matrices of 32-bit posit numbers with es=2 [1]. Vector dot products are computed without intermediate rounding as suggested by the proposed posit standard to maximally retain precision. An initial implementation targets the CAPI 1.0 interface on the POWER8 processor and achieves about 10Gpops (Giga posit operations per second). Follow-on implementations targeting CAPI 2.0 and OpenCAPI 3.0 on POWER9 are expected to achieve up to 64Gpops. Our design is available under a permissive open source license at https://github.com/ChenJianyunp/Unum_matrix_multiplier. We hope the current work, which works on CAPI 1.0, along with future community contributions, will help enable a more extensive exploration of this proposed new format.
在可重构逻辑中利用(开放)CAPI的位置的矩阵乘单元
在本文中,我们用可重构逻辑设计了一个用于32位正数矩阵es=2的矩阵乘法器[1]。矢量点积的计算没有中间舍入,建议的正标准,以最大限度地保持精度。最初的实现以POWER8处理器上的CAPI 1.0接口为目标,并实现了大约10gpop(每秒千兆次操作)。POWER9上针对CAPI 2.0和OpenCAPI 3.0的后续实现预计将达到64gpop。我们的设计在一个宽松的开放源代码许可下可以在https://github.com/ChenJianyunp/Unum_matrix_multiplier上获得。我们希望当前在CAPI 1.0上的工作,以及未来社区的贡献,将有助于对这个提议的新格式进行更广泛的探索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信