Patent US5765204A successfully refreshed from Google Patents.
US5765204A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for adaptive localization of frequently accessed, randomly addressed data
Assignee: International Business Machines Corp
•
Filing: 1996-06-05
•
Granted: 1998-06-09
•
Expires: 2016-06-05
Abstract
Abstract A method and apparatus are provided for adaptive localization of frequently accessed, randomly addressed data in a direct access storage device (DASD) to achieve improved system access performance. At selected sampling intervals, a DASD storage controller analyzes data access patterns based on frequency of access, identifies a remapping algorithm to remap the logical groups to physical groups, and moves the physical groups according to the identified remapping algorithm. The data reordering on the DASD provides frequently accessed data in close proximity so that seek time is minimized. The adaptive data localization method periodically performed by the storage controller is transparent to the host file system. The reordering of the data on the DASD is performed during periods of low system data transfer activity.
Inventors
- 👤 Brian Eric Bakke
- 👤 Frederic Lawrence Huss
- 👤 Daniel Frank Moertl
- 👤 Bruce Marshall Walk
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 20:52
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G06; G06F; G06F3/00; G06F3/06; G06F3/0601; G06F3/0602; G06F3/061; G06F3/0628; G06F3/0638; G06F3/0668; G06F3/0671; G06F3/0673; G06F3/0674
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
131 words
A method for adaptive localization of frequently accessed, randomly addressed data in a direct access storage device (DASD) comprising the steps of: identifying frequency of access to a plurality of logical groups during a sampling interval; said logical groups being mapped to physical groups in the direct access storage device (DASD); selecting a localization point in the direct access storage device (DASD); sorting the plurality of logical groups based on the identified frequency of access; creating a new optimized logical group to physical group map based on the sorted plurality of logical groups; creating a delta map between a current logical group to physical group map and the new optimized logical group to physical group map; and moving a number of logical groups in the delta map to new physical groups.
Claim 2
Independent Claim
131 words
A method for adaptive localization of frequently accessed, randomly addressed data in a direct access storage device (DASD) comprising the steps of: identifying frequency of access to a plurality of logical groups during a sampling interval; said logical groups being mapped to physical groups in the direct access storage device (DASD); selecting a localization point in the direct access storage device (DASD); sorting the plurality of logical groups based on the identified frequency of access; creating a new optimized logical group to physical group map based on the sorted plurality of logical groups; creating a delta map between a current logical group to physical group map and the new optimized logical group to physical group map; and moving a number of logical groups in the delta map to new physical groups.
Claim 3
Dependent Claim
51 words
A method for adaptive localization of frequently accessed, randomly addressed data as recited in claim 1 wherein said step of selecting said localization point in the direct access storage device (DASD) includes the step of selecting a physical location in the DASD where a data transfer rate is a maximum value.
Claim 4
Dependent Claim
46 words
A method for adaptive localization of frequently accessed, randomly addressed data as recited in claim 1 wherein said step of selecting said localization point in the direct access storage device (DASD) includes the step of selecting a middle physical location in the DASD physical address space.
Claim 5
Dependent Claim
63 words
A method for adaptive localization of frequently accessed, randomly addressed data as recited in claim 1 wherein said step of selecting said localization point in the direct access storage device (DASD) includes the step of selecting a function specific boundary in the DASD physical address space; said function specific boundary being located adjacent a frequently accessed area in the DASD physical address space.
Claim 6
Dependent Claim
58 words
A method for adaptive localization of frequently accessed, randomly addressed data as recited in claim 1 further includes the step of identifying a low DASD data transfer activity level; and wherein said step of sorting the plurality of logical groups based on the identified frequency of access is responsive to said identified low DASD data transfer activity level.
Claim 7
Dependent Claim
65 words
A method for adaptive localization of frequently accessed, randomly addressed data as recited in claim 1 wherein said step of creating the new optimized logical group to physical group map based on the sorted plurality of logical groups includes the steps of locating most frequently accessed data closest to the selected localization point and least frequently accessed data further away from the selected localization point.
Claim 8
Dependent Claim
56 words
A method for adaptive localization of frequently accessed, randomly addressed data as recited in claim 1 wherein said step of creating the new optimized logical group to physical group map based on the sorted plurality of logical groups includes the step of separating data into clusters of logical groups which vary in magnitude of access frequency.
Claim 9
Dependent Claim
37 words
A method for adaptive localization of frequently accessed, randomly addressed data as recited in claim 7 further includes the step of inserting free space between said clusters of logical groups which vary in magnitude of access frequency.
Claim 10
Dependent Claim
50 words
A method for adaptive localization of frequently accessed, randomly addressed data as recited in claim 7 wherein said step of separating data into clusters of logical groups which vary in magnitude of access frequency includes packing said clusters of logical groups in a continuum without free space between said clusters.
Claim 11
Dependent Claim
73 words
A method for adaptive localization of frequently accessed, randomly addressed data as recited in claim 1 wherein said step of creating the new optimized logical group to physical group map based on the sorted plurality of logical groups includes the step of locating most frequently accessed data on both sides of said localization point, and locating less frequently accessed data on both sides of said localization point further away from said localization point.
Claim 12
Dependent Claim
51 words
A method for adaptive localization of frequently accessed, randomly addressed data as recited in claim 1 wherein said step of identifying frequency of access to a plurality of logical groups during a sampling interval includes the step of applying a weighting factor for historical access activity and the current sampling interval.
Claim 13
Dependent Claim
139 words
Apparatus for adaptive localization of frequently accessed, randomly addressed data in a direct access storage device (DASD) comprising: means for identifying frequency of access to a plurality of logical groups during a sampling interval; said logical groups being mapped to physical groups in the direct access storage device (DASD); means for selecting a localization point in the direct access storage device (DASD); means for sorting the plurality of logical groups based on the identified frequency of access; means for creating a new optimized logical group to physical group map based on the sorted plurality of logical groups; means for creating a delta map between a current logical group to physical group map and the new optimized logical group to physical group map; and means for moving a number of logical groups in the delta map to new physical groups.
Claim 14
Dependent Claim
139 words
Apparatus for adaptive localization of frequently accessed, randomly addressed data in a direct access storage device (DASD) comprising: means for identifying frequency of access to a plurality of logical groups during a sampling interval; said logical groups being mapped to physical groups in the direct access storage device (DASD); means for selecting a localization point in the direct access storage device (DASD); means for sorting the plurality of logical groups based on the identified frequency of access; means for creating a new optimized logical group to physical group map based on the sorted plurality of logical groups; means for creating a delta map between a current logical group to physical group map and the new optimized logical group to physical group map; and means for moving a number of logical groups in the delta map to new physical groups.
Claim 15
Dependent Claim
49 words
Apparatus for adaptive localization of frequently accessed, randomly addressed data as recited in claim 12 wherein said means for selecting said localization point in the direct access storage device (DASD) includes means for selecting a physical location in the DASD where a data transfer rate is a maximum value.
Claim 16
Dependent Claim
44 words
Apparatus for adaptive localization of frequently accessed, randomly addressed data as recited in claim 12 wherein said means for selecting said localization point in the direct access storage device (DASD) includes means for selecting a middle physical location in the DASD physical address space.
Claim 17
Dependent Claim
61 words
Apparatus for adaptive localization of frequently accessed, randomly addressed data as recited in claim 12 wherein said means for selecting said localization point in the direct access storage device (DASD) includes means for selecting a function specific boundary in the DASD physical address space; said function specific boundary being located adjacent a frequently accessed area in the DASD physical address space.
Claim 18
Dependent Claim
56 words
Apparatus for adaptive localization of frequently accessed, randomly addressed data as recited in claim 12 further includes means for identifying a low DASD data transfer activity level; and wherein said means for sorting the plurality of logical groups based on the identified frequency of access is responsive to said identified low DASD data transfer activity level.
Claim 19
Dependent Claim
65 words
Apparatus for adaptive localization of frequently accessed, randomly addressed data as recited in claim 12 wherein said means for creating the new optimized logical group to physical group map based on the sorted plurality of logical groups includes means for locating most frequently accessed data closest to the selected localization point and for locating least frequently accessed data further away from the selected localization point.
Claim 20
Dependent Claim
54 words
Apparatus for adaptive localization of frequently accessed, randomly addressed data as recited in claim 12 wherein said means for creating the new optimized logical group to physical group map based on the sorted plurality of logical groups includes means for separating data into clusters of logical groups which vary in magnitude of access frequency.
Claim 21
Dependent Claim
72 words
Apparatus for adaptive localization of frequently accessed, randomly addressed data as recited in claim 12 wherein said means for creating the new optimized logical group to physical group map based on the sorted plurality of logical groups include means for locating most frequently accessed data on both sides of said localization point, and for locating less frequently accessed data on both sides of said localization point further away from said localization point.
Claim 22
Dependent Claim
49 words
Apparatus for adaptive localization of frequently accessed, randomly addressed data as recited in claim 12 wherein said means for identifying frequency of access to a plurality of logical groups during a sampling interval includes means for applying a weighting factor for historical access activity and the current sampling interval.
Claim 23
Dependent Claim
188 words
A computer program product for use in a computer system having a storage processor for adaptive localizing frequently accessed, randomly addressed data in a direct access storage device (DASD), the computer program product comprising: a recording medium; means, recorded on the recording medium, for identifying frequency of access to a plurality of logical groups during a sampling interval; said logical groups being mapped to physical groups in the direct access storage device (DASD); means, recorded on the recording medium, for selecting a localization point in the direct access storage device (DASD); means, recorded on the recording medium, for sorting the plurality of logical groups based on the identified frequency of access; means, recorded on the recording medium, for creating a new optimized logical group to physical group map based on the sorted plurality of logical groups; means, recorded on the recording medium, for creating a delta map between a current logical group to physical group map and the new optimized logical group to physical group map; and means, recorded on the recording medium, for moving a number of logical groups in the delta map to new physical groups.
Claim 24
Dependent Claim
188 words
A computer program product for use in a computer system having a storage processor for adaptive localizing frequently accessed, randomly addressed data in a direct access storage device (DASD), the computer program product comprising: a recording medium; means, recorded on the recording medium, for identifying frequency of access to a plurality of logical groups during a sampling interval; said logical groups being mapped to physical groups in the direct access storage device (DASD); means, recorded on the recording medium, for selecting a localization point in the direct access storage device (DASD); means, recorded on the recording medium, for sorting the plurality of logical groups based on the identified frequency of access; means, recorded on the recording medium, for creating a new optimized logical group to physical group map based on the sorted plurality of logical groups; means, recorded on the recording medium, for creating a delta map between a current logical group to physical group map and the new optimized logical group to physical group map; and means, recorded on the recording medium, for moving a number of logical groups in the delta map to new physical groups.
Claim 25
Dependent Claim
63 words
A computer program product for adaptive localization of frequently accessed, randomly addressed data as recited in claim 21 wherein said means, recorded on the recording medium, for moving said number of logical groups in the delta map to said new physical groups includes means for identifying a minimum number of physical groups greater than a threshold position difference for moving a logical group.
References Cited (Backward Citations)
US4435752A
Cited
JPS57207969A
Cited
US4680703A
Cited
US5021946A
Cited
US5390327A
Cited
US5584018A
Cited
US5440686A
Cited
US5581736A
Cited
US5664187A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-06-08 | 2001-12-08 | 2002-06-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-08 | 2005-12-08 | 2006-06-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-08 | 2009-12-08 | 2010-06-09 | $7700.00 | Window Closed / Lapsed |