US5668985A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Decoder having a split queue system for processing intstructions in a first queue separate from their associated data processed in a second queue
Assignee: Intel Corp
•
Filing: 1994-03-01
•
Granted: 1997-09-16
•
Expires: 2014-03-01
Abstract
Abstract A split queue system for a decoder that supplies one or more micro-operations and data associated with the micro-operations. A main queue is coupled to receive one or more micro-operations from the decoder, and supply it to a next processing stage to provide a process micro-operation. A shadow queue is coupled to receive data associated with the micro-operation, in the same cycle that the micro-operation is supplied to the main queue. A control circuit is coupled to the main queue for issuing micro-operation from the main queue into the next processing stage in a first cycle, and in a second cycle issuing, the micro-operation therefrom. Also in the second cycle, the control circuit issues the data associated with the micro-operation from the shadow queue, so that the data is synchronized with its associated processed micro-operation.
Inventors
- 👤 Adrian L. Carbine
- 👤 Gary L. Brown
- 👤 Bradley D. Hoyt
- 👤 Donald D. Parker
- 👤 Rajesh Kumar
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 17:40
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/30145; G06F9/3016; G06F9/30167; G06F9/22; G06F9/223; G06F9/38; G06F9/3867; G06F9/3875
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
127 words
A split queue system for a decoder the split queue system being configured to decode an instruction's micro-operations separate from each micro-operation's associated data, the split queue system comprising: a main queue coupled to receive a micro-operation from a decoder; a next processing stage coupled to receive the micro-operation issued from the main queue and to process the micro-operation in one cycle to provide a processed micro-operation; a shadow queue coupled to receive the micro-operation's associated data from the decoder; and a control circuit coupled to the main queue and the shadow queue for issuing the micro-operation from the main queue in a first cycle and issuing data associated with the micro-operation in a second cycle so that the data is synchronized with its associated processed micro-operation.
Claim 2
Dependent Claim
127 words
A split queue system for a decoder the split queue system being configured to decode an instruction's micro-operations separate from each micro-operation's associated data, the split queue system comprising: a main queue coupled to receive a micro-operation from a decoder; a next processing stage coupled to receive the micro-operation issued from the main queue and to process the micro-operation in one cycle to provide a processed micro-operation; a shadow queue coupled to receive the micro-operation's associated data from the decoder; and a control circuit coupled to the main queue and the shadow queue for issuing the micro-operation from the main queue in a first cycle and issuing data associated with the micro-operation in a second cycle so that the data is synchronized with its associated processed micro-operation.
Claim 3
Dependent Claim
34 words
The split queue system of claim 1 further comprising: a branch address calculator configured to calculate branch addresses associated with associated data and coupled to the shadow queue to provide the micro-operation's associated data.
Claim 4
Dependent Claim
72 words
The split queue system of claim 1 further comprising: a control field associated with the associated data; a constant ROM coupled to the output of the shadow queue and configured to receive the associated data and provide a constant output responsive thereto; and a selector configured to select one of the constant outputs and the data which selector output is synchronized with its associated processed micro-operation in response to the control field.
Claim 5
Dependent Claim
53 words
A split queue system according to claim 3, wherein the shadow queue includes a plurality of inputs and a plurality of outputs and has a larger number of inputs than outputs and wherein each output is coupled to a constant ROM to receive associated data and to provide an output in response thereto.
Claim 6
Dependent Claim
22 words
A method according to claim 4 wherein the instruction received in the decoder is received from a series of variable length instructions.
Claim 7
Dependent Claim
132 words
In a split queue system for a decoder having a main queue coupled to the decoder, a next processing stage coupled to the main queue, a shadow queue coupled to the decoder, a control circuit coupled to the main queue and the shadow queue, a branch address calculator coupled to the shadow queue, a constant ROM coupled to the output of the shadow queue and a selector, a method of decoding instructions comprising: (a) receiving instruction in the decoder; (b) transmitting a micro-operation from the instruction to the main queue; (c) transmitting data associated with the micro-operation to the shadow queue; (d) outputting a processed micro-operation from the main queue in a first clock cycle; and (e) outputting data associated with the micro-operation from the shadow queue in a second clock cycle.
Claim 8
Dependent Claim
132 words
In a split queue system for a decoder having a main queue coupled to the decoder, a next processing stage coupled to the main queue, a shadow queue coupled to the decoder, a control circuit coupled to the main queue and the shadow queue, a branch address calculator coupled to the shadow queue, a constant ROM coupled to the output of the shadow queue and a selector, a method of decoding instructions comprising: (a) receiving instruction in the decoder; (b) transmitting a micro-operation from the instruction to the main queue; (c) transmitting data associated with the micro-operation to the shadow queue; (d) outputting a processed micro-operation from the main queue in a first clock cycle; and (e) outputting data associated with the micro-operation from the shadow queue in a second clock cycle.
Claim 9
Dependent Claim
82 words
A method according to claim 6 further comprising: (b)(1) receiving the micro-operation into the next processing stage from the main queue after step (b); (b)(2) processing the micro-operation in one cycle in the next processing stage; and (c)(1) processing the data associated with the micro-operation after step (c); wherein the sequence of steps (d) and (e) outputting the data associated with the micro-operation occurs one clock cycle after outputting the processed micro-operation allows one extra clock cycle for processing the associated data.
Claim 10
Dependent Claim
50 words
A method according to claim 7 wherein the micro-operation is processed in one cycle, wherein the data associated with the micro-operation pertains to branch address calculations and wherein the data is processed during the extra clock provided by the sequence of steps (d) and (e) with the branch address calculator.
Claim 11
Dependent Claim
47 words
A method according to claim 7 wherein the micro-operations are issued from the main queue in a first cycle and the data associated with the micro-operation is issued by the shadow queue in a second cycle so that the data is synchronized with its associated processed micro-operation.
Claim 12
Dependent Claim
35 words
A method according to claim 7 wherein the shadow queue is configured to receive associated data and to provide an output responsive thereto using a constant ROM coupled to the output of the shadow queue.
Claim 13
Dependent Claim
61 words
A method according to claim 7 wherein the associated data includes a control field associated with the associated data and wherein the step of outputting the data associated with the micro-operation from the shadow queue in a second cycle is perfected by selecting a constant output from the shadow queue wherein the selector output is synchronized with its associated processed micro-operation.
Claim 14
Dependent Claim
197 words
A pipelined processor comprising: a main memory for storing instructions and data; a cache memory for storing frequently accessed data; a system bus coupled to the main memory and the cache memory; a main memory control coupled to the system bus; an instruction fetch unit coupled to the system bus for fetching instructions and; a decoder unit for decoding instructions fetched by the instruction fetch unit, the decoder unit including: a split queue system for a decoder, the split queue system being configured to decode an instruction's micro-operations separate from each micro-operation's associated data, said split queue system comprising: a main queue coupled to receive a micro-operation from a decoder; a next processing stage coupled to receive the micro-operation issued from the main queue and to process the micro-operation in one cycle to provide a processed micro-operation; a shadow queue coupled to receive the micro-operation's associated data from the decoder; and a control circuit coupled to the main queue and the shadow queue for issuing the micro-operation from the main queue in a first cycle and issuing data associated with the micro-operation in a second cycle so that the data is synchronized with its associated processed micro-operation.
Claim 15
Dependent Claim
197 words
A pipelined processor comprising: a main memory for storing instructions and data; a cache memory for storing frequently accessed data; a system bus coupled to the main memory and the cache memory; a main memory control coupled to the system bus; an instruction fetch unit coupled to the system bus for fetching instructions and; a decoder unit for decoding instructions fetched by the instruction fetch unit, the decoder unit including: a split queue system for a decoder, the split queue system being configured to decode an instruction's micro-operations separate from each micro-operation's associated data, said split queue system comprising: a main queue coupled to receive a micro-operation from a decoder; a next processing stage coupled to receive the micro-operation issued from the main queue and to process the micro-operation in one cycle to provide a processed micro-operation; a shadow queue coupled to receive the micro-operation's associated data from the decoder; and a control circuit coupled to the main queue and the shadow queue for issuing the micro-operation from the main queue in a first cycle and issuing data associated with the micro-operation in a second cycle so that the data is synchronized with its associated processed micro-operation.
Claim 16
Dependent Claim
39 words
A parallel processor according to claim 12 wherein the split queue system further includes: a branch address calculator configured to calculate branch addresses associated with associated data and coupled to the shadow queue to provide the micro-operation's associated data.
Claim 17
Dependent Claim
77 words
A parallel processor according to claim 12 wherein the split queue system further includes: a control field associated with the associated data; a constant ROM coupled to the output of the shadow queue and configured to receive the associated data and provide a constant output responsive thereto; and a selector configured to select one of the constant outputs and the data, which selector output is synchronized with its associated processed micro-operation in response to the control field.
Claim 18
Dependent Claim
54 words
A parallel processor according to claim 12, wherein the shadow queue system further includes a plurality of inputs and a plurality of outputs and has a larger number of inputs than outputs and wherein each output is coupled to a constant ROM to receive associated data and to provide an output in response thereto.
References Cited (Backward Citations)
US4394736A
Cited
US4399505A
Cited
US4928223A
Cited
US4591972A
Cited
US4598365A
Cited
US4745544A
Cited
US5023776A
Cited
US5471591A
Cited
US5222244A
Cited
US5289584A
Cited
US5325495A
Cited
US5490255A
Cited
US5371864A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-09-15 | 2001-03-17 | 2001-09-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-09-15 | 2005-03-17 | 2005-09-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-09-15 | 2009-03-17 | 2009-09-16 | $7700.00 | Window Closed / Lapsed |