FeReX:面向最近邻搜索的多位铁电存内计算可重构设计
FeReX: A Reconfigurable Design of Multi-bit Ferroelectric Compute-in-Memory for Nearest Neighbor Search
AI总结:
本文提出FeReX,一种基于多位FeFET的可重构存内联想存储器,通过CSP方法自动配置电压以支持汉明、曼哈顿和欧几里得等多种距离度量,在KNN和HDC任务中相比GPU实现最高250倍加速和10^4倍节能。
摘要:
人工智能的快速发展催生了具有变革性的模型,深刻影响着我们的生活。这些模型需要海量数据才能有效运行,加剧了传统冯·诺依曼架构固有的数据传输瓶颈。存内计算(CIM)作为一种新型计算范式,通过无缝嵌入内存搜索功能来应对这些问题,从而无需进行数据传输。然而,现有的基于非易失性存储器(NVM)的加速器都是面向特定应用的。在基于相似性的联想搜索操作中,它们在度量查询与已存储数据时仅支持单一、特定的距离度量,例如汉明距离、曼哈顿距离或欧几里得距离,这需要能够适应各种应用的可重构存内解决方案。为克服这一局限,本文提出了FeReX,一种可重构联想存储器(AM),可支持包括汉明距离、曼哈顿距离和欧几里得距离在内的多种距离度量。利用多位铁电场效应晶体管(FeFET)作为代理器件,并采用硬件-软件协同设计方法,我们引入了一种基于约束满足问题(CSP)的方法,为不同的基于距离的搜索函数自动生成AM搜索输入电压和存储电压配置。器件-电路协同仿真首先验证了所提出的FeReX方法在可重构搜索距离函数方面的有效性。然后,我们在k最近邻(KNN)和超维计算(HDC)的背景下对FeReX进行了基准测试,结果凸显了FeReX的鲁棒性,并表明与GPU相比,FeReX可实现高达250倍的加速和10^4倍的能耗节省。
英文摘要:
Rapid advancements in artificial intelligence have given rise to transformative models, profoundly impacting our lives. These models demand massive volumes of data to operate effectively, exacerbating the data-transfer bottleneck inherent in the conventional von-Neumann architecture. Compute-in-memory (CIM), a novel computing paradigm, tackles these issues by seamlessly embedding in-memory search functions, thereby obviating the need for data transfers. However, existing non-volatile memory (NVM)-based accelerators are application specific. During the similarity based associative search operation, they only support a single, specific distance metric, such as Hamming, Manhattan, or Euclidean distance in measuring the query against the stored data, calling for reconfigurable in-memory solutions adaptable to various applications. To overcome such a limitation, in this paper, we present FeReX, a reconfigurable associative memory (AM) that accommodates various distance metrics including Hamming, Manhattan, and Euclidean distances. Leveraging multi-bit ferroelectric field-effect transistors (FeFETs) as the proxy and a hardware-software co-design approach, we introduce a constrained satisfaction problem (CSP)-based method to automate AM search input voltage and stored voltage configurations for different distance based search functions. Device-circuit co-simulations first validate the effectiveness of the proposed FeReX methodology for reconfigurable search distance functions. Then, we benchmark FeReX in the context of k-nearest neighbor (KNN) and hyperdimensional computing (HDC), which highlights the robustness of FeReX and demonstrates up to 250x speedup and 10^4 energy savings compared with GPU.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。