Abstract A shared file environment permits multiple users to read a file that is being updated concurrently. The process maintains N level shadows for a file to allow multiple users to read a file even though that file may be updated by one or more updaters in succession. A reader of a file does not need to wait on an updater of the file nor does the reader see any updates as they are being made. Each reader that opens the file sees the latest committed level of the file; that is, if reader A opens the file for read before updater B commits his changes, then there will exist one level shadow for the file after B commits. The process maintains N level shadows for a file, although only one updater of a file is allowed at a time. A new construct, referred to as the Not Available Yet (NAY) structure, contains entries for all files that are currently open for read. The NAY structure has an entry for each level of a file that is open for read. A counter associated with the entry indicates the number of readers of that level of the file. These entries are anchors for a list of block numbers of shadow blocks that cannot be unallocated because there is at least one reader of that level. A logging procedure allocates and unallocates blocks to track the N-level shadow blocks.
In a data processing system supporting a shared file environment in which multiple users may read a file stored in the system concurrently while the file is being updated, the method of N-level file shadowing comprising the steps of: making an entry in a data structure indicating a current level of a file when the file is opened for read by one of said users, said step of making an entry in a data structure generating a record of all readers of any level of the file; allocating a data block for the current level of the file for reading when the current level of the file is first opened for read by one of said users, an allocated data block for reading the file being referred to as a "shadow" block; determining from said data structure whether there are any readers of a prior level of the file and, if there are such readers, chaining shadow blocks for each prior level to maintain N levels of the file in shadow blocks; allocating a data block to contain updates to the file by an updater when a file is opened for write by the updater; performing checkpoints of a current status of the shared file environment and recording said checkpoints in a checkpoint log, said checkpoints serving as snapshots of the system; restarting the data processing system after a shutdown by accessing the checkpoint log and performing recovery processing so that the system appears as it did after a last checkpoint before the shutdown.
Claim 2
Dependent Claim
254 words
In a data processing system supporting a shared file environment in which multiple users may read a file stored in the system concurrently while the file is being updated, the method of N-level file shadowing comprising the steps of: making an entry in a data structure indicating a current level of a file when the file is opened for read by one of said users, said step of making an entry in a data structure generating a record of all readers of any level of the file; allocating a data block for the current level of the file for reading when the current level of the file is first opened for read by one of said users, an allocated data block for reading the file being referred to as a "shadow" block; determining from said data structure whether there are any readers of a prior level of the file and, if there are such readers, chaining shadow blocks for each prior level to maintain N levels of the file in shadow blocks; allocating a data block to contain updates to the file by an updater when a file is opened for write by the updater; performing checkpoints of a current status of the shared file environment and recording said checkpoints in a checkpoint log, said checkpoints serving as snapshots of the system; restarting the data processing system after a shutdown by accessing the checkpoint log and performing recovery processing so that the system appears as it did after a last checkpoint before the shutdown.
Claim 3
Dependent Claim
31 words
The method of claim 1, further comprising the steps of: logging said allocation of said data block; committing updates by said updater; and then logging said allocation of said shadow blocks.