节能存储器的最优刷新功率分配
On the Optimal Refresh Power Allocation for Energy-Efficient Memories
摘要:
刷新是动态随机存取存储器(DRAM)中防止数据丢失的重要操作。然而,频繁的刷新操作会导致相当大的功耗并降低系统性能。刷新功率成本在高容量存储设备和电池供电的边缘/移动应用中尤其重要。在本文中,我们提出了一个原则性的方法来优化刷新功率分配。给定一个模型的位出错率依赖于功率,我们制定了一个凸优化问题,以最小化字均方误差的刷新功率约束,因此,我们可以保证所获得的刷新功率分配的最优。此外,我们提供了一个整数规划问题,以优化离散刷新间隔分配。对于一个8位访问的字,数值结果表明,优化的非均匀刷新间隔降低了29%的刷新功率在50 dB的峰值信噪比相比,均匀分配。
英文摘要:
Refresh is an important operation to prevent loss of data in dynamic random-access memory (DRAM). However, frequent refresh operations incur considerable power consumption and degrade system performance. Refresh power cost is especially significant in high-capacity memory devices and battery-powered edge/mobile applications. In this paper, we propose a principled approach to optimizing the refresh power allocation. Given a model for the bit error rate dependence on power, we formulate a convex optimization problem to minimize the word mean squared error for a refresh power constraint; hence we can guarantee the optimality of the obtained refresh power allocations. In addition, we provide an integer programming problem to optimize the discrete refresh interval assignments. For an 8-bit accessed word, numerical results show that the optimized nonuniform refresh intervals reduce the refresh power by 29% at a peak signal-to-noise ratio of 50dB compared to the uniform assignment.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。