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

Data cache array having multiple content addressable fields per cache line

Assignee: International Business Machines Corp
•
Filing: 1994-10-05
•
Granted: 1998-09-08
•
Expires: 2014-10-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An interleaved data cache array which is divided into two subarrays. Each subarray includes a plurality of cache lines wherein each cache line includes a selected block of data, a parity field, a content addressable field containing a portion of an effective address for the selected block of data, a second content addressable field contains a portion of the real address for the selected block of data and a data status field. By utilizing two separate content addressable fields for the effective address and real address offset and alias problems may be efficiently resolved. The data cache is preferably arranged as an eight way set-associative cache wherein each congruence class includes up to eight entries having identical low order address bits. A separate effective address port and real address port permit parallel access to the cache without conflict in separate subarrays and a subarray arbitration logic circuit is provided for attempted simultaneous access of a single subarray by both the effective address port and the real address port.

Inventors

  • 👤 Peichun Peter Liu

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 21:36
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/10; G06F12/1027; G06F12/1045; G06F12/0802; G06F12/0864

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 100 words
A data cache array comprising: a plurality of cache lines, each of said plurality of cache lines including: a selected block of information; a first content addressable field, said first content addressable field containing at least a portion of a multi-bit effective address for said selected block of information; and a second content addressable field, said second context addressable field containing at least a portion of a multi-bit real address for said selected block of information; wherein said selected block of information may be efficiently located within said data cache array utilizing either an effective address or a real address.
Claim 2
Dependent Claim 100 words
A data cache array comprising: a plurality of cache lines, each of said plurality of cache lines including: a selected block of information; a first content addressable field, said first content addressable field containing at least a portion of a multi-bit effective address for said selected block of information; and a second content addressable field, said second context addressable field containing at least a portion of a multi-bit real address for said selected block of information; wherein said selected block of information may be efficiently located within said data cache array utilizing either an effective address or a real address.
Claim 3
Dependent Claim 26 words
A data cache array according to claim 1, wherein said data cache array comprises a plurality of subarrays, each subarray including a plurality of cache lines.
Claim 4
Dependent Claim 25 words
A data cache array according to claim 2, further including an effective address port and a real address port coupled to said data cache array.
Claim 5
Dependent Claim 48 words
A data cache array according to claim 2, further including a subarray arbitration circuit for controlling access to a single subarray within said data cache array in response to an attempted simultaneous access of said single subarray utilizing both said effective address port and said real address port.
Claim 6
Dependent Claim 36 words
A data cache array according to claim 1, wherein said data cache array includes a plurality of congruence classes, each of said plurality of congruence classes comprising a selected subset of said plurality of cache lines.
Claim 7
Dependent Claim 24 words
A data cache array according to claim 5, wherein each of said plurality of congruence classes comprises eight of said plurality of cache lines.
Claim 8
Dependent Claim 22 words
A data cache array according to claim 1, wherein each of said plurality of cache lines further includes a data status field.
Claim 9
Independent Claim 106 words
A method of caching data within a data processing system, said method comprising the steps of: providing a data cache array having a plurality of cache lines; within each cache line; storing a selected block of information; storing at least a portion of a multi-bit effective address for said selected block of information within a first content addressable field; and storing at least a portion of a multi-bit real address for said selected block of information within a second content addressable field; wherein said selected block of information may be efficiently located within said data cache array utilizing either an effective address or a real address.
Claim 10
Independent Claim 106 words
A method of caching data within a data processing system, said method comprising the steps of: providing a data cache array having a plurality of cache lines; within each cache line; storing a selected block of information; storing at least a portion of a multi-bit effective address for said selected block of information within a first content addressable field; and storing at least a portion of a multi-bit real address for said selected block of information within a second content addressable field; wherein said selected block of information may be efficiently located within said data cache array utilizing either an effective address or a real address.
Claim 11
Dependent Claim 57 words
The method of caching data according to claim 8, wherein said step of storing a portion of a multi-bit effective address for said selected block of information within a first content addressable field comprises the step of storing eight bits of said multi-bit defective address for said selected block of information within a first content addressable field.
Claim 12
Dependent Claim 57 words
The method of caching data according to claim 8, wherein said step of storing a portion of a multi-bit real address for said selected block of information within a first content addressable field comprises the step of storing twenty-eight bits of said multi-bit defective address for said selected block of information within a first content addressable field.
Claim 13
Dependent Claim 25 words
The method of caching data according to claim 8, further including the step of dividing said data cache array into a plurality of congruence classes.
Claim 14
Dependent Claim 45 words
The method of caching data according to claim 11, wherein said step of dividing said data cache array into a plurality of congruence classes comprises a step of dividing said data cache array into a plurality of congruence classes which each include eight cache lines.
Claim 15
Dependent Claim 126 words
A data processing system comprising: a processor; a main memory store; a data cache array for temporarily storing blocks of information from said main memory store, said data cache array comprising: a plurality of cache lines, each of said plurality of cache lines including: a selected block of information; a first content addressable field, said first content addressable field containing at least a portion of a multi-bit effective address for said selected block of information; and a second content addressable field, said second context addressable field containing at least a portion of a multi-bit real address for said selected block of information; wherein said selected block of information may be efficiently located within said data cache array utilizing either an effective address or a real address.
Claim 16
Dependent Claim 126 words
A data processing system comprising: a processor; a main memory store; a data cache array for temporarily storing blocks of information from said main memory store, said data cache array comprising: a plurality of cache lines, each of said plurality of cache lines including: a selected block of information; a first content addressable field, said first content addressable field containing at least a portion of a multi-bit effective address for said selected block of information; and a second content addressable field, said second context addressable field containing at least a portion of a multi-bit real address for said selected block of information; wherein said selected block of information may be efficiently located within said data cache array utilizing either an effective address or a real address.
Claim 17
Dependent Claim 26 words
The data processing system according to claim 13, wherein said data cache array comprises a plurality of subarrays, each subarray including a plurality of cache lines.
Claim 18
Dependent Claim 25 words
The data processing system according to claim 14, further including an effective address port and a real address port coupled to said data cache array.
Claim 19
Dependent Claim 48 words
The data processing system according to claim 14, further including a subarray arbitration circuit for controlling access to a single subarray within said data cache array in response to an attempted simultaneous access of said single subarray utilizing both said effective address port and said real address port.
Claim 20
Dependent Claim 36 words
The data processing system according to claim 13, wherein said data cache array includes a plurality of congruence classes, each of said plurality of congruence classes comprising a selected subset of said plurality of cache lines.
Claim 21
Dependent Claim 24 words
The data processing system according to claim 17, wherein each of said plurality of congruence class comprises eight of said plurality of cache lines.
Claim 22
Dependent Claim 22 words
The data processing system according to claim 13, wherein each of said plurality of cache lines further includes a data status field.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-09-07 2002-03-09 2002-09-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-09-07 2006-03-09 2006-09-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-09-07 2010-03-09 2010-09-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag