The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jul. 14, 2020

Filed:

May. 29, 2018
Applicant:

Texas Instruments Incorporated, Dallas, TX (US);

Inventors:

Abhijeet Ashok Chachad, Plano, TX (US);

Raguram Damodaran, Plano, TX (US);

Ramakrishnan Venkatasubramanian, Plano, TX (US);

Joseph Raymond Michael Zbiciak, San Jose, CA (US);

Assignee:
Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 9/30 (2018.01); G06F 12/1081 (2016.01); G06F 7/483 (2006.01); H03M 13/35 (2006.01); H03M 13/29 (2006.01); G06F 11/10 (2006.01); G06F 13/16 (2006.01); G06F 13/18 (2006.01); H03K 19/00 (2006.01); G06F 1/3296 (2019.01); H03K 21/00 (2006.01); G06F 12/02 (2006.01); G06F 12/12 (2016.01); G06F 12/0811 (2016.01); G06F 12/0815 (2016.01); G06F 13/364 (2006.01);
U.S. Cl.
CPC ...
G06F 12/1081 (2013.01); G06F 1/3296 (2013.01); G06F 7/483 (2013.01); G06F 9/3012 (2013.01); G06F 11/1064 (2013.01); G06F 12/0246 (2013.01); G06F 12/0811 (2013.01); G06F 12/0815 (2013.01); G06F 12/12 (2013.01); G06F 13/1605 (2013.01); G06F 13/18 (2013.01); H03K 19/0016 (2013.01); H03K 21/00 (2013.01); H03M 13/2903 (2013.01); H03M 13/353 (2013.01); G06F 13/1652 (2013.01); G06F 13/1657 (2013.01); G06F 13/1663 (2013.01); G06F 13/364 (2013.01); G06F 2212/1021 (2013.01); G06F 2212/1032 (2013.01); G06F 2212/221 (2013.01); G06F 2212/2532 (2013.01); G06F 2212/283 (2013.01); G06F 2212/608 (2013.01); Y02D 10/124 (2018.01); Y02D 10/172 (2018.01); Y02D 50/20 (2018.01);
Abstract

A queuing requester for access to a memory system is provided. Transaction requests are received from two or more requestors for access to the memory system. Each transaction request includes an associated priority value. A request queue of the received transaction requests is formed in the queuing requester. Each transaction request includes an associated priority value. A highest priority value of all pending transaction requests within the request queue is determined. An elevated priority value is selected when the highest priority value is higher than the priority value of an oldest transaction request in the request queue; otherwise the priority value of the oldest transaction request is selected. The oldest transaction request in the request queue with the selected priority value is then provided to the memory system. An arbitration contest with other requesters for access to the memory system is performed using the selected priority value.


Find Patent Forward Citations

Loading…