US 5,649,152 AGrant
Method and System for Providing a Static Snapshot of Data Stored on a Mass Storage System
Issue Date:1997-07-15
•25 Claims
•5 Drawing Sheets
Abstract
A system and method for providing a static snapshot, or image, of data stored on a mass storage system are disclosed. First, a preservation memory is cleared and a virtual device is created. Whenever a write is to be performed on the mass storage system, a check is made of the preservation memory to determine if it contains a block associated with the mass storage write address. If there is not, a copy of the block in the mass storage system at the block write address is placed in the preservation memory. Whenever a read is to be performed on the virtual device, a check is made of the preservation memory to determine if it contains a block associated with the virtual device read address. If there is such a block, that block is returned as the result of the virtual device read. Otherwise, the block at the virtual device block read address is returned as the result.
Metadata
Assignee
- Vinca Corporation
Inventors
- Richard S. Ohran
- Michael R. Ohran
Application Information
Application Number:US 3226972
Filing Date:1994-10-13
Priority Date:1994-10-13
Art Unit:235
Classifications
IPC:
G06F 1200G06F 1208
Field of Search:
395371412;413;417;419;462;441;440;488;489;183.18;468;469;470;492;182.03;182.0410.2
Patent Drawings (5 sheets)
Description
Microfiche Appendix
This specification includes a MICROFICHE APPENDIX which is intended to be a part of the disclosure herein. The MICROFICHE APPENDIX contains 2 pages of microfiche and a total of 105 frames. The MICROFICHE APPENDIX includes computer source code used in the implementation of one preferred embodiment of the invention.
Background of the Invention
1. Field of the Invention
This invention relates to mass storage systems for digital computers, and in particular to a method for providing a static snapshot or image of a mass storage system.
2. Description of Related Art
It is desirable during the operation of a computer system with a mass storage system, such as a magnetic disk, to periodically make a backup copy of the data stored on the mass storage system to allow for recovery in the event of a failure of the mass storage system. This is commonly done by reading the data stored on the mass storage system and writing it to a magnetic tape.
However, if the data stored on the mass storage system is being updated by other programs as the backup copy is being made, the image of the data on the mass storage system written to tape may be inconsistent. This is because normal backup techniques either copy the blocks from the mass storage system sequentially to the linear-access tape, or walk the file system stored on the mass storage system, starting with the first block of the first file in the first directory and proceeding in order to the last block of the last file of the last directory. The backup program is not aware of updates performed to a block of the mass storage system after that block has been written to tape.
This problem of inconsistent data being written to tape is particularly likely to occur if the mass storage system is being used by a database management system, where an update may involve changing information stored on different parts of the mass storage system. If a database update is made while the backup tape is being written, the image of the database management system written to tape will have the old values for any data already written to tape at the time of the database update, and the new values for any data written to tape following the database update. A restoration based on the tape image of the database would yield an inconsistent database.
Horton et al., U.S. Pat. No. 5,089,958, which is hereby incorporated by reference in its entirety for the material disclosed therein, discloses a technique for producing an image of a mass storage system at any point in time after the technique is started. This is done by establishing a base image of the mass storage system at the start of the technique and a log indicating each change made to the mass storage system. An image at any point in time can then be produced by starting with the base image and making all the changes indicated in the log up to that point in time. To improve performance, the Horton system also provides for differential images so that the compilation of changes to form an image does not have to start with the base image.
There are two difficulties with using the technique of Horton to provide an image for backup operations. First, the technique is not designed to provide a static snapshot or image of the mass storage system, but to allow an image from any point in time to be created at some later time. This increases the complexity of the technique and requires the compilation of changes whenever a virtual image is desired.
The second difficulty with using the technique of Horton is that the log must store a copy of each change made to the mass storage system in order to produce an image of the mass storage system as it was at a specified time. This means that the size of the log can grow without bound, eventually exhausting the space available for its storage. At this point, updates to the mass storage system are not possible without compromising the ability to produce an image from any previous point in time.
With many database systems or file systems, certain key blocks (such as master directory blocks) are frequently updated, perhaps with every update to any other block. A copy of these blocks must be written to the log each time they are changed. This will, of course, result in a very large log file, with many of the entries being copies of the key blocks as they changed over time.
Another approach to creating a static image of a mass storage system is possible if the mass storage system has the ability to produce a mirror, or identical copy, of one disk's data on a second disk. At the time the static image is needed, mirroring of data is stopped and the mirror disk is used as the static image. When the static image is no longer necessary (for example, when the tape backup has been completed), the two disks are resynchronized, by copying any changes made during the time mirroring was not active to the mirror disk, and mirroring is resumed.
This approach also has problems. Unless there are three or more disks mirroring the information on the main disk, when mirroring is stopped to produce the static image there is no longer the redundancy of mirrored disk or disks and updates can be lost if there is a disk failure. Furthermore, it requires an entire disk to be devoted to the storage of the static image.
But the major disadvantage of this mirror disk approach is the time necessary to restart mirroring after the static image is no longer needed. This requires updating the mirror disk with all the changes that have been made since mirroring was stopped. If a log of these changes is not available, this means that all the data on the mirror disk must be copied from the disk which has been updated. For large disks such as would be found on a database system, this could take many hours.
Summary of the Invention
It is an object of this invention to provide a static image of data stored on a mass storage system as it existed at a particular point in time.
This is accomplished by creating a virtual device that will appear as a mass storage device containing the static image. Write operations to the mass storage system are also intercepted by the method. Copies of blocks on the mass storage system are placed in a preservation memory whenever they are going to be changed by a write operation, unless an entry for that block is already in the preservation memory. During a read of the virtual device, the preservation memory is first checked, either directly or using a table of contents of the preservation memory, to see if it contains a copy of the block from the specified location. If the preservation memory has such a copy, that copy is returned as the result of the read. Otherwise, the block is read from the mass storage system.
It is a further object of the invention to reduce the amount of storage required to provide the static image. The technique of Horton requires the storage of all changes from the time the technique is started. The mirror disk technique requires storage equal to the size of the mass storage being imaged. In contrast, the method of the invention only requires storage equal to the number of mass storage blocks that have been changed since the static image was created.
It is a further object of the invention to reduce the time necessary for generating the static image and for returning to normal operation when the static image is no longer needed. Unlike the technique of Horton, where the static image at a particular time needs to be compiled from the base image and log entries, all that is necessary for creating a static image using the method of this invention is to create the virtual device and establish the interception of writes to the mass storage system. No copying of data or compilation of an image is necessary.
When the static image is no longer necessary, the virtual device is removed from the system and the contents of the preservation memory deleted if recovery of that space is desirable. No synchronization to the mass storage system is necessary nor is it necessary to merge updates into a base image to create a new base image.
These and other features of the invention will be more readily understood upon consideration of the attached drawings and of the following detailed description of those drawings and the presently preferred embodiments of the invention.
Brief Description of the Drawings
FIG. 1 is a block diagram of a representative digital computer configuration on which the preferred embodiment of the invention operates.
FIG. 2 is a flow diagram showing the preferred steps of the method of the invention.
FIG. 3 is a block diagram of a client-server configuration using the preferred method.
FIG. 4 is a block diagram of the currently-preferred embodiment of the method in a client-server configuration.
FIG. 5 is variant of the configuration of FIG. 4.
Detailed Description of the Invention
Referring to FIG. 1, which illustrates a representative computer configuration on which the method of the invention runs, it can be seen that digital computer 102 has connected to it mass storage system 104 and preservation memory 106. In some embodiments of the invention, association memory 108 may also be connected to digital computer 102.
Mass storage system 104 can be any writable block-addressable storage system, such as one or more disks or a partition of a disk. (If mass storage system 104 were not writable, such as a CD-ROM, its contents would not change and there would be no need for the invention of this application.) A partition of a disk can be a fixed area of a disk. The disks can store their information using magnetic, optical, or any other technique that allows writing and reading of data without departing from the scope and spirit of this invention.
In the currently-preferred embodiment of the invention, digital computer 102 is a PC-compatible computer based on an Intel X86 series or compatible processor and mass storage device 104 is a SCSI or IDE magnetic disk connected to digital computer 102 through an appropriate controller.
Preservation memory 106 can be an area in the random-access memory (RAM) of digital computer 102, one or more disks, a partition of a disk, or a file stored on a disk. Optimal selection of the implementation of preservation memory 106 depends of the number of blocks of the mass storage system that will be changed during the time the static image is needed. The use of RAM provides faster performance, but may limit the number of entries in the preservation memory. If the preservation memory runs out of space when a new entry must be stored, the method fails and the static image is no longer available or remains in the state it was at the time the preservation memory ran out of space. It is important to note that if this occurs, no data from the mass storage, system is lost, and the method can be restarted to produce a new static image.
Referring to FIG. 2, which is a flow diagram showing the steps of the method, the method starts at step 202 when a static image of the mass storage system is desired. This can be indicated by the running of a special program, an operating system call, or an operator command, as appropriate for the operating system and application.
In step 202, preservation memory 106 is cleared. In general, this will consist of setting the control information describing the contents of preservation memory 106 to indicate that there are no valid entries in preservation memory 106.
In step 204, a virtual device appearing as a mass storage device is created. The method for creating a virtual device will depend on the particular operating system running on digital computer 102, but will be known by one skilled in the art of that particular operating system. In addition, it may be necessary in step 204 to configure the operating system so that the method of this invention intercepts any read or write operation directed to mass storage system 104. Again, how this is done will be dependent on the particular operating system running on digital computer 102.
In step 206, the method waits until there is a write operation directed to mass storage system 104 or a read operation directed to the virtual device created in step 204. In variants of the method, step 206 also reacts to a read operation directed to mass storage system 104 or a write operation directed to the virtual device created in step 204.
If the operation is a write to mass storage system 104, step 210 is entered. Using the mass storage write address specified in the write operation, step 210 determines if there is a block of data associated with that mass storage write address in preservation memory 106. If there isn't, step 212 of the method is executed. Otherwise, step 212 is skipped and step 214 is executed.
There are a number of ways for determining whether there is a block of data associated with the mass storage address in the preservation memory 106. In the currently-preferred embodiment of the invention, there is a block association memory 108 also connected to digital computer 102. (Block association memory 108 may be a separate memory connected to digital computer 102, or may be a portion of the RAM of digital computer 102.) Block association memory 108 is used to associate blocks stored in preservation memory 106 with the unique addresses of blocks on mass storage system 104. Block association memory 108 does this by containing entries indicating a unique address and the location in preservation memory 106 for the block associated with that unique address.
Entries in block association memory 108 can be stored unordered, in which case they must be linearly searched for a matching unique address. If no entry is found with a matching address, there is not a block in preservation memory 106 associated with that address. Alternatively, the entries could be stored ordered by unique addresses, in which case a binary search could be used to locate the matching entry in block association memory 108. A hashing scheme could also be used to find a matching entry.
The block association memory 108 can also be organized as an array with an element for each unique address of mass storage system 104. Each element of the array stores a preservation memory location, or a special value that indicates that there is not a block in preservation memory 106 associated with that unique address.
The selection of a technique for storing entries in block association memory 108 depends on the characteristics of accessing the entries. Using an array provides the highest speed for accessing an entry or adding an entry corresponding to a block just copied into preservation memory 106, at the expense of a large block association memory 108. Ordering the entries by unique address provides faster access than for unordered entries, but requires more time when an entry is added to block association memory 108. In the currently-preferred embodiment, entries are stored unordered in block association memory 108.
In this discussion, the term block refers to the data stored at a particular location in mass storage system 104 or preservation memory 106. Blocks are generally of a fixed size (e.g. 512 bytes for disks used with MS-DOS), although blocks of different sizes, or variable sizes, are within the scope of this invention. On mass storage system 104, each block has a unique address, specified in read or write operations. A block in preservation memory 106 is a copy of a block of data stored in mass storage system 104, and that block in preservation memory 106 is associated with the unique address of the block in mass storage system 104 of which it is a copy.
For efficiency, it may be convenient to treat one or more contiguous blocks on mass storage system 104 as if it were a single, large block. Often operating systems perform their mass storage operations on contiguous blocks (called clusters in MS-DOS). The extensions to handle clusters of blocks should be clear to one with ordinary skills in computer programming.
If block association memory 108 is being used, step 202 (clearing preservation memory 106) consists of removing all entries from block association memory 108 or setting them to the special entry that indicates that there is no block in preservation memory 106 associated with each unique address.
Returning to FIG. 2, step 212 is executed if there is not a block associated with the mass storage write address in preservation memory 106. Step 212 places a copy of the block of data currently located at the mass storage write address in preservation memory 106, updating block association memory 108 as necessary. It is important to note that step 212 will be executed at most once for each unique address on mass storage system 104, since the next time step 210 tests to see if there is a block in preservation memory 106 associated with that mass storage write address it will find the copy made by step 212. Because of this, preservation memory 106 will contain only copies of blocks as they were when the method was started.
In step 214, the data to be written by the mass storage write operation is written to the location on mass storage system 104 specified by the mass storage write address. This completes the steps for a mass storage write, and step 206 is reentered to wait for the next operation.
If the operation is a virtual device read, step 220 is entered. Again, a check is made to determine if a block associated with the virtual device read address is in preservation memory 106. If there is such a block, step 224 is executed. If not, step 222 is executed.
Step 222 returns the data from the block in mass storage system 104 specified by the virtual device read address as the result of the read operation. Step 224 returns the block from preservation memory 106 associated with the virtual address read address as the result of the read operation. This completes the steps for a virtual device read, and step 206 is reentered to wait for the next operation.
If the operation is a mass storage read, step 230 is entered, which returns the data from the block of mass storage system 104 specified by the mass storage read address as the result of the read operation. This completes the steps for a mass storage read, and step 206 is reentered to wait for the next operation.
It may be desirable to allow write operations to the virtual device, changing the image as specified by the write operations. For example, it may be necessary to write a different label or other control information on the virtual device image so the operating system can differentiate it from mass storage system 104.
If the operation is a virtual device write, step 240 is entered. Step 240 checks to see if the virtual device is read-only, and if it is step 242 is entered to return an appropriate error indication to the operating system or user.
Step 244 checks to determine if a block associated with the virtual device write address is in preservation memory 106. If there is such a block, step 248 is executed. If not, step 246 is executed. In step 246, the data from the virtual device write operation is placed in preservation memory 106, associated with the virtual device write address from the virtual device write operation. Block association memory 108 is updated as necessary. In step 248, the data from the virtual device write operation replaces the block associated with the virtual device write address of the virtual device write operation. This completes the steps of the virtual device write, and step 206 is reentered to wait for the next operation.
While the description above describes the basic operation of the method of the invention, there are a number of other embodiments possible. For example, the same preservation memory 106 can be shared so that a second virtual device provides a snapshot image of a second mass storage system. In another embodiment, a second preservation memory and second virtual device can be used to provide a second image whose snapshot was taken at a different time of mass storage system 104.
The computer system running the method of the invention can also be used as a file server for client computers connected to it by a network or other means. As a file server, it can export its mass storage system, the virtual device created by the method, or both. Such a system is illustrated in FIG. 3.
File server computer 312, with mass storage system 314, runs the method of the invention. It exports the virtual device (and probably mass storage system 314) to client computer 302, communicating over network 300. Computer 302 can run a tape backup program that copies the information from the exported virtual device to tape drive 304. No change is necessary for the tape backup program running on client computer 302, which sees the virtual device as Just another mass storage device.
FIG. 4 illustrates the currently-preferred configuration for running the method of the invention. Network 400 connects client computer 402, with tape drive 404, to file server computer 412, with mass storage system 414. File server computer communicates with standby server computer 422 over data link 420. Standby server computer 422 has mass storage system 424. Through software running on file server computer 412 and standby server computer 422, as described in U.S. patent application Ser. No. 08/094,744, filed on Jul. 20, 1993 and entitled "METHOD FOR RAPID RECOVERY FROM A NETWORK FILE SERVER FAILURE" (which is hereby incorporated by reference in its entirety), mass storage system 424 appears as a disk to file server computer 412 and mirrors the data on mass storage system 414. In the event of a failure of either file server computer 412 or mass storage system 414, standby computer 422 can be restarted as the file server.
In the configuration of FIG. 4, standby server 422 runs the method of the invention, and can export the virtual device either to file server computer 412, which can then export it to client computers on network 400, or standby server 422 can directly export the virtual device to client computers. The virtual device can also be accessed by programs running on standby server 422.
FIG. 5 illustrates a variant of the configuration of FIG. 4. Instead of client computer 502 having a tape drive, as was the case for client computer 402, backup computer 532 has tape drive 534. Backup computer 532 communicates with standby server computer 522 over data link 530. Standby server computer exports mass storage system 524 to file server computer 512 (whether mirrored or not). Standby server computer exports the virtual device with the snapshot image of mass storage system 524 to backup computer 532.
Backup computer 532 can now copy the snapshot image of mass storage system 524 by reading the virtual device exported to it by standby server computer 522. Neither file server computer 512 nor standby server computer 522 has the overhead of the tape backup process, which can result in a degradation of performance if data compression needs to be performed before the data is written to tape. Also, a fault in the tape backup program will not affect either file server computer 512 or standby server computer 522.
It is to be understood that the above described embodiments are merely illustrative of numerous and varied other embodiments which may constitute applications of the principles of the invention. Such other embodiments may be readily devised by those skilled in the art without departing from the spirit or scope of this invention and it is our intent they be deemed within the scope of our invention.
Claims
We claim:
1. A method for providing a static snapshot of data used by a computer configuration including: a digital computer executing the steps of the method; a mass storage system connected to said digital computer, said mass storage system storing blocks of data each located at a unique mass storage write address; and a preservation memory connected to said digital computer and used for storing a copy of any of said blocks of data, each of said copies being associated with one of said unique addresses; the method comprising the steps of: (A) clearing said preservation memory so that no copies of blocks of data are in said preservation memory; (B) creating a virtual device; (C) whenever a write operation to said mass storage system occurs, and said write operation specifies one of said unique write addresses for receiving at that unique address of the mass storage system a new block of data to be written to said mass storage system, then (1) if and only if there is not already found within the preservation memory a copy of a block of data associated with said unique mass storage write address, then placing in said preservation memory a copy of the block of data located in said mass storage system at said unique mass storage write address prior to writing the new block of data in said mass storage system at that same address; and (2) writing said new block of data to said mass storage system at the location specified by said unique mass storage write address only after the preceding step (1) has been performed at least once for a given unique mass storage write address; and (D) whenever a read operation to said virtual device occurs, and said read operation specifies a virtual device read address, then (1) if there is not a copy of a block of data associated with said virtual device read address in said preservation memory, then returning in response to said read operation said block of data associated with said virtual read address from said mass storage system; and (2) if there is a copy of a block of data associated with said virtual device read address in said preservation memory, then returning in response to said read operation said copy of the block of data associated with said virtual device read address in said preservation memory.
2. A method as in claim 1, wherein said mass storage system comprises one or more disks.
3. A method as in claim 1, wherein said mass storage system is a partition of a disk.
4. A method as in claim 1, wherein said preservation memory is a random-access memory.
5. A method as in claim 1, wherein said preservation memory is one or more disks.
6. A method as in claim 1, wherein said preservation memory is a partition of a disk.
7. A method as in claim 1, wherein said preservation memory is a file stored on mass storage system.
8. A method as in claim 1 further comprising the steps of: (E) whenever a write operation to said virtual device occurs, and said write operation specifies a virtual device write address and a new block of data to be written to said virtual device, then (1) if there is not a copy of a block of data associated with said virtual device write address in said preservation memory, placing in said preservation memory said new block of data to be written to said virtual device; and (2) if there is a copy of a block of data associated with said virtual device write address in said preservation memory, replacing in said preservation memory said copy of the block of data associated with said virtual device write address with said new block of data to be written to said virtual device.
9. A method as in claim 1 further comprising the steps of: (E) whenever a read operation to said mass storage system occurs, and said read operation specifies a unique mass storage read address, then returning as the result of said read operation a block of data located in said mass storage system at said unique mass storage read address.
10. A method as in claim 1, said computer configuration further including a block association memory, said block association memory used to associate said copies of blocks stored in said preservation memory with said unique addresses.
11. A method as in claim 10, wherein said block association memory contains entries, each entry indicating a unique address in said mass storage system and a location in said preservation memory of a copy of a block associated with said unique address.
12. A method as in claim 11, wherein said copies of blocks of data in said preservation memory are associated with a unique address by searching said block association memory entries for a matching address.
13. A method as in claim 12, wherein there is not a copy of a block of data associated with an address if there is no entry in said block association memory with a matching address.
14. A method as in claim 11, wherein said block association memory contains an entry for each unique address in said mass storage system.
15. A method as in claim 14, where a special value for said preservation memory location in one of said entries indicates that there is not a copy of a block of data in said preservation memory associated with the unique address indicated by said one of said entries.
16. A method as in claim 1, wherein said digital computer acts as a file server, and said virtual device is exported to other computers.
17. A method as in claim 16, wherein said mass storage system is exported to other computers.
18. A method as in claim 1, said computer configuration further including a second mass storage system storing blocks of data each located at a unique storage write address, and the method further comprising the steps of: (E) creating a second virtual device in addition to the virtual device created in step (B); (F) whenever a write operation to said second mass storage system occurs, and said write operation specifies a unique mass storage write address of the second mass storage system and a new block of data to be written to said second mass storage system, then (1) if and only if there is not already found within the preservation memory a copy of a block of data associated with said unique mass storage write address of the second mass storage system, then placing in said preservation memory a copy of the block of data located in said second mass storage system at said unique mass storage write address of the second mass storage system; and (2) writing said new block of data to said second mass storage system at the location specified by said unique mass storage write address of the second mass storage system only after the preceding step (F)(1) has been performed at least once for a given unique mass storage write address of the second mass storage system; and (G) whenever a read operation to said second virtual device occurs., and said read operation specifies a second virtual device read address, then (1) if there is not a copy of a block of data associated with said second virtual device read address in said preservation memory, then returning in response to said read operation said block of data associated with said second virtual device read address from said second mass storage system; and (2) if there is a copy of a block of data associated with said second virtual device read address in said preservation memory, then returning in response to said read operation said copy of the block of data associated with said second virtual device read address in said preservation memory.
19. A method as in claim 1, said computer configuration further including a second preservation memory, and the method further comprising the steps of: (E) creating a second virtual device in addition to the virtual device created in step (B); (F) whenever a write operation to said mass storage system occurs, and said write operation specifies a unique mass storage write address and a new block of data to be written to said unique mass storage system, then (1) if and only if there is not already found within the second preservation memory a copy of a block of data associated with said unique mass storage write address, then placing in said second preservation memory a copy of the block of data located in said mass storage system at said unique mass storage write address; and (2) writing said new block of data to said mass storage system at the location specified by said unique mass storage write address only after the preceding step (F)(1) has been performed at least once for a given unique mass storage write address; and (G) whenever a read operation to said second virtual device occurs, and said read operation specifies a second virtual device read address, then (1) if there is not a copy of a block of data associated with said second virtual device read address in said second preservation memory, then returning in response to said read operation said block of data associated with said second virtual read address from said mass storage system; and (2) if there is a copy of a block of data associated with said second virtual device read address in said second preservation memory, then returning in response to said read operation said copy of the block of data associated with said second virtual device read address in said second preservation memory.
20. A system for providing a static snapshot of data comprising: a mass storage system for storing blocks of data each located at a unique mass storage write address; a preservation memory used for storing a copy of any of said blocks of data, each of said copies being associated with one of said unique addresses; and a digital computer connected to said mass storage system and to said preservation memory, said digital computer being programmed so as to comprise: (A) means for clearing said preservation memory so that no copies of blocks of data are in said preservation memory; (B) means for creating a virtual device; (C) means for creating a static snapshot of the data blocks of said mass storage system whenever a write operation to said mass storage system occurs, and said write operation specifies one of said unique write addresses for receiving at that unique address of the mass storage system a new block of data to be written to said mass storage system, by performing the steps of: (1) if and only if there is not already found within the preservation memory a copy of a block of data associated with said unique mass storage write address, then placing in said preservation memory a copy of the block of data located in said mass storage system at said unique mass storage write address prior to writing the new block of data in said mass storage system at that same address; and (2) writing said new block of data to said mass storage system at the location specified by said unique mass storage write address only after the preceding step (1) has been performed at least once for a given unique mass storage write address; and (D) means for outputting data blocks of the static snapshot whenever a read operation to said virtual device occurs, and said read operation specifies a virtual device read address, by performing the steps of: (1) if there is not a copy of a block of data associated with said virtual device read address in said preservation memory, then returning in response to said read operation said block of data associated with said virtual read address from said mass storage system; and (2) if there is a copy of a block of data associated with said virtual device read address in said preservation memory, then returning in response to said read operation said copy of the block of data associated with said virtual device read address in said preservation memory.
21. A method for providing a static snapshot of data used by a computer configuration including: a digital computer executing the steps of the method; a mass storage system connected to said digital computer, said mass storage system storing blocks of data each located at a unique mass storage write address; and a preservation memory connected to said digital computer and used for storing a copy of any of said blocks of data, each of said copies being associated with one of said unique addresses; the method comprising the steps of: (A) clearing said preservation memory so that no copies of blocks of data are in said preservation memory; (B) creating a virtual device; (C) whenever a write operation to said mass storage system occurs, and said write operation specifies one of said unique write addresses for receiving at that unique address of the mass storage system a new block of data to be written to said mass storage system, then (1) if and only if there is not already found within the preservation memory a copy of a block of data associated with said unique mass storage write address, then placing in said preservation memory a copy of the block of data located in said mass storage system at said unique mass storage write address prior to writing the new block of data in said mass storage system at that same address; and (2) writing said new block of data to said mass storage system at the location specified by said unique mass storage write address only after the preceding step (1) has been performed at least once for a given unique mass storage write address; and (D) whenever a read operation to said virtual device occurs, and said read operation specifies a virtual device read address, then (1) if there is not a copy of a block of data associated with said virtual device read address in said preservation memory, then returning in response to said read operation said block of data associated with said virtual read address from said mass storage system; (2) if there is a copy of a block of data associated with said virtual device read address in said preservation memory, then returning in response to said read operation said copy of the block of data associated with said virtual device read address in said preservation memory; (E) whenever a write operation to said virtual device occurs that specifies a virtual device write address and data to be written, performing the following: (1) if there is not a copy of a block of data associated with said virtual device write address in said preservation memory, placing in said preservation memory said new block of data to be written to said virtual device; and (2) if there is a copy of a block of data associated with said virtual device write address in said preservation memory, replacing in said preservation memory said copy of the block of data associated with said virtual device write address with said new block of data to be written to said virtual device; and (F) whenever a read operation to said mass storage system occurs, and said read operation specifies a unique mass storage read address, then returning as the result of said read operation a block of data located in said mass storage system at said unique mass storage read address.
22. A system for providing a static snapshot of data comprising: digital computer for executing the steps Of a programmable method; a mass storage system connected to said digital computer, said mass storage system storing blocks of data each located at a unique mass storage write address; and a preservation memory connected to said digital computer and used for storing a copy of any of said blocks of data, each of said copies being associated with one of said unique addresses; and wherein the programmable method is comprised of the steps of: (A) clearing said preservation memory so that no copies of blocks of data are in said preservation memory; (B) creating a virtual device; (C) whenever a write operation to said mass storage system occurs, and said write operation specifies one of said unique write addresses for receiving at that unique address of the mass storage system a new block of data to be written to said mass storage system, then (1) if and only if there is not already found within the preservation memory a copy of a block of data associated with said unique mass storage write address, then placing in said preservation memory a copy of the block of data located in said mass storage system at said unique mass storage write address prior to writing the new block of data in said mass storage system at that same address; and (2) writing said new block of data to said mass storage system at the location specified by said unique mass storage write address only after the preceding step (1) has been performed at least once for a given unique mass storage write address; and (D) whenever a read operation to said virtual device occurs, and said read operation specifies a virtual device read address, then (1) if there is not a copy of a block of data associated with said virtual device read address in said preservation memory, then returning in response to said read operation said block of data associated with said virtual read address from said mass storage system; (2) if there is a copy of a block of data associated with said virtual device read address in said preservation memory, then returning in response to said read operation said copy of the block of data associated with said virtual device read address in said preservation memory; (E) whenever a write operation to said virtual device occurs, and said write operation specifies a virtual device write address and a new block of data to be written to said virtual device, then (1) if there is not a copy of a block of data associated with said virtual device write address in said preservation memory, placing in said preservation memory said new block of data to be written to said virtual device; and (2) if there is a copy of a block of data associated with said virtual device write address in said preservation memory, replacing in said preservation memory said copy of the block of data associated with said virtual device write address with said new block of data to be written to said virtual device; and (F) whenever a read operation to said mass storage system occurs, and said read operation specifies a unique mass storage read address, then returning as the result of said read operation a block of data located in said mass storage system at said unique mass storage read address.
23. In a computer system having a processor, a mass storage system for storing blocks of data in response to write operations, and a preservation memory means, a method of providing a static snapshot of the mass storage system at a particular point in time so that said static snapshot does not change even though the contents of said mass storage system change, the method comprising the steps of: clearing the preservation memory means so that the preservation memory means is ready to preserve data blocks of said mass storage system: preserving a snapshot of the mass storage system at a particular point in time by executing at least the following steps: (1) when a data block is to be over-written by a new data block at said same write address, checking said preservation memory means to determine if the data block specified by said address has already been stored in the preservation memory means; (2) if and only if said data block has already been stored in said preservation memory means, performing the over-write operation so that said new data block replaces the data block at said address; and (3) if the data block that is to be overwritten has not been already stored in said preservation memory means, preserving the data block by first copying said data block into said preservation memory means prior to performing the over-write operation, thereby permitting said mass storage system to be updated as each data block is preserved at a given snapshot moment in the preservation memory means.
24. A system for providing a static snapshot of a mass storage system at a particular point in time so that said static snapshot does not change even though the contents of said mass storage system subsequently change, said system comprising: a mass storage system for storing a plurality of data blocks, each of said plurality of data blocks being specified by a unique write address; preservation memory means for storing the data blocks of said mass storage system so as to store a static snapshot of the mass storage system at a particular point in time; and processor means for (1) identifying whether each data block of said mass storage system has been preserved in said preservation memory means, for (2) ensuring that each data block of said mass storage system is copied to said preservation memory means the first time said data block is to be over-written by a new data block when said static snapshot of said mass storage system is taken, and for (3) writing a new data block to said mass storage system without first preserving said data block if said data block has already been preserved in said preservation memory means.
25. An article of manufacture for use in a computer system comprising a processor, a mass storage means and a preservation memory means, said article of manufacture comprising: a computer readable medium for storing programmable code means thereon to be executed by said processor: and programmable code means stored on said computer readable medium for causing said processor to perform at least the following steps when the computer readable medium is used to program said processor; (A) clearing the preservation memory means so that the preservation memory means is ready to preserve data blocks of said mass storage system; (B) preserving each original data block which exists at a given snapshot moment and which is specified by a write address on said mass storage system by executing at least the following steps: (1) when an original data block is to be over-written by a new data block at said same write address, checking said preservation memory means to determine if the original data block specified by said address has already been stored in the preservation memory means; (2) if and only if said original data block has already been stored in said preservation memory means, performing the over-write operation so that said new data block replaces the data block at said address; and (3) if the original data block that is to be overwritten has not been already stored in said preservation memory means, preserving the original data block by first copying said original data block into said preservation memory means prior to performing the over-write operation, thereby permitting said mass storage system to be updated as each original data block is preserved at a given snapshot moment in the preservation memory means.
Patent Citations (148)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3054560 | 1962-09-01 | Hartley | |
| US3303474 | 1967-02-01 | Moore et al. | |
| US3444528 | 1969-05-01 | Lovell et al. | |
| US3533082 | 1970-10-01 | Schnabel et al. | |
| US3544477 | 1970-12-01 | Heller | |
| US3557315 | 1971-01-01 | Kobus et al. | |
| US3602900 | 1971-08-01 | Delaigue et al. | |
| US3623014 | 1971-11-01 | Doelz et al. | |
| US3636331 | 1972-01-01 | Amrehn | |
| US3665173 | 1972-05-01 | Bouricius et al. | |
| US3681578 | 1972-08-01 | Stevens | |
| US3725861 | 1973-04-01 | Hancock | |
| US3735356 | 1973-05-01 | Yates | |
| US3754211 | 1973-08-01 | Rocher et al. | |
| US3760364 | 1973-09-01 | Yamauchi et al. | |
| US3761884 | 1973-09-01 | Avsan et al. | |
| US3771137 | 1973-11-01 | Barner et al. | |
| US3803568 | 1974-04-01 | Higashide | |
| US3810119 | 1974-05-01 | Zieve et al. | |
| US3810121 | 1974-05-01 | Chang et al. | |
| US3812469 | 1974-05-01 | Hauck et al. | |
| US3820085 | 1974-06-01 | Zelinski | |
| US3824547 | 1974-07-01 | Green et al. | |
| US3828321 | 1974-08-01 | Wilber et al. | |
| US3864670 | 1975-02-01 | Inoue et al. | |
| US3865999 | 1975-02-01 | Spitaels | |
| US3889237 | 1975-06-01 | Alferness et al. | |
| US3959638 | 1976-05-01 | Blum et al. | |
| US4012717 | 1977-03-01 | Censler et al. | |
| US4051461 | 1977-09-01 | Hashimoto et al. | |
| US4073005 | 1978-02-01 | Parkin | |
| US4076961 | 1978-02-01 | Holsinger et al. | |
| US4099241 | 1978-07-01 | Ossfeldt | |
| US4118772 | 1978-10-01 | Takada | |
| US4141066 | 1979-02-01 | Keiles | |
| US4152764 | 1979-05-01 | Conners et al. | |
| US4156901 | 1979-05-01 | Haraden et al. | |
| US4159517 | 1979-06-01 | Paradine et al. | |
| US4164017 | 1979-08-01 | Randall | |
| US4191996 | 1980-03-01 | Chesley | |
| US4208715 | 1980-06-01 | Kumahara et al. | |
| US4228503 | 1980-10-01 | Waite et al. | |
| US4257009 | 1981-03-01 | Yorkanis | |
| US4270167 | 1981-05-01 | Koehler et al. | |
| US4282572 | 1981-08-01 | Moore, III et al. | |
| US4318173 | 1982-03-01 | Freedman et al. | |
| US4332027 | 1982-05-01 | Malcolm et al. | |
| US4351023 | 1982-09-01 | Richer | |
| US4358823 | 1982-11-01 | McDonald et al. | |
| US4359718 | 1982-11-01 | Payen | |
| US4371754 | 1983-02-01 | De et al. | |
| US4378588 | 1983-03-01 | Katzman et al. | |
| US4380047 | 1983-04-01 | Eisenhard et al. | |
| US4380067 | 1983-04-01 | Beardsley et al. | |
| US4402046 | 1983-08-01 | Cox et al. | |
| US4403286 | 1983-09-01 | Fry et al. | |
| US4403303 | 1983-09-01 | Howes et al. | |
| US4423414 | 1983-12-01 | Bryant et al. | |
| US4428044 | 1984-01-01 | Liron | |
| US4430699 | 1984-02-01 | Segarra et al. | |
| US4434487 | 1984-02-01 | Rubinson et al. | |
| US4439859 | 1984-03-01 | Donnan | |
| US4445214 | 1984-04-01 | Reynolds et al. | |
| US4453215 | 1984-06-01 | Reid | |
| US4455601 | 1984-06-01 | Griscom et al. | |
| US4455645 | 1984-06-01 | Mijioka et al. | |
| US4459658 | 1984-07-01 | Gabbe et al. | |
| US4471429 | 1984-09-01 | Porter et al. | |
| US4477882 | 1984-10-01 | Schumacher et al. | |
| US4477895 | 1984-10-01 | Casper et al. | |
| US4479214 | 1984-10-01 | Ryan | |
| US4480304 | 1984-10-01 | Carr et al. | |
| US4483001 | 1984-11-01 | Ryan | |
| US4484275 | 1984-11-01 | Katzman et al. | |
| US4486826 | 1984-12-01 | Wolff et al. | |
| US4498145 | 1985-02-01 | Baker et al. | |
| US4507751 | 1985-03-01 | Gawlick et al. | |
| US4516121 | 1985-05-01 | Moriyama et al. | |
| US4521847 | 1985-06-01 | Ziehm et al. | |
| US4530051 | 1985-07-01 | Johnson et al. | |
| US4530052 | 1985-07-01 | King et al. | |
| US4562535 | 1985-12-01 | Vincent et al. | |
| US4581701 | 1986-04-01 | Hess et al. | |
| US4583089 | 1986-04-01 | Cope | |
| US4589090 | 1986-05-01 | Downing et al. | |
| US4590554 | 1986-05-01 | Glazer et al. | |
| US4604690 | 1986-08-01 | Crabtree | |
| US4607365 | 1986-08-01 | Greig et al. | |
| US4608688 | 1986-08-01 | Hansen et al. | |
| US4610013 | 1986-09-01 | Long et al. | |
| US4615001 | 1986-09-01 | Hudgins et al. | |
| US4623883 | 1986-11-01 | Konen | |
| US4628508 | 1986-12-01 | Sager et al. | |
| US4630224 | 1986-12-01 | Sollman | |
| US4639852 | 1987-01-01 | Motomiya | |
| US4639856 | 1987-01-01 | Hrustich et al. | |
| US4644470 | 1987-02-01 | Feigenbaum et al. | |
| US4646300 | 1987-02-01 | Goodman et al. | |
| US4648031 | 1987-03-01 | Jenner | |
| US4648061 | 1987-03-01 | Foster | |
| US4652940 | 1987-03-01 | Sumiyoshi | |
| US4654819 | 1987-03-01 | Stiffler | |
| US4654846 | 1987-03-01 | Goodwin et al. | |
| US4654857 | 1987-03-01 | Samson et al. | |
| US4656596 | 1987-04-01 | Thaden et al. | |
| US4674038 | 1987-06-01 | Brelsford et al. | |
| US4680581 | 1987-07-01 | Kozlik et al. | |
| US4691314 | 1987-09-01 | Bergins et al. | |
| US4703421 | 1987-10-01 | Abrant et al. | |
| US4703481 | 1987-10-01 | Fremont | |
| US4713811 | 1987-12-01 | Frey | |
| US4727516 | 1988-02-01 | Yoshida et al. | |
| US4736339 | 1988-04-01 | Crabbe, Jr. | |
| US4740969 | 1988-04-01 | Fremont | |
| US4750177 | 1988-06-01 | Hendrie et al. | |
| US4754397 | 1988-06-01 | Varaiya et al. | |
| US4800488 | 1989-01-01 | Agrawal et al. | |
| US4823256 | 1989-04-01 | Bishop et al. | |
| US4866707 | 1989-09-01 | Marshall et al. | |
| US4878167 | 1989-10-01 | Kapulka et al. | |
| US4941087 | 1990-07-01 | Kap | |
| US4953122 | 1990-08-01 | Williams | |
| US4959768 | 1990-09-01 | Gerhart | |
| US4959774 | 1990-09-01 | Davis | |
| US4979108 | 1990-12-01 | Crabbe, Jr. | |
| US5005122 | 1991-04-01 | Griffin et al. | |
| US5038278 | 1991-08-01 | Steely, Jr. et al. | |
| US5060185 | 1991-10-01 | Naito et al. | |
| US5079740 | 1992-01-01 | Patel et al. | |
| US5086502 | 1992-02-01 | Malcolm | |
| US5123099 | 1992-06-01 | Shibata et al. | |
| US5157663 | 1992-10-01 | Major et al. | |
| US5235700 | 1993-08-01 | Alaiwan et al. | |
| US5276867 | 1994-01-01 | Kenley et al. | |
| US5295258 | 1994-03-01 | Jewett et al. | |
| US5307481 | 1994-04-01 | Shimazaki et al. | |
| US5343477 | 1994-08-01 | Yamada | |
| US5403639 | 1995-04-01 | Belsan et al. | |
| US5410667 | 1995-04-01 | Belsan et al. | |
| US5426747 | 1995-06-01 | Weinreb et al. | |
| US5435004 | 1995-07-01 | Cox et al. | |
| US5455932 | 1995-10-01 | Major et al. | |
| US5513314 | 1996-04-01 | Kandasamy et al. | |
| US5515502 | 1996-05-01 | Wood | |
| US5530855 | 1996-06-01 | Satoh et al. | |
| US5537533 | 1996-07-01 | Staheli et al. | |
| US5537585 | 1996-07-01 | Blickenstaff et al. | |
| US5544347 | 1996-08-01 | Yanai et al. |
Non-Patent Literature (2)
- Lyon, J. "Tandem's Remote Data Facility," IEEE, Spring 1990.
- Moline, H. et al., "Issues in Disater Recovery," IEEE, Spring 1990.