ShiftsReduce:最小化赛道内存4.0中的移位
ShiftsReduce: Minimizing Shifts in Racetrack Memory 4.0
摘要:
自2008年提出概念以来,赛道存储器(RM)已经发生了重大变化,使其成为新兴存储器技术领域的有力竞争者。尽管关键的技术进步,基于RM的系统的访问延迟和能耗仍然受到移位操作数量的高度影响。需要这些操作来将比特移动到轨道中的正确位置。本文提出了数据放置技术的RM,最大限度地提高连续引用访问附近的内存位置在运行时,从而最大限度地减少移位的数量的可能性。我们提出了一个整数线性规划(ILP)制定的最佳数据放置在RM,并重新审视现有的偏移分配算法,最初提出的随机存取存储器。我们引入了一种新的启发式适合于现实的RM,并将其与遗传搜索,以进一步提高解决方案。我们显示了高达52.5%的班次数量减少,超过了最高16.1%的最新技术水平。
英文摘要:
Racetrack memories (RMs) have significantly evolved since their conception in 2008, making them a serious contender in the field of emerging memory technologies. Despite key technological advancements, the access latency and energy consumption of an RM-based system are still highly influenced by the number of shift operations. These operations are required to move bits to the right positions in the racetracks. This paper presents data placement techniques for RMs that maximize the likelihood that consecutive references access nearby memory locations at runtime thereby minimizing the number of shifts. We present an integer linear programming (ILP) formulation for optimal data placement in RMs, and revisit existing offset assignment heuristics, originally proposed for random-access memories. We introduce a novel heuristic tailored to a realistic RM and combine it with a genetic search to further improve the solution. We show a reduction in the number of shifts of up to 52.5%, outperforming the state of the art by up to 16.1%.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。