arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.09245cs.AR
收藏

现代记忆中的剩余码

Revisiting Residue Codes for Modern Memories

Evgeny Manzhosov, Adam Hastings, Meghna Pancholi, Ryan Piersma, Mohamed Tarek Ibn Ziad, Simha Sethumadhavan

摘要:

剩余码传统上用于计算错误校正,而不是存储错误校正。在本文中,我们使用这些代码的存储错误校正与令人惊讶的结果。我们发现,适应现代存储系统的残留代码提供了一个水平的纠错与传统的计划,如里德-所罗门与更少的存储位。例如,我们对剩余码的修改-- MUSE ECC --可以使用大约30%的比特提供ChipKill保护。我们表明,存储增益可用于保持新兴的安全功能,如内存标记所需的元数据,或提供更好的检测能力,对Rowhammer攻击。我们的评估表明,在支持MUSE的系统中,内存标记显示内存带宽利用率降低了12%,同时提供了与传统ECC基线相同的纠错级别,而没有明显的性能损失。因此,我们的工作展示了一个新的,灵活的原语,共同设计的可靠性与安全性和性能。

英文摘要:

Residue codes have been traditionally used for compute error correction rather than storage error correction. In this paper, we use these codes for storage error correction with surprising results. We find that adapting residue codes to modern memory systems offers a level of error correction comparable to traditional schemes such as Reed-Solomon with fewer bits of storage. For instance, our adaptation of residue code -- MUSE ECC -- can offer ChipKill protection using approximately 30% fewer bits. We show that the storage gains can be used to hold metadata needed for emerging security functionality such as memory tagging or to provide better detection capabilities against Rowhammer attacks. Our evaluation shows that memory tagging in a MUSE-enabled system shows a 12% reduction in memory bandwidth utilization while providing the same level of error correction as a traditional ECC baseline without a noticeable loss of performance. Thus, our work demonstrates a new, flexible primitive for co-designing reliability with security and performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑