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.
Patent No.:
Date of Patent:
Dec. 05, 2017
Filed:
May. 21, 2012
Michael Fetterman, Boxborough, MA (US);
Shirish Gadre, Fremont, CA (US);
John H. Edmondson, Arlington, MA (US);
Omkar Paranjape, Austin, TX (US);
Anjana Rajendran, San Jose, CA (US);
Eric Lyell Hill, Palo Alto, CA (US);
Rajeshwaran Selvanesan, Milpitas, CA (US);
Charles Mccarver, Madison, AL (US);
Kevin Mitchell, Madison, AL (US);
Steven James Heinrich, Madison, AL (US);
Michael Fetterman, Boxborough, MA (US);
Shirish Gadre, Fremont, CA (US);
John H. Edmondson, Arlington, MA (US);
Omkar Paranjape, Austin, TX (US);
Anjana Rajendran, San Jose, CA (US);
Eric Lyell Hill, Palo Alto, CA (US);
Rajeshwaran Selvanesan, Milpitas, CA (US);
Charles McCarver, Madison, AL (US);
Kevin Mitchell, Madison, AL (US);
Steven James Heinrich, Madison, AL (US);
NVIDIA Corporation, Santa Clara, CA (US);
Abstract
One embodiment of the present disclosure sets forth an effective way to maintain fairness and order in the scheduling of common resource access requests related to replay operations. Specifically, a streaming multiprocessor (SM) includes a total order queue (TOQ) configured to schedule the access requests over one or more execution cycles. Access requests are allowed to make forward progress when needed common resources have been allocated to the request. Where multiple access requests require the same common resource, priority is given to the older access request. Access requests may be placed in a sleep state pending availability of certain common resources. Deadlock may be avoided by allowing an older access request to steal resources from a younger resource request. One advantage of the disclosed technique is that older common resource access requests are not repeatedly blocked from making forward progress by newer access requests.