17899016. ACCESS REQUEST REORDERING FOR MEMORY-BASED COMMUNICATION QUEUES simplified abstract (Micron Technology, Inc.)

From WikiPatents
Jump to navigation Jump to search

ACCESS REQUEST REORDERING FOR MEMORY-BASED COMMUNICATION QUEUES

Organization Name

Micron Technology, Inc.

Inventor(s)

Michael Keith Dugan of Richardson TX (US)

Tony M. Brewer of Plano TX (US)

ACCESS REQUEST REORDERING FOR MEMORY-BASED COMMUNICATION QUEUES - A simplified explanation of the abstract

This abstract first appeared for US patent application 17899016 titled 'ACCESS REQUEST REORDERING FOR MEMORY-BASED COMMUNICATION QUEUES

Simplified Explanation

The system described in the patent application includes a memory device and a command manager that reorders read requests. The command manager receives read responses associated with transaction identifiers and allocates free list entries for read requests.

  • Memory device and command manager work together to reorder read requests.
  • Command manager receives read responses with transaction identifiers.
  • Free list entries are allocated for read requests.
  • Tail index of reordering queue is written to remapping queue based on free list entry.
  • Read responses are written to allocated entry of reordering queue.
      1. Potential Applications
  • This technology could be applied in computer systems to optimize memory access and improve overall system performance.
  • It could be used in data centers to efficiently manage read requests and responses.
      1. Problems Solved
  • Helps in reducing latency in memory access by reordering read requests.
  • Improves system efficiency by managing read requests effectively.
      1. Benefits
  • Enhances system performance by optimizing memory access.
  • Increases overall efficiency of data processing in computer systems.


Original Abstract Submitted

A system includes a memory device and a command manager configured to reorder read requests. The command manager is configured to receive a read response associated with a transaction identifier for the read request. A free list entry for the read request is allocated from a free list. The free list entry is associated with a transaction identifier of the read request. A tail index of a reordering queue is written to a remapping queue based on the free list entry. The tail index is configured to provide a write address of the reordering queue that is allocated for the read request. A read response associated with the transaction identifier for the read request is received. The read response is written to the allocated entry of the reordering queue.

Retrieved from "http://wikipatents.org/index.php?title=17899016._ACCESS_REQUEST_REORDERING_FOR_MEMORY-BASED_COMMUNICATION_QUEUES_simplified_abstract_(Micron_Technology,_Inc.)&oldid=36249"