Patent US5890213A successfully refreshed from Google Patents.
US5890213A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Disk drive with cache having adaptively aged segments
Assignee: Western Digital Corp
•
Filing: 1997-12-03
•
Granted: 1999-03-30
•
Expires: 2017-12-03
Abstract
Abstract A method provides for adaptively aging cache segments in a segmented cache in a disk drive. The disk drive receives commands via an intelligent interface from a host. The drive has a magnetic disk. The cache employs a cache control structure including cache parameters, wherein each segment has a scan count of the number of scans of a segment and an access type, and wherein the cache parameters include a maximum number of misses to indicate the maximum number of times a segment will be scanned without a cache hit. A scan count is maintained for each segment while processing commands from the host. The maximum number of misses is adaptively adjusted based on the access type of the cache segments. The scan count for a segment is compared to the maximum number of misses to determine if the segment should be aged out.
Inventors
- 👤 Daniel John Sokolov
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 13:59
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/06; G06F3/0601; G06F3/0602; G06F3/061; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0862; G06F12/0866; G06F12/0871; G06F12/12; G06F12/121; G06F12/123; G06F3/0628; G06F3/0629; G06F3/0634; G06F3/0668; G06F3/0671; G06F3/0673; G06F3/0674; G06F3/0676; G06F2212/00; G06F2212/60; G06F2212/601; G06F2212/6026
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
152 words
In a disk drive having an intelligent interface for communicating with a host, a magnetic disk, and a cache wherein the cache is divisible into a number of segments, wherein the cache employs a cache control structure including cache parameters, wherein each segment has a scan count of the number of scans of a segment and an access type, and wherein the cache parameters include a maximum number of misses to indicate the maximum number of times a segment will be scanned without a cache hit, a method of adaptively aging cache segments comprising the steps of: a) updating a scan count for each segment while processing commands from the host; b) adaptively adjusting the maximum number of misses based on the access type of the cache segments; and c) comparing the scan count for a segment to the maximum number of misses to determine if the segment should be aged out.
Claim 2
Dependent Claim
152 words
In a disk drive having an intelligent interface for communicating with a host, a magnetic disk, and a cache wherein the cache is divisible into a number of segments, wherein the cache employs a cache control structure including cache parameters, wherein each segment has a scan count of the number of scans of a segment and an access type, and wherein the cache parameters include a maximum number of misses to indicate the maximum number of times a segment will be scanned without a cache hit, a method of adaptively aging cache segments comprising the steps of: a) updating a scan count for each segment while processing commands from the host; b) adaptively adjusting the maximum number of misses based on the access type of the cache segments; and c) comparing the scan count for a segment to the maximum number of misses to determine if the segment should be aged out.
Claim 3
Dependent Claim
29 words
The method of claim 1 wherein the maximum number of misses equals the number of segments plus the number of segments with a sequential access type divided by two.
Claim 4
Dependent Claim
23 words
The method of claim 1 wherein the maximum number of misses is increased if any segments are designated as a sequential access type.
Claim 5
Dependent Claim
30 words
The method of claim 1 wherein the maximum number of misses is equal to the number of cache segments plus the number of segments designated as a sequential access type.
Claim 6
Dependent Claim
75 words
The method of claim 1, wherein the disk drive receives a first command and a second command and wherein the first command requests data with a logical block address range and wherein the second command requests data with a starting logical block address, further comprising the step of determining the second command to be sequential with the first command by checking if the starting logical block address is contiguous with the logical block address range.
Claim 7
Dependent Claim
29 words
The method of claim 1 further comprising the step of aging out the segment if the scan count for a segment is greater than the maximum number of misses.
Claim 8
Dependent Claim
29 words
The method of claim 6 wherein the maximum number of misses equals the number of segments plus the number of segments with a sequential access type divided by two.
Claim 9
Dependent Claim
23 words
The method of claim 6 wherein the maximum number of misses is increased if any segments are designated as a sequential access type.
Claim 10
Dependent Claim
30 words
The method of claim 6 wherein the maximum number of misses is equal to the number of cache segments plus the number of segments designated as a sequential access type.
Claim 11
Dependent Claim
75 words
The method of claim 6, wherein the disk drive receives a first command and a second command and wherein the first command requests data with a logical block address range and wherein the second command requests data with a starting logical block address, further comprising the step of determining the second command to be sequential with the first command by checking if the starting logical block address is contiguous with the logical block address range.
Claim 12
Dependent Claim
37 words
The method of claim 6 wherein the cache parameters further comprise a segment priority list and wherein the step of aging out the segment further comprises placing the segment at the bottom of the segment priority list.
Claim 13
Dependent Claim
29 words
The method of claim 11 wherein the maximum number of misses equals the number of segments plus the number of segments with a sequential access type divided by two.
Claim 14
Dependent Claim
23 words
The method of claim 11 wherein the maximum number of misses is increased if any segments are designated as a sequential access type.
Claim 15
Dependent Claim
30 words
The method of claim 11 wherein the maximum number of misses is equal to the number of cache segments plus the number of segments designated as a sequential access type.
Claim 16
Dependent Claim
75 words
The method of claim 11, wherein the disk drive receives a first command and a second command and wherein the first command requests data with a logical block address range and wherein the second command requests data with a starting logical block address, further comprising the step of determining the second command to be sequential with the first command by checking if the starting logical block address is contiguous with the logical block address range.
Claim 17
Dependent Claim
52 words
The method of claim 11 wherein the cache parameters further comprise an empty flag wherein the step of aging out the segment further comprises setting the empty flag to indicate that the data in the segment is not to be used and to indicate that the segment is available for future use.
Claim 18
Dependent Claim
29 words
The method of claim 16 wherein the maximum number of misses equals the number of segments plus the number of segments with a sequential access type divided by two.
Claim 19
Dependent Claim
23 words
The method of claim 16 wherein the maximum number of misses is increased if any segments are designated as a sequential access type.
Claim 20
Dependent Claim
30 words
The method of claim 16 wherein the maximum number of misses is equal to the number of cache segments plus the number of segments designated as a sequential access type.
Claim 21
Dependent Claim
75 words
The method of claim 16, wherein the disk drive receives a first command and a second command and wherein the first command requests data with a logical block address range and wherein the second command requests data with a starting logical block address, further comprising the step of determining the second command to be sequential with the first command by checking if the starting logical block address is contiguous with the logical block address range.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-03-29 | 2002-09-28 | 2003-03-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-03-29 | 2006-09-28 | 2007-03-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-03-29 | 2010-09-28 | 2011-03-30 | $7700.00 | Window Closed / Lapsed |