arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

内容可寻址存储器中的可靠关联查找

Reliable Associative Lookup in Content-Addressable Memory

Fan Li, Yanan Guo, Xin Xin

arXiv 2607.11153首次发表:更新:

AI 中文总结

研究内容可寻址存储器(CAM)的可靠关联查找问题,引入非传统码设计方法,初步填补了CAM保护码研究的长期空白,为解决CAM可靠性挑战迈出第一步。

AI 中文摘要

内容可寻址存储器(CAM)是一种重要的存储器范式,通过将输入查询与所有存储条目并行比较来进行快速搜索,实现O(1)查找复杂度。CAM通常基于传统存储技术构建,易受这些底层技术可靠性挑战影响。传统存储系统中保护码对确保可靠性至关重要且研究广泛,但CAM的保护码研究甚少。本文通过引入非传统码设计,初步填补这一长期空白。

英文摘要

Content Addressable Memory (CAM) is an important memory paradigm, which performs fast search by comparing an input query against all stored entries in parallel, achieving $O(1)$ lookup complexity. CAM is typically built upon conventional memory technologies, such as SRAM and Non-Volatile Memory (NVM). Accordingly, CAM can also be subject to the reliability challenges of these underlying technologies. In traditional memory systems, protection codes play a critical role in ensuring reliability and have been extensively studied. However, protection codes for CAM have remained largely unexplored. This paper takes an initial step toward addressing this longstanding gap by introducing a non-traditional code design.

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑