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

Posting out-of-sequence fetches

Assignee: International Business Machines Corp
•
Filing: 1987-05-18
•
Granted: 1991-02-05
•
Expires: 2007-05-18
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Monitoring apparatus is provided to allow out-of-sequence fetching of operands while preserving the appearance of in-sequence fetching to the processor of a computer. The key elements include a stack (119) of N entries holding the addresses of the last M, where M is less than or equal to N, out-of-sequence fetches. A comparator (103) is provided for comparing addresses in the stack with a test address. This test address is supplied via an OR gate (107) as either store addresses or cross-invalidate addresses, the latter being for a multiprocessor system. The addresses in the stack that compare with the test address are set as invalid. In addition, all addresses in the stack are set as invalid on the occurrence of a cache miss or serializing instruction. Finally, a select and check entry function (113) associates an address in the stack with the instruction it represents and deletes the address from the stack when the instruction is handled in its proper sequence.

Inventors

  • 👤 Philip G. Emma
  • 👤 Joshua W. Knight, III
  • 👤 James H. Pomerene
  • 👤 Rudolph N. Rechtschaffen
  • 👤 Frank J. Sparacio

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 03:16
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/38; G06F9/3802; G06F9/3814; G06F9/3824; G06F9/3834

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 194 words
In a computer having means to fetch operands and execute instructions in accordance therewith, apparatus for monitoring out-of-sequence fetches of operands, comprising: a stack having N entries for holding the addresses of the last M out of sequence fetches, where M is less than or equal to N, each of said addresses having associated therewith a valid bit and a full/empty bit, said full/empty bit being set to full when there is an entry in said stack for the address; comparison means for comparing addresses in said stack with a predetermined test address; means for setting invalid the valid bit of addresses that are equal to said test address; and tag means for associating an address in the stack with an instruction it represents and means for deleting said address when an operand is handled in its proper sequence, said tag means including means for selecting an entry in said stack corresponding to a current instruction; and means for checking the full/empty bit and the valid bit for the associated address and signaling that corrective action is required when the full/empty bit is set to full and the valid bit is set to invalid.
Claim 2
Dependent Claim 194 words
In a computer having means to fetch operands and execute instructions in accordance therewith, apparatus for monitoring out-of-sequence fetches of operands, comprising: a stack having N entries for holding the addresses of the last M out of sequence fetches, where M is less than or equal to N, each of said addresses having associated therewith a valid bit and a full/empty bit, said full/empty bit being set to full when there is an entry in said stack for the address; comparison means for comparing addresses in said stack with a predetermined test address; means for setting invalid the valid bit of addresses that are equal to said test address; and tag means for associating an address in the stack with an instruction it represents and means for deleting said address when an operand is handled in its proper sequence, said tag means including means for selecting an entry in said stack corresponding to a current instruction; and means for checking the full/empty bit and the valid bit for the associated address and signaling that corrective action is required when the full/empty bit is set to full and the valid bit is set to invalid.
Claim 3
Dependent Claim 34 words
The apparatus for monitoring out-of-sequence fetches recited in claim 1 further comprising means for setting the valid bits for all addresses in said fetch stack to invalid on the occurrence of a cache miss.
Claim 4
Dependent Claim 34 words
The apparatus for monitoring out-of-sequence fetches recited in claim 1 further comprising means for setting the valid bits for all addresses in said fetch stack to invalid on the occurrence of a serializing instruction.
Claim 5
Dependent Claim 42 words
The apparatus for monitoring out-of-sequence fetches recited in claim 1 further comprising means for setting the valid bits for all addresses in said fetch stack to invalid on the occurrence of at least one of a cache miss or a serializing instruction.
Claim 6
Dependent Claim 48 words
The apparatus for monitoring out-of-sequence fetches as recited in claim 1 further comprising: means for detecting and signalling an overflow condition of said stack; and means for setting the valid bits of all addresses in said stack to invalid in response to the signalling of an overflow condition.
Claim 7
Dependent Claim 18 words
The apparatus for monitoring out-of-sequence fetches recited in claim 1 wherein said predetermined test address is store address.
Claim 8
Dependent Claim 18 words
The apparatus for monitoring out-of-sequence fetches recited in claim 1 wherein said predetermined test address is cross-invalidate address.
Claim 9
Dependent Claim 22 words
The apparatus for monitoring out-of-sequence fetches recited in claim 1 wherein predetermined test address is either store address or cross invalidate address.
Claim 10
Dependent Claim 53 words
The apparatus for monitoring out-of-sequence fetches recited in claim 1 further comprising: means for detecting and signalling an overflow condition of said stack; and means for setting the valid bits for all addresses in said fetch stack to invalid on the occurrence of an overflow condition, a cache miss or a serializing instruction.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-02-04 1994-08-06 1995-02-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-02-04 1998-08-06 1999-02-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-02-04 2002-08-06 2003-02-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag