variable-level backup scheduling method and apparatus

Abstract: The variable-level backup scheduling method employs a schedule in which backups are performed at set times but the level of backup performed is determined from the condition of the system at the time of backup. Under this method, user-supplied parameters stored in level-tables allow a determination of the appropriate level of backup to be performed. If the data in the scheduled level of backup has not been modified in a sufficient amount under the supplied parameters, then the backup scheduling method determines whether a specified higher level backup is appropriate. If the evaluation of the higher level backup results in a determination that not enough data has been modified, the next level is evaluated. This process continues until the criteria for backup have been met or the level that has been predetermined to be the least amount of data to be saved has been reached.

Description: FIELD OF THE INVENTION This invention relates generally to computer systems, and more particularly to performing efficient data backups on computer systems. BACKGROUND OF THE INVENTION In a computer system, it is important that the data structure and content can be rebuilt in the event of a system failure. In order to accomplish this, a copy of the data, called a backup copy, is made. The backup copy is generally made on a medium, such as computer tape, which is stored away from the computer system. When the system fails, the data needed to bring the system back up can be restored from the backup copy. Generally, multiple levels of backup copies are made over time to provide efficient protection of a computer system. A full level backup, which copies all the data in the system, is made only occasionally because a full level backup is lengthy and interrupts system operation. Partial backups, in which only some files are copied, are performed more frequently. Each volume of copied data is called a save set. In a multiple level backup method, the present or near-present state of the computer system is typically stored in a collection of many save sets composed of a full level backup and many partial backups. Potentially, all of these save sets must be installed into the computer for a complete restoration of the system. While multiple level backup method efficiently saves system data, restoring the system after failure can be a long process if a large number of save sets must be used. Data backups are usually scheduled for times when the system is most quiescent and the backup will be less likely to interfere with normal processing. Some current multiple level backup methods simply perform full backups at fixed predefined times regardless of whether the majority of the data has been modified since the last full backup. The data is simply copied again in order to coalesce data for recovery into fewer save sets, thereby keeping the number of save sets manageable and reducing the amount of time needed to perform a full recovery in the case of full system failure. A constraining factor in the length of time between each full backup is the number of tapes required for a full recovery of all data. The more backup tapes that have to be located and mounted for a full recovery of the system, the longer that recovery will take. Even partial recoveries of specific files can be lengthy if the files to be recovered are spread over too many tapes. As the size of a file system increases, the amount of time to produce a full backup increases. This often leads to scheduling full backups, and even partial backups of more than one day's work, further and further apart. In spite of the search for ways to decrease backup time, rigid schedules of backing up specific levels of data are adhered to for the following reasons: specific days and times of day when resources are most quiescent are determined and used so that backup does not interfere with regular processing any more than possible; rigid schedules enforce discipline, so that data is regularly and systematically backed up; and, rigid schedules enable automated initiation, further enforcing discipline and relieving human operators from the necessity to manually initiate backups. The dilemma of efficient backups, where few full saves and many partial saves are performed, and efficient system recoveries, where many full saves and few partial saves are performed, is usually resolved in favor of backup time. It remains desirable to have a way to efficiently perform computer system backups so that recovery time is minimized in the event of failure of the computer system. SUMMARY OF THE INVENTION The problems of performing efficient, scheduled backups of data in a computer system are solved by the present invention of a variable-level backup scheduling method. The invention in its broad form resides in a method of providing back-up data in a computer system and an apparatus therefor, as recited in claims 1 and 5 respectively. The variable-level backup scheduling method, as described hereinafter, employs a schedule in which backups are preferably performed at set times but the level of backup performed is advantageously determined from the condition of the system at the time of backup. Under this method, user-supplied parameters allow a determination of the appropriate level of backup to be performed. If the data in the scheduled level of backup has not been modified or deleted in a sufficient amount under the supplied parameters, then the backup scheduling method determines whether a specified higher level backup is appropriate. If the evaluation of the higher level backup results in a determination that not enough data has been modified, the next level is evaluated. This process continues until the criteria for backup have been met or the level that has been predetermined to be the least amount of data to be saved has been reached. With variable-level backup scheduling, a determination is made as to how much data needs to be backed up. If enough data in the save set in question remains unmodified and therefore does not need to be replicated, a decision is made to backup less data, involving less time, less consumption of resources, and less impact to online operations on the data in question. For example, the variable-level backup scheduling method determines whether or not the time to recopy the unmodified data contained on the previous full backup is justified or not. If a full backup is not justified, some higher-numbered level will be performed that will involve copying less data and will take less time. The variable-level backup scheduling method gives the ability to automatically adjust the normally-scheduled level to a different level, involving less data, with the decision being based upon user-supplied criteria. At the same time, this method stays within the time-constrained boundaries usually imposed by rigid schedules in that it never spends more time, copying more data than, anticipated. Rather, it often spends less time than anticipated, as it detects that lesser amounts of data are all that really needs to be re-copied. The result will often be less time spent backing up data with the knowledge that the previous save sets contain enough unmodified data to justify their continued existence. Never is more data backed up than anticipated. When the previous save sets have reached a user-specified level of fragmentation or percentage of no longer relevant data, the normally scheduled level will be performed in its normal time slot. For file systems in which a great percentage of the data is unused most of the time, this can greatly relieve time-constrained backups of any large system. For hierarchical storage systems, migrating huge amounts of data from more expensive and faster storage to less expensive and slower storage, this can be of even greater significance. BRIEF DESCRIPTION OF THE DRAWINGS A more detailed understanding of the invention can be had from the following description of preferred embodiments, give by way of example, and to be understood in conjuction with the accompanying drawings, wherein: FIG. 1 is computer system having variable-level backup capability; FIG. 2 shows the level of data backed up in full and partial level backups; FIG. 3 is an exemplary backup schedule; FIG. 4 is an exemplary level-table for level 0; FIG. 5 is a second exemplary backup schedule; FIG. 6 is an exemplary level-table for levels 2 - 9; FIG. 7 is a flow chart of the variable-level backup scheduler; and FIG. 8 is a third exemplary backup schedule for a second alternative embodiment of the invention. DETAILED DESCRIPTION FIG. 1 shows a computer system 100 having a variable-level backup scheduler 103. The computer system 100 has a computer 105 connected to a network 110. The computer 105 has a CPU 115, a memory 120 and storage 125 such as a hard drive and the variable-level backup scheduler 103. The variable-level backup scheduler includes parameter tables 130. A tape drive 135 and an array of disks 137 are connected to the computer 105. Connected to the network 110 is a storage device 140. Typically when a computer data system is backed up, the data stored on the system, in devices such as the hard drive 125 and the array of disks 137, is stored in a medium which can be preserved away from the computer system such as a computer tape produced in the tape drive 135. In the present embodiment of the invention, the save sets created during a backup may be stored on tape in the tape drive 135 or over the network onto the storage device 140. In alternative embodiments, many more devices, both computers and storage devices, could be connected to the network 110 and the backup apparatus 103 could control the backups of some or all of the devices on the network 110. It is also possible to connect to other networks where storage devices could reside. The present embodiment of the invention employs a backup schedule where full and partial backups are scheduled at regular intervals. However, depending upon supplied parameters stored in the parameter tables 130, the scheduler 103 can determine that a level involving replication of less data can be performed, depending upon on the amount of unmodified data. The system administrator decides the parameters indicating that the normally scheduled backup is not necessary and some intermediate level of backup is more appropriate. FIG. 2 illustrates full and partial level backups as they are used in operating systems such as the UNIX operating system. FIG. 2 shows the level of data backed up in a partial exemplary schedule for full and partial level backups. The level 0 backup on the first Sunday of the schedule backs up all data since the installation of the system. The level 7 backup on the first Monday backs up all data since the time of the most recent lower level, that is, since the level 0 backup on Sunday. The level 7 backup on the first Tuesday also backs up all data since the time of the most recent lower level, the level 0 backup on Sunday. The level 7 backup on Tuesday includes the data backed up in the level 7 backup on Monday effectively coalescing the data into a single save set. The level 8 backup on the first Wednesday backs up all data since the time of the most recent lower level, the level 7 backup on Tuesday. The backups continue in like manner until the second Sunday when a level 1 backup is performed which backs up all data since the time of the most recent lower level, the level 0 of the previous Sunday, which coalesces the save sets of the whole week into one level 1 save set. In an exemplary backup schedule, shown in a table in FIG. 3, a full backup is made on the first Sunday of the month. On each succeeding Sunday for the next three weeks, a save of one higher-numbered level is made. All of the data modified during each week is saved and coalesced into one save set. During Monday through Saturday, no more than three save sets are added to the accumulation of save sets that are needed for system recovery. By the twenty-eighth day of the schedule, seven save sets are needed to perform a full recovery (levels 0, 1, 2, 3, 7, 8 and 9). If there is a fifth Sunday in the month, a level 4 backup will be taken, making eight save sets for a full recovery just before a full backup is made on the first Sunday of the next period. In the above schedule, without the present invention of variable-level backup scheduling, a full backup is made on the first Sunday, regardless of how much data is unmodified since the previous full save set. The variable-level backup scheduler 103 makes decisions, based upon the tables of preselected parameters 130, about what level of save should be performed. The variable-level backup apparatus determines whether the originally scheduled level of save or a higher-numbered level involving less data should be performed. The parameter tables 130 consist of a series of level-tables, one for each level in the backup schedule, with each level-table containing entries for that level and any other levels that it may invoke. The tables may be implemented in a variety of ways. Among the parameters which may be used are the percent of unmodified bytes of the total file system (pct), the number of unmodified bytes (nbytes), the age of the previous save set, and the next level save to perform. An exemplary level table for a backup level 0 is shown in FIG. 4. Using the level table in FIG. 4, when a full (level 0) backup is scheduled, the previous level 0 save set must contain at least 50% unmodified data or 100 gigabytes (107,374,182,400 bytes) of unmodified data and be less than 1 year old (355 days) before a level 1 will be performed. Otherwise, a level 0 will be performed as scheduled. If the criteria are met, the next entry for level 1, dictates that the level will not be incremented any further and a level 1 backup will be made in place of the level 0 backup. A second exemplary schedule is shown in FIG. 5. The only difference between the second exemplary schedule and the exemplary schedule shown in FIG. 3 is that the Sunday backup levels higher than zero have been incremented by one, leaving no scheduled level 1. Using the second exemplary schedule without implementing the variable-level backup scheduler will produce the same results as the first exemplary schedule. However, employing variable-level backup scheduling with the level table shown in FIG. 4 and similar level-tables results in a different and more efficient backup. The remaining level tables are shown in FIG. 6. The tables in FIG. 6 will result in the execution of the level already scheduled in the backup schedule. In the second exemplary backup schedule and the parameter tables from FIG. 4 and FIG. 6, only the level 0 backup will be affected by variable-level backup scheduling. The variable-level backup scheduling method is shown in the flow chart in FIG. 7. After reading in the information concerning the date and time of each previous level backup, block 705, the variable-level backup scheduler examines each directory of the file to be backed up, block 710, computing the number of bytes that are still unmodified in each level. The scheduler then compares the amount of file data to the parameters in the level tables, block 715. If the unmodified data is less the parameters in the tables for the scheduled level, decision block 720, the scheduler invokes a backup command at the scheduled level, block 725. If the unmodified data is greater than or equal to the parameters in the level table, decision block 720, the scheduler goes to the next level for further determination, block 730. If the next level is the highest level allowed in the particular point in the schedule, decision block 735, a backup at that level will be performed without further examination of the parameters, block 725. If it is not the predefined highest level, decision block 735, then the scheduler will repeat the step of comparing the file data with the parameters from the level tables for the new level, block 715. If the unmodified data is less than the parameters in the level table, decision block 720, a backup will be performed, block 725. If the unmodified data is greater than or equal to the parameters, decision block 720, the scheduler will move to the next level, block 730. The steps in comparing and determining whether a backup should be performed and moving to the next level will be repeated until the file data and parameters from the level tables determine the proper level of backup or until the predetermined highest level of backup is reached and then the determined backup will be performed. It is possible that this example would result in one extra save set over the number of save sets which would result without using the present invention in order to do a full recovery of the computer system. However, if 50 percent of the data (or 100 gigabytes) remains unmodified for a year, that 50% or more of data will not be recopied for that year. At the same time, the levels 2 - 5 saves will never contain more data or take any longer than previously, i.e., they will always contain only one week's modifications. However, if the level 0 save set reaches the specified level of fragmentation, the level 0 backup will be executed in its normal date/time slot, thereby defragmenting the save sets. In a second alternative embodiment of the invention, levels 2-5 in the schedule of FIG. 5 could be changed to levels 3-6, and the level 0 level-table changed as shown in FIG. 8. At the cost of another extra save set, if at least 75 percent (or 150 gigabytes) of the data to be saved by a level 0 (at least 50 percent or 100 gigabytes on the previous level 0 and at least 25 percent or 50 gigabytes on the previous level 1) is contained on the previous levels 0 and 1 save sets, a level 2 backup will be performed to save the remainder rather than re-saving the large amount of unmodified data that is already backed up. Otherwise the appropriate level, either 0 or 1 depending upon the level-table criteria, will be performed. When there is no "previous level" save set, the backup level in the schedule is performed. In the second alternative embodiment of the invention, there are at most 10 save sets needed to perform a full recovery, with either at least 75 percent of the data or at least 150 gigabytes of that data being contained in the first 2 save sets. It is to be understood that the above-described embodiments are simply illustrative of the principles of the invention. Various and other modifications and changes may be made by those skilled in the art which will embody the principles of the invention and fall within the scope thereof. For instance, many variations may be made upon the backup schedule and the level-tables. The scheduler may be implemented in any type of operating system and in conjunction with other backup methods.

Claims: A method of backing up data in a computer system, comprising: establishing a plurality of backup levels, each said backup level having an associated criterion for performing a backup of said backup level, and each said backup level having an established set of data to be written to a backup storage apparatus during performance of a backup at said backup level; testing said associated criteria against changes in data stored in the computer system; and performing a backup at a selected backup level by writing said established set of data to said backup storage apparatus, said selected backup level being selected by said testing. The method of claim 1 wherein said associated criterion is a level-table. The method of claim 1 wherein the step of testing said associated criterion further comprises: determining the amount of unmodified data in the computer system in response to date and time information from previous backups. The method of claim 2 wherein the step of testing said associated criterion further comprises: comparing changes in data stored in the computer system with parameters in said level-table. An apparatus to back up a computer system, comprising: means for establishing a plurality of backup levels, each said backup level having associated criteria for performing a backup of said backup level, and each said backup level having an established set of data to be written to a backup storage apparatus during performance of a backup at said backup level; means for testing said associated criteria against changes in data stored in the computer system; and means for performing a backup at a selected backup level by writing said established set of data to said backup storage apparatus, said selected backup level being selected by said testing. The apparatus of claim 5 wherein said associated criteria is a level-table. The apparatus of claim 5 wherein said backup storage apparatus is a tape drive. The apparatus of claim 5 wherein said backup storage apparatus is a storage device connected to the computer system across a network. A method of backing up a computer as in claim 1, wherein said step of testing comprises: reading in date and time information from previous backups; reading in the current backup level; determining the amount of unmodified data in the computer system in response to the date and time information; comparing the amount of unmodified data in the computer system to parameters in a level-table for a scheduled level; wherein said step of performing a backup comprises: invoking a backup command at the scheduled level if the amount of unmodified data is less than parameters in said level-table; and moving to a next backup level if the amount of unmodified data is not less than parameters in said level-table. The method of claim 9 further comprising the steps of: repeating the steps of comparing unmodified data and moving to a next backup level until a predefined highest level is reached; and invoking the backup command at said predefined highest level. The method of claim 9 further comprising the step of storing backed up data from the computer system on a storage device connected to the computer system by a network.

Inventors: SAXON PAUL DAVID, SAXON, PAUL DAVID
Applicants: COMPAQ COMPUTER CORP, COMPAQ COMPUTER CORPORATION
Application year: 1996
Main classification: G06F11
IPC codes: G06F11