DSAC: Low-Cost Rowhammer Mitigation Using In-DRAM Stochastic and Approximate Counting Algorithm. (arXiv:2302.03591v1 [cs.CR])

DRAM has scaled to achieve low cost per bit and this scaling has decreased
Rowhammer threshold. Thus, DRAM has adopted Target-Row-Refresh (TRR) which
refreshes victim rows that can possibly lose stored data due to neighboring
aggressor rows. Accordingly, prior works focused on TRR algorithm that can
identify the most frequently accessed row, Rowhammer, to detect the victim
rows. TRR algorithm can be implemented in memory controller, yet it can cause
either insufficient or excessive number of TRRs due to lack …

algorithm cost data detect dram identify low memory mitigation rowhammer scaling target victim