Patent ID: 6226720
Filing Date: 2001-05-01
Classification: G06F

Abstract:
A method for interleaving memory banks in a data processing system, comprising:computing predefined variables including:within a pair of memory banks, determining a first variable bycalculating a first number of fully populated memory blocks in a first bank of the pair of memory banks,calculating a second number of fully populated memory blocks in a second bank of the pair of memory banks, andadding the second number to the first number;calculating a second variable comprising a number of pairs of memory banks which are identically populated with memory blocks; andwithin the pair of memory banks, calculating a third variable bysubtracting a total number of memory blocks in the first memory bank from an arbitrary number selected to cause the third variable to be greater than zero if any of the memory blocks within the first memory bank are populated, andadding a total number of memory blocks in the second memory bank to the arbitrary number if any of the memory blocks are populated;determining an execution order for a defined set of sort procedures, wherein the defined set is limited to a number of sort procedures sufficient to produce an optimal interleave scheme;effecting a first sort procedure utilizing a predetermined combination of the predefined variables; andresponsive to successful completion of a sort procedure within the execution order, mapping a resulting interleave scheme to a plurality of interleave registers.