基于列跳跃算法的快速可扩展忆阻内存排序
Fast and Scalable Memristive In-Memory Sorting with Column-Skipping Algorithm
摘要:
最近提出了忆阻存储器内排序以提高硬件排序效率。使用迭代的内存最小值计算,可以消除内存和外部处理单元之间的数据移动,以提高延迟和能效。然而,搜索min的位遍历算法需要对忆阻存储器进行大量的列读取。在这项工作中,我们提出了一种借助近记忆电路的列跳过算法。可以根据记录的状态跳过冗余列读取,以改善延迟和硬件效率。为了提高可扩展性,我们开发了一个多银行管理,使列跳过存储在不同的忆阻存储体的数据集。原型列跳跃排序器实现与40纳米CMOS技术的1T1R忆阻存储器。在各种排序数据集上进行了实验,长度为1024的32位列跳过排序器(状态记录为2)分别比最新的忆阻内存排序显示出高达4.08倍的加速比,3.14倍的面积效率和3.39倍的能源效率。
英文摘要:
Memristive in-memory sorting has been proposed recently to improve hardware sorting efficiency. Using iterative in-memory min computations, data movements between memory and external processing units can be eliminated for improved latency and energy efficiency. However, the bit-traversal algorithm to search the min requires a large number of column reads on memristive memory. In this work, we propose a column-skipping algorithm with help of a near-memory circuit. Redundant column reads can be skipped based on recorded states for improved latency and hardware efficiency. To enhance the scalability, we develop a multi-bank management that enables column-skipping for dataset stored in different memristive memory banks. Prototype column-skipping sorters are implemented with a 1T1R memristive memory in 40nm CMOS technology. Experimented on a variety of sorting datasets, the length-1024 32-bit column-skipping sorter with state recording of 2 demonstrates up to 4.08x speedup, 3.14x area efficiency and 3.39x energy efficiency, respectively, over the latest memristive in-memory sorting.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。