×

Memory request reordering in a data processing system

  • US 6,272,600 B1
  • Filed: 02/28/1997
  • Issued: 08/07/2001
  • Est. Priority Date: 11/15/1996
  • Status: Expired due to Term
First Claim
Patent Images

1. 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; and

    selecting 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; and

    after 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; and

    successively scheduling write requests until a predefined maximum number of write requests has been counted.

View all claims
  • 6 Assignments
Timeline View
Assignment View
    ×
    ×