← Back to Patent Explorer
US5684971A Expired / Lapsed US ⏱️ 0.0 years remaining

Reservation station with a pseudo-FIFO circuit for scheduling dispatch of instructions

Assignee: Intel Corp
•
Filing: 1996-06-13
•
Granted: 1997-11-04
•
Expires: 2016-06-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A reservation station includes a memory array in which micro-operations are stored at entry locations with an age representing a temporal ordering. Control circuitry resets the age of a new micro-operation, and increments the ages of previously stored micro-operations, when an entry is written into the array. Wired-OR circuitry is utilized to find the oldest age within the memory array, which is then broadcast through the array to generate a priority pointer that identifies a group of entries which contain an entry with the oldest age. Scheduling logic selects a ready entry in the group for dispatch to a port of the execution unit.

Inventors

  • 👤 Robert W. Martell
  • 👤 Alexander P. Henstrom
  • 👤 Derek Edwin Pappas

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 19:06
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/38; G06F9/3854; G06F9/3856; G06F9/3836; G06F9/3838; G06F9/384

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 185 words
A reservation station (RS) that dispatches micro-operations (uops) specified by instruction of a microprocessor to an execution unit, the RS comprising: a memory array having a plurality of entries, a uop being stored at each entry with an age representing a temporal ordering of all uops stored therein; control circuitry associated with each entry of the memory array that resets the age of a new uop and increments ages of previously stored uops when the new uop is written into the array, the control circuitry also including comparison logic that compares a current age of each entry with an oldest age and produces a priority pointer identifies an oldest entry having the oldest age; an age detection circuit coupled with the control circuitry that detects the oldest age of the memory array, the age detection circuit broadcasting the oldest age through the memory array; scheduling logic that selects a ready entry from the plurality of entries of the memory array for dispatch to a port of the execution unit, a beginning scan point for selection of the ready entry being determined by the priority pointer.
Claim 2
Dependent Claim 185 words
A reservation station (RS) that dispatches micro-operations (uops) specified by instruction of a microprocessor to an execution unit, the RS comprising: a memory array having a plurality of entries, a uop being stored at each entry with an age representing a temporal ordering of all uops stored therein; control circuitry associated with each entry of the memory array that resets the age of a new uop and increments ages of previously stored uops when the new uop is written into the array, the control circuitry also including comparison logic that compares a current age of each entry with an oldest age and produces a priority pointer identifies an oldest entry having the oldest age; an age detection circuit coupled with the control circuitry that detects the oldest age of the memory array, the age detection circuit broadcasting the oldest age through the memory array; scheduling logic that selects a ready entry from the plurality of entries of the memory array for dispatch to a port of the execution unit, a beginning scan point for selection of the ready entry being determined by the priority pointer.
Claim 3
Dependent Claim 22 words
The RS of claim 1 wherein the priority pointer comprises multi-bit vector that indicates a group of entries containing the oldest entry.
Claim 4
Dependent Claim 27 words
The RS of claim 2 wherein each entry of the memory array has an associated counter that contains the age of the uop stored at each entry.
Claim 5
Dependent Claim 19 words
The RS of claim 3 wherein the age comprises an 8-bit value and the counter comprises a shift register.
Claim 6
Dependent Claim 14 words
The RS of claim 1 wherein the control circuitry comprises a domino logic circuit.
Claim 7
Dependent Claim 21 words
The RS of claim 4 wherein the group comprises four entries and the plurality of entries comprise twenty or more entries.
Claim 8
Dependent Claim 28 words
The RS of claim 1 wherein the control circuitry comprises a latch that stores a bit of the current age, the latch being coupled to the wired-OR connection.
Claim 9
Dependent Claim 34 words
The RS of claim 7 wherein the comparison logic comprises an AND gate having one input coupled to the latch and another input coupled to the age detection circuit to receive the oldest age.
Claim 10
Dependent Claim 14 words
The RS of claim 2 wherein the scheduling logic comprises two stage domino circuitry.
Claim 11
Dependent Claim 54 words
The RS of claim 9 wherein the two stage domino circuitry comprises a first stage circuit that disables all groups of entries except the group of entries containing the oldest entry, and a second stage that arbitrates on individual entries within the group of entries containing the oldest entry to select the ready entry.
Claim 12
Dependent Claim 20 words
The RS of claim 1 wherein the age detection circuit is coupled with the control circuitry through a wired-OR connection.

References Cited (Backward Citations)

US5625837A Cited
US5220653A Cited
US5560025A Cited
US5613080A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-11-03 2001-05-05 2001-11-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-11-03 2005-05-05 2005-11-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-11-03 2009-05-05 2009-11-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag