| CPC G11C 11/40618 (2013.01) [G11C 11/40615 (2013.01)] | 30 Claims |

|
1. A method for refreshing memory in a computing device having asymmetrical memory ranks of different sizes, comprising:
receiving a memory refresh request;
initiating a linear only refresh of one memory rank based on the memory refresh request if a start memory address and an end memory address exceed a threshold;
initiating a linear with interleave memory refresh of the asymmetrical memory ranks if the start memory address is less than the threshold and if the end memory address is greater than the threshold; and
initiating an interleave only memory refresh of the asymmetrical memory ranks if the start memory address and end memory address are both less than the threshold.
|