混合存储立方体协议的在线并行CRC32实现

K. Salah
{"title":"混合存储立方体协议的在线并行CRC32实现","authors":"K. Salah","doi":"10.1109/ICENCO.2013.6736466","DOIUrl":null,"url":null,"abstract":"Hybrid Memory Cube (HMC) is a revolutionary standard in DRAM architecture based on 3D integration. It provides marvelous concurrency and reduced latency. HMC uses CRC32 for data integrity, but conventional Serial CRC calculation is very slow and has long latencies, here we propose three methods to implement parallel CRC to be very fast. The first method uses symbolic toolbox in MATLAB to generate the final equations of the CRC, and then these equations are exported to VERILOG so that we are able to calculate it in only one clock cycle. The second method is depending on using an existing tool that can generate parallel CRC but this tool has a limitation on the input data width as it is less than the maximum allowed data width in HMC which is 1152 bits, so we were able to find a work around method that enable us to calculate CRC32 for large data widthwith this tool. The third method is based on using the polynomial mathematics for CRC, as the CRC can be calculated using long division method. Method 1 latency is one clock cycle, Method 2 latency is 2 clock cycles, and method 3 latency is 37 clock cycles compared to serial CRC which latency is 1152 clock cycles.","PeriodicalId":256564,"journal":{"name":"2013 9th International Computer Engineering Conference (ICENCO)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An online parallel CRC32 realization for Hybrid Memory Cube protocol\",\"authors\":\"K. Salah\",\"doi\":\"10.1109/ICENCO.2013.6736466\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hybrid Memory Cube (HMC) is a revolutionary standard in DRAM architecture based on 3D integration. It provides marvelous concurrency and reduced latency. HMC uses CRC32 for data integrity, but conventional Serial CRC calculation is very slow and has long latencies, here we propose three methods to implement parallel CRC to be very fast. The first method uses symbolic toolbox in MATLAB to generate the final equations of the CRC, and then these equations are exported to VERILOG so that we are able to calculate it in only one clock cycle. The second method is depending on using an existing tool that can generate parallel CRC but this tool has a limitation on the input data width as it is less than the maximum allowed data width in HMC which is 1152 bits, so we were able to find a work around method that enable us to calculate CRC32 for large data widthwith this tool. The third method is based on using the polynomial mathematics for CRC, as the CRC can be calculated using long division method. Method 1 latency is one clock cycle, Method 2 latency is 2 clock cycles, and method 3 latency is 37 clock cycles compared to serial CRC which latency is 1152 clock cycles.\",\"PeriodicalId\":256564,\"journal\":{\"name\":\"2013 9th International Computer Engineering Conference (ICENCO)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 9th International Computer Engineering Conference (ICENCO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICENCO.2013.6736466\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 9th International Computer Engineering Conference (ICENCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICENCO.2013.6736466","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

混合内存立方体(HMC)是基于3D集成的DRAM架构中的革命性标准。它提供了惊人的并发性并减少了延迟。HMC使用CRC32来保证数据的完整性,但是传统的串行CRC计算速度很慢,并且有很长的延迟,在这里我们提出三种方法来实现并行CRC,以达到非常快的速度。第一种方法是利用MATLAB中的符号工具箱生成CRC的最终方程,然后将这些方程导出到VERILOG中,这样我们就可以在一个时钟周期内进行计算。第二种方法依赖于使用可以生成并行CRC的现有工具,但该工具对输入数据宽度有限制,因为它小于HMC中允许的最大数据宽度,即1152位,因此我们能够找到一种绕过方法,使我们能够使用该工具计算大数据宽度的CRC32。第三种方法基于对CRC的多项式数学,可以使用长除法计算CRC。与串行CRC的1152时钟周期相比,方法1的时延为1个时钟周期,方法2的时延为2个时钟周期,方法3的时延为37个时钟周期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An online parallel CRC32 realization for Hybrid Memory Cube protocol
Hybrid Memory Cube (HMC) is a revolutionary standard in DRAM architecture based on 3D integration. It provides marvelous concurrency and reduced latency. HMC uses CRC32 for data integrity, but conventional Serial CRC calculation is very slow and has long latencies, here we propose three methods to implement parallel CRC to be very fast. The first method uses symbolic toolbox in MATLAB to generate the final equations of the CRC, and then these equations are exported to VERILOG so that we are able to calculate it in only one clock cycle. The second method is depending on using an existing tool that can generate parallel CRC but this tool has a limitation on the input data width as it is less than the maximum allowed data width in HMC which is 1152 bits, so we were able to find a work around method that enable us to calculate CRC32 for large data widthwith this tool. The third method is based on using the polynomial mathematics for CRC, as the CRC can be calculated using long division method. Method 1 latency is one clock cycle, Method 2 latency is 2 clock cycles, and method 3 latency is 37 clock cycles compared to serial CRC which latency is 1152 clock cycles.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信