US5420994A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for reading a multiple byte data element in a memory system with at least one cache and a main memory
Assignee: NCR Voyix Corp
•
Filing: 1990-08-06
•
Granted: 1995-05-30
•
Expires: 2010-08-06
Abstract
Abstract A method for reading a multiple byte data element stored in both first and second memories. Selected bytes of the data element are invalidated in the first memory. Valid bytes from the first memory are combined with remaining bytes from the second memory in response to a read request.
Inventors
- 👤 Edward C. King
- 👤 Forrest O. Arnold
- 👤 Jackson L. Ellis
- 👤 Robert B. Moussavi
- 👤 Pirmin L. Weisser
- 👤 Fulps V. Vermeer
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 20:57
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0877; G06F12/0884
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
111 words
In a computer system having first and second memories connected to a data bus, said data bus having a width of n bytes so that an n-byte data element may be transmitted in parallel, each of said memories having addressable locations which store n-byte data elements, a method comprising: a. storing first and second n-byte data elements having a common address in first and second locations in said first and second memories, respectively; and b. responding to a first read request by selecting bytes from each of said first and second data elements and transferring the selected bytes at the same time from said first and second memories to said bus.
Claim 2
Dependent Claim
111 words
In a computer system having first and second memories connected to a data bus, said data bus having a width of n bytes so that an n-byte data element may be transmitted in parallel, each of said memories having addressable locations which store n-byte data elements, a method comprising: a. storing first and second n-byte data elements having a common address in first and second locations in said first and second memories, respectively; and b. responding to a first read request by selecting bytes from each of said first and second data elements and transferring the selected bytes at the same time from said first and second memories to said bus.
Claim 3
Dependent Claim
41 words
The method of claim 1, further comprising prior to step "b": designating each byte of said first data element in said first memory as valid or invalid; wherein only valid bytes from the first data element are selected in step "b".
Claim 4
Dependent Claim
51 words
The method of claim 2, wherein said system includes a bus master connected to said bus, further comprising prior to step "b": designating selected bytes in said first memory as dirty; wherein data bytes are designated as dirty when they are written into said first memory location from said bus master.
Claim 5
Dependent Claim
19 words
The method of claim 3 wherein only bytes which are both valid and dirty are selected in step "b".
Claim 6
Dependent Claim
20 words
The method of claim 4 wherein said first memory is a cache and said second memory is a system memory.
Claim 7
Dependent Claim
36 words
The method of claim 5 wherein step "b" includes: checking said cache for said first data element; and generating a signal, when invalid bytes in said first data element are detected, to activate said system memory.
Claim 8
Dependent Claim
47 words
The method of claim 5 wherein said cache includes a valid/invalid flag for each byte of each data element stored therein representing whether the byte is valid or invalid and wherein each byte of said first data element has a corresponding byte in said second data element.
Claim 9
Dependent Claim
25 words
The method of claim 7 wherein valid flags for dirty bytes are used to block the transfer of corresponding data bytes from said system memory.
Claim 10
Dependent Claim
63 words
The method of claim 8 wherein said bus has the same number of byte wide lines as the number of bytes in said data element, wherein data bytes are blocked by disconnecting corresponding lines from said memory, and wherein each dirty and valid byte from said cache is combined with remaining bytes from said system memory by connecting corresponding lines from said cache.
Claim 11
Dependent Claim
15 words
The method of claim 5 wherein a second cache is also connected to said bus.
Claim 12
Dependent Claim
17 words
The method of claim 10 wherein step "b" includes: checking each cache for said first data element.
Claim 13
Dependent Claim
74 words
The method of claim 11 wherein: step "a" further comprises storing a third n-byte data element having the same address as said first and second data elements in said second cache; and step "b" further comprises responding to said first read request by selecting bytes from said each of said first and second caches and system memory and transferring the selected bytes at the same time from said caches and memory to said bus.
Claim 14
Dependent Claim
31 words
The method of claim 5 further comprising, prior to responding to said first read request: sequentially responding to other read requests by transferring a plurality of data elements from said memory.
Claim 15
Dependent Claim
24 words
The method of claim 13, further comprising: activating said memory while checking said cache for a data element responsive to said first read request.
Claim 16
Dependent Claim
33 words
The method of claim 14 wherein valid bytes from said cache are combined with remaining bytes from said system memory only for bytes of said cache data element which are dirty and valid.
References Cited (Backward Citations)
US4157586A
Cited
US4323968A
Cited
US4631668A
Cited
US4680702A
Cited
US5091846A
Cited
US5019971A
Cited
US4926317A
Cited
EP0310446A2
Cited
US5095527A
Cited
EP0379769A2
Cited
US5155824A
Cited
US5091851A
Cited
US5073851A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-05-29 | 1998-11-28 | 1999-05-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-05-29 | 2002-11-28 | 2003-05-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-05-29 | 2006-11-28 | 2007-05-30 | $7700.00 | Window Closed / Lapsed |