Patent ID: 6272600
Filing Date: 2001-08-07
Classification: G06F

Abstract:
In a data processing system, a method for reordering a plurality of memory access requests, the method comprising:accepting the plurality of requests;reordering the plurality of requests such that at least one memory access request for an available memory location precedes at least one memory access request for a non-available memory location;selecting a request to access an available memory location, from the plurality of requests, wherein the selecting a request comprises:determining whether a read request to access an available memory location exists, among the plurality of requests;selecting a read request to access an available memory location, if the determining determines that such a read request exists; andselecting a non-read request to access an available memory location, if the determining determines that a read request to access an available location does not exist;scheduling the selected request;determining whether the selected request is a write request; andafter scheduling the selected request, successively scheduling at least one write request from the plurality of requests, if the selected request is determined to be a write request;wherein successively scheduling at least one write request comprises;counting write requests that have been successively scheduled; andsuccessively scheduling write requests until a predefined maximum number of write requests has been counted.