Patent US4601012A successfully refreshed from Google Patents.
US4601012A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Zone partitioning in volume recovery system
Assignee: International Business Machines Corp
•
Filing: 1984-03-06
•
Granted: 1986-07-15
•
Expires: 2004-03-06
Abstract
Abstract In a word processing system storing a text stream on a direct access storage device (DASD) for recall and editing, the text stream is organized into a document, which is stored on the DASD as a data set. The data set consists of an index portion and a portion containing text records. The index portion is divided into nodes, of which the primary node is called the root node. A volume which refers to the full contents of the DASD can be formatted to contain multiple zones, each of which is logically independent of all other zones, when the contents of a storage volume can be divided conceptually into portions the uses of which are logically independent. Each zone has its own media allocation map, and data sets whose root is allocated within a given zone have all allocations within that same zone. If more than one data set with a given data set type exists on the storage volume, all of those data sets and the data set director for that data set type are allocated within a single zone. For each zone, a recovery required indicator is provided so that zones not requiring recovery need not be scanned when volume recovery is being performed. When only one zone is being recovered, the logical sector number of the root node referenced by the index element in the anchor is used to determine whether or not the data set lies in the zone being recovered, and to skip data sets that do not lie in the zone.
Inventors
- 👤 John A. Aiken, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 13:39
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/06; G06F3/0601; G06F16/00; G06F16/90; G06F16/901; G06F16/9017; G06F16/902; G06F3/0602; G06F3/061; G06F3/0611; G06F3/0628; G06F3/0629; G06F3/0631; G06F3/0638; G06F3/0644; G06F3/0668; G06F3/0671; G06F3/0673; G06F3/0674
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
116 words
In a word processing system where a text stream is stored on a direct access storage device and where said text may be selected later for revision, a method for detecting errors in data sets and volume indexes on a storage volume which require recovery before normal access may proceed, said method comprising the steps of: partitioning said storage volume into a plurality of zones; opening a data set on one of said plurality of zones for read/write access; closing said data set on said one of said plurality of zones for read/write access; and recovering each of said plurality of zones by treating each of said plurality of said zones as an independent storage volume.
Claim 2
Dependent Claim
116 words
In a word processing system where a text stream is stored on a direct access storage device and where said text may be selected later for revision, a method for detecting errors in data sets and volume indexes on a storage volume which require recovery before normal access may proceed, said method comprising the steps of: partitioning said storage volume into a plurality of zones; opening a data set on one of said plurality of zones for read/write access; closing said data set on said one of said plurality of zones for read/write access; and recovering each of said plurality of zones by treating each of said plurality of said zones as an independent storage volume.
Claim 3
Dependent Claim
152 words
A method according to claim 1 wherein the step of partitioning said storage volume comprises the steps of: partitioning a media allocation map zone to determine where a partition point lies in media allocation map zone data; inserting a new media allocation map data header at said partition point to create a new zone media allocation map; updating the length of said media allocation map data; transferring a maximum logical sector number for said new zone media allocation map to zone variable information for said new zone media allocation map; calculating and storing a maximum logical sector number for a previous zone and a minimum logical sector number for said new zone; allocating a sector for media allocation map in said new zone; inserting a new index entry for said new media allocation map in said zone; and writing said media allocation map into said storage volume at the allocated logical sector.
Claim 4
Dependent Claim
83 words
A method according to claim 2 wherein the step of partitioning a media allocation map zone comprises the steps of: fetching a zone ending logical sector number; locating a zone; finding a logical sector number and a location corresponding to the start of the next allocation group media allocation map; calculating the number of logical sectors in said new zone; and calculating an offset to the start of the first allocation group for said new zone in said zone media allocation map data.
Claim 5
Dependent Claim
60 words
A method according to claim 2 wherein said allocating step comprises the steps of: locating a zone; checking the availability of an extent at a current logical sector number; marking the extent of said current logical sector number as no longer available subsequent to the determination of extent availability; and signalling a successful extent allocation and terminating said allocate procedure.
Claim 6
Dependent Claim
178 words
A method according to claim 1 wherein the step of opening a data set comprises the steps of: searching the anchor and directory of said storage volume for the existence of a requested data set; obtaining a data set root logical sector number and performing a locate zone procedure subsequent to the determination that a requested data set is in existence; re-searching said anchor subsequent to the determination that said requested data set is not in existence to determine the existence of a data set of the same type as said requested data set; fetching the root node from a data set of the same type subsequent to the determination of the existence of such data set of the same type; locating a zone; creating a new data set and opening said new data set for read/write access; storing a copy of a new root node in a storage access control block; adding said storage access control block to a chain of storage access control blocks; and setting a zone recovery flag in said storage access control block.
Claim 7
Dependent Claim
53 words
A method according to claim 5 wherein the step of closing a data set comprises the steps of: performing data set level operations to close access; removing said storage access control block from said storage access control block chain; fetching a storage access control block chain pointer; and resetting said zone recovery flag.
Claim 8
Dependent Claim
84 words
A method according to claim 1 wherein said recovering step comprises the steps of: locating a first anchor index entry; determining that said first anchor index entry is a true data set; fetching the root node logical sector number of said first anchor index entry; locating a zone; determining that a located zone matches a desired zone; recovering a data set; locating a next anchor index entry; and terminating said recovery zone procedure upon determination that the end of the anchor has been detected.
Claim 9
Dependent Claim
20 words
A method according to claim 1 further comprising the step of accessing said storage volume to obtain volume statistical information.
Claim 10
Dependent Claim
115 words
A method according to claim 8 wherein said storage accessing step comprises the steps of: locating a first anchor index entry; initializing the statistics of said first anchor index entry to zero; fetching a logical sector number for said first anchor index entry; locating the zone of said first anchor index entry; determining whether or not to include said first anchor index entry in a data set counts; including said first anchor index entry in said data set counts subsequent to the determination that a plurality of zones have been specified; locating the next anchor index entry; determining that the end of the anchor has been reached; and performing a media allocation map statistics procedure.
Claim 11
Dependent Claim
129 words
A method according to claim 9 wherein the step of performing a media allocation map statistics procedure comprises the steps of: initializing total sector counts and available sector counts to zero; setting a zone count to "1" upon determination that only a specific zone is to be considered; setting a current zone logical sector number to the initial logical sector number for said zone thereby starting processing of said zone; fetching the status of said logical sector; incrementing total sector count and a current zone logical sector number; incrementing the number of said zone and decrementing the count of said zone subsequent to the determination that said zone has been fully processed; and terminating said media allocation map statistics procedure upon determination that the last zone has been counted.
Claim 12
Independent Claim
41 words
A method according to claims 3, 4, 5, 7 or 9 wherein the locate zone step comprises the steps of: accessing zone variable information; and determining the location in a unit control block storage of requested zone media allocation map data.
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) | 1989-07-14 | 1990-01-13 | 1990-07-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-07-14 | 1994-01-13 | 1994-07-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-07-14 | 1998-01-13 | 1998-07-15 | $7700.00 | Window Closed / Lapsed |