Patent US4631660A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4631660A Expired / Lapsed US ⏱️ 0.0 years remaining

Addressing system for an associative cache memory

Assignee: Fujitsu IT Holdings Inc
•
Filing: 1983-08-30
•
Granted: 1986-12-23
•
Expires: 2003-08-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A memory system which comprises a mainstore for storing lines of data and a buffer store for storing lines of data that are a subset of the data stored in the main store. The buffer store is comprised of a plurality of associativities. A line of data stored in the buffer having a given address may be stored in any one of the plurality of associativities. A tag store stores a tag for the associativities. A field from a buffer store address is compared with the stored tag in the tag store to produce a data selection signal for selecting from among the plurality of associativities the proper line of data. When the buffer has only two associativities, a bit in the buffer store address which has different values for the two associativities is tested, and thus the proper line of data is selected. The bit position is indicated by a pointer stored in the tag array. A selection of one of two data lines is made prior to a determination of the presence or validity of data in the buffer store.

Inventors

  • 👤 Gary A. Woffinden
  • 👤 Gene M. Amdahl
  • 👤 Donald L. Hanson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 15:39
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0864; G06F2212/00; G06F2212/60; G06F2212/608; G06F2212/6082

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 151 words
A memory system comprising: a main store for storing lines of data; a buffer store, accessed by a requesting address, for storing lines of data that are a sub-set of the lines of data stored in said main store, said buffer having a first and second associativity; said first associativity having a line of data from a first address in said buffer store and said second associativity having a line of data from a second address in said buffer store; pointer means for storing a data select pointer that indicates a bit location within said first and second addresses which has a first value in said first address at said bit location and a second value in said second address at said bit location; and data selection means for receiving said data select pointer to access said bit location in said requesting address to select between said first and second associativities.
Claim 2
Dependent Claim 151 words
A memory system comprising: a main store for storing lines of data; a buffer store, accessed by a requesting address, for storing lines of data that are a sub-set of the lines of data stored in said main store, said buffer having a first and second associativity; said first associativity having a line of data from a first address in said buffer store and said second associativity having a line of data from a second address in said buffer store; pointer means for storing a data select pointer that indicates a bit location within said first and second addresses which has a first value in said first address at said bit location and a second value in said second address at said bit location; and data selection means for receiving said data select pointer to access said bit location in said requesting address to select between said first and second associativities.
Claim 3
Dependent Claim 29 words
The apparatus of claim 1, wherein: said data select pointer includes a field for indicating whether said bit location is non-zero in said first address or said second address.
Claim 4
Dependent Claim 27 words
The apparatus of claim 1, wherein: said pointer means includes a tag array for storing said data select pointers for all address pairs in said buffer store.
Claim 5
Dependent Claim 145 words
A memory system, comprising: a main store for storing lines of data at addresses uniquely identifying a location in said main store for each of said lines of data; a buffer store for storing a sub-set of said lines of data identified by requesting addresses, said buffer store including a number N of associativities so that each requesting address identifies N locations, one in each of said N associativities, at which a line of data identified by said requesting address may be stored; data selection means, responsive, to said requesting address, receiving information from N-1 of said N associativities for performing in parallel N-1 logical operations between the requesting address and said information to generate a data select signal indicating one of said N associativities; and means, responsive to said data select signal, for enabling the indicated one of said N associativities to be accessed.
Claim 6
Dependent Claim 145 words
A memory system, comprising: a main store for storing lines of data at addresses uniquely identifying a location in said main store for each of said lines of data; a buffer store for storing a sub-set of said lines of data identified by requesting addresses, said buffer store including a number N of associativities so that each requesting address identifies N locations, one in each of said N associativities, at which a line of data identified by said requesting address may be stored; data selection means, responsive, to said requesting address, receiving information from N-1 of said N associativities for performing in parallel N-1 logical operations between the requesting address and said information to generate a data select signal indicating one of said N associativities; and means, responsive to said data select signal, for enabling the indicated one of said N associativities to be accessed.
Claim 7
Dependent Claim 51 words
The memory system of claim 4, wherein: said data selection means includes a means for storing a data select tag for each line of data in N-1 of said N associativities; and means, responsive to said requesting address, for comparing said requesting address with data select tags from said N-1 associativities.
Claim 8
Dependent Claim 56 words
The memory system of claim 4, wherein said buffer store includes two associativities, that is N equals 2, and said data selection means performs a match on one of said two associativities whereby data from the one associativity is selected if a match occurs and data from the other associativity is selected if no match occurs.
Claim 9
Dependent Claim 68 words
The memory system of claim 5, wherein: said requesting address includes a requesting number of bits required to uniquely identify a line of data; and said data select tag includes a fewer number of bits than said requesting number of bits; and further including: means for controlling the content of said buffer store in order to avoid ambiguity in the lines of data stored in said buffer store.
Claim 10
Dependent Claim 27 words
The memory system of claim 5 wherein said tag contains a subset of the requesting address which caused the data to be moved into the data buffer.

References Cited (Backward Citations)

US4045781A Cited
US4168541A Cited
US4381541A Cited
US4400770A Cited
US4441155A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1989-12-22 1990-06-23 1990-12-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1993-12-22 1994-06-23 1994-12-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1997-12-22 1998-06-23 1998-12-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag