Versatile Refresh: Low Complexity Refresh Scheduling for High-throughput Multi-banked eDRAM

Multi-banked embedded DRAM (eDRAM) has become increas-ingly popular in high-performance systems. However, the data retention problem of eDRAM is exacerbated by the larger num-ber of banks and the high-performance environment in which it is deployed: The data retention time of each memory cell decreases while the number of cells to be refreshed increases. For this, multi-bank designs offer a concurrent refresh mode, where idle banks can be refreshed concurrently during read and write operations. However, conventional techniques such as periodically scheduling refreshes—with priority given to refreshes in case of conflicts with reads or writes—have variable performance, increase read latency, and can perform poorly in worst case memory access patterns. We propose a novel refresh scheduling algorithm that is low-complexity, produces near-optimal throughput with universal guar-antees, and is tolerant to bursty memory access patterns. The cen-tral idea is to decouple the scheduler into two simple-to-implement modules: one determines which cell to refresh next and the other determines when to force an idle cycle in all banks. We derive nec-essary and sufficient conditions to guarantee data integrity for all access patterns, with any given number of banks, rows per bank, read/write ports and data retention time. Our analysis shows that there is a tradeoff between refresh overhead and burst tolerance and characterizes this tradeoff precisely. The algorithm is shown to be near-optimal and achieves, for instance, 76.6 % reduction in worst-case refresh overhead from the periodic refresh algorithm for a 250MHz eDRAM with 10µs retention time and 16 banks each with 128 rows. Simulations with Apex-Map synthetic benchmarks and switch lookup table traffic show that VR can almost completely hide the refresh overhead for memory accesses with moderate-to-high multiplexing across memory banks