×

Semiconductor chip and method of controlling memory

  • US 9,378,125 B2
  • Filed: 12/21/2012
  • Issued: 06/28/2016
  • Est. Priority Date: 12/27/2011
  • Status: Expired due to Fees
First Claim
Patent Images

1. A semiconductor chip for adaptively processing a plurality of commands to request memory access, comprising:

  • a storage unit storing a current memory access request and a plurality of memory access requests received before the current memory access request in received order;

    a control unit processing the current memory access request and the plurality of memory access requests received before the current memory access request, which have been stored in the storage unit, in received order, except that memory access requests attempting to access a same bank and a same row are successively processed; and

    a re-ordering unit placing a Quality of Service (QoS) request in a foremost part of the storage unit in order to process the QoS request earlier than the plurality of memory access requests, and to determine whether a priority of the QoS request is present, executing commands according to the priority of the QoS request if the priority of the QoS request is present, and executing commands according to an order of the QoS request as received if the priority of the QoS request is not present, andwherein the QoS request guarantees a predetermined data transmission bandwidth for a network and a destination,wherein the priority of the QoS is determined based on a predetermined priority policy, andwherein the control unit further comprises an inquiry unit analyzing memory addresses that the current memory access request and the plurality of memory access requests received before the current memory access request in reverse order; and

    wherein if there is no request accessing to the same bank and the same row with the current memory access request, the re-ordering unit compares memory addresses between an n-th request and an (n−

    1)-th request which are a latest memory access request and a second latest memory access request, respectively, in the storage unit before the current memory access request, and places the current memory access request between the (n−

    1)-th request and the n-th request if the memory addresses of the n-th request and the (n−

    1)-th request addresses are assigned to different rows of a same bank and if the n-th request and the current memory access request are assigned to different banks.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×