| 摘要 |
Memory bank pairs are sorted utilizing variables determined by a scoring criteria. The scores for the variables are based on the number of memory blocks in a memory bank that are filled; the total number of memory bank pairs that are identically populated (same set of blocks per bank) and the number of memory bank pairs that either match or are close to a standard interleave value. Sort schemes are determined by the values of each variable. A first sort scheme is attempted and after the sort scheme is complete, if all possible configurable banks are not configured, the banks are marked un-configured and another sort scheme is tried. Each sort scheme, utilizing a maximum of four schemes, is attempted until a method is found that configures all possible configurable bank pairs. Sorting is done for up to three levels, i.e., all bank pairs are sorted according to a first value, then all bank pairs with equal values are sorted according to a second value. Then the resulting matching bank pairs are sorted according to the third value. This method reduces the time required to determine a minimum and sufficient number of interleave registers required to configure all possible memory configurations in a given mixed interleave memory.
|
