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

Multi-group LRU resolver

Assignee: Control Data Corp
•
Filing: 1982-09-27
•
Granted: 1985-04-16
•
Expires: 2002-09-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A logic system maintains current least recently used information among the elements of each group in a plurality of groups where each group includes two or more elements. A memory stores intermediate information regarding the relative precedence between each combination of elements in a given group. A logic network recomputes this value each time an element in a group is used and provides this new information to the memory and to a network which resolves the current least recently used status.

Inventors

  • 👤 David M. Webb
  • 👤 Thomas A. Lane

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 17:34
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/12; G06F12/121; G06F12/123; G06F12/125

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 515 words
In a least recently used resolving network of the type having a group address input line for receiving an address code and a plurality of use input lines, each use input line having associated with it a plurality of elements, one element from each plurality of elements being associated in an elemental group with one element from each of the other pluralities of elements, each said elemental group having associated with it a unique address code supplied on the group address input line each time an element in the group is used, a single one of the use input lines receiving in conjunction with each address code a use signal indicating use of the element associated with the use input line carrying the use signal, for resolving and recording the individual use relationships among the elements of each group and comprising: (a) a memory storing N words, each word having bits numbered 1 through M, where N is the greatest number of elements associated with any use input line and M is the combination of the number of use input lines taken two at a time, said memory having an input line forming the group address input line, read and write select lines, and a data input line and output line for each memory bit, and storing the data present on the data input lines at the address on the group address input line responsive to a write signal on the write select line, and providing at the data output lines for a predetermined period the data stored at the location specified by the address present on the group address input line responsive to a signal on the read select line, and each similarly numbered bit is associated with first and second use input lines forming a unique combination for each set of differently numbered bits; (b) logic network means receiving as input the signals carried by the use input lines and the memory contents received responsive to a read select signal, for supplying on the memory input lines for each of the bits 1 through M of the memory words the logical value of the expression (X AND Y) OR Z where X is the current logical value in the memory word supplied responsive to the read select signal of the memory bit involved, Y is the inverted logical value present in any use signal carried on the first use input line associated with the memory bit involved, and Z is the logical value present in any use signal carried on a second use input line associated with the memory bit involved, and wherein the logical values supplied as input to the memory comprise the desired individual use history relationship for the elements of the group associated with the address code supplied to the memory, as modified by the most recent signal on a use input line; and (c) control means receiving the use signals on the use input lines, for supplying to the memory a read select signal responsive thereto and a write select signal a predetermined interval following the read select signal.
Claim 2
Dependent Claim 515 words
In a least recently used resolving network of the type having a group address input line for receiving an address code and a plurality of use input lines, each use input line having associated with it a plurality of elements, one element from each plurality of elements being associated in an elemental group with one element from each of the other pluralities of elements, each said elemental group having associated with it a unique address code supplied on the group address input line each time an element in the group is used, a single one of the use input lines receiving in conjunction with each address code a use signal indicating use of the element associated with the use input line carrying the use signal, for resolving and recording the individual use relationships among the elements of each group and comprising: (a) a memory storing N words, each word having bits numbered 1 through M, where N is the greatest number of elements associated with any use input line and M is the combination of the number of use input lines taken two at a time, said memory having an input line forming the group address input line, read and write select lines, and a data input line and output line for each memory bit, and storing the data present on the data input lines at the address on the group address input line responsive to a write signal on the write select line, and providing at the data output lines for a predetermined period the data stored at the location specified by the address present on the group address input line responsive to a signal on the read select line, and each similarly numbered bit is associated with first and second use input lines forming a unique combination for each set of differently numbered bits; (b) logic network means receiving as input the signals carried by the use input lines and the memory contents received responsive to a read select signal, for supplying on the memory input lines for each of the bits 1 through M of the memory words the logical value of the expression (X AND Y) OR Z where X is the current logical value in the memory word supplied responsive to the read select signal of the memory bit involved, Y is the inverted logical value present in any use signal carried on the first use input line associated with the memory bit involved, and Z is the logical value present in any use signal carried on a second use input line associated with the memory bit involved, and wherein the logical values supplied as input to the memory comprise the desired individual use history relationship for the elements of the group associated with the address code supplied to the memory, as modified by the most recent signal on a use input line; and (c) control means receiving the use signals on the use input lines, for supplying to the memory a read select signal responsive thereto and a write select signal a predetermined interval following the read select signal.
Claim 3
Dependent Claim 150 words
The apparatus of claim 1 wherein the logic means further comprises (a) a plurality of flip-flops having Q and not-Q outputs and wherein every use input line is connected to a set input of a single one of the flip-flops; (b) a plurality of AND gates each associated with a memory bit and receiving at one input the memory output for that bit and receiving at a second input the not-Q output of the flip-flop connected to the use input line supplying the Y-related inverted logical value associated with the memory bit involved; and (c) a plurality of OR gates, each associated with a memory bit and receiving at one input the output of the AND gate associated with the same memory bit and at another input the Q output of the flip-flop connected to the use input line supplying the Z-related logical value associated with the memory bit involved.
Claim 4
Dependent Claim 31 words
The apparatus of claim 2, wherein the control means further includes means for supplying a clear signal to the reset terminal of each flip-flop when each write select signal is generated.

References Cited (Backward Citations)

US3737881A Cited
US3921153A Cited
US3964028A Cited
US4186438A Cited
US4332010A Cited
US4422144A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1988-04-15 1988-10-15 1989-04-16 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1992-04-15 1992-10-15 1993-04-16 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1996-04-15 1996-10-15 1997-04-16 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag