Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1997-12-12
2001-10-16
Alam, Hosain T. (Department: 2171)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C711S114000
Reexamination Certificate
active
06304880
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates in general to data storage and processing, and more particularly reclamation of data storage space.
2. Description of Related Art
In hierarchical computer storage systems, intensively used and fast memories are paired with arrays of slower and less frequently accessed data devices. One example of high-speed, expensive memory is a direct access storage device file buffer (DASD). Slower memory devices include tape drives and disk drive arrays, which are less expensive than a DASD.
One such hierarchical storage system is a virtual tape storage system (VTS). A VTS includes an array of tape devices, for example, an IBM® 3590 tape cartridge. During operation, the VTS is writing data from a host to the numerous tape devices on the system. Eventually, many of the volumes of data expire, and will not be accessed in the future. A volume may expire because an expiration time or date was assigned to the volume at creation, or a volume may expire because the volume is replaced by a more recent version stored on the system. As volumes expire, some tapes are left containing only a small fraction of data that is still current. Therefore, many computer storage systems perform a periodic reclamation process. A reclamation process is used to clear out storage space that contains only a few current files, consolidating those files in another location, leaving the tapes to be assigned as a scratch tape to receive new data. After current files are copied to a new location, a storage manager is updated as to the new locations of the volumes. Now, the tapes can be written over with entirely new data.
Reclamation processes and systems are also called garbage collectors, especially when referring to systems that consolidate storage space in object-oriented program-controlled systems.
A common garbage collector uses a mark phase to mark all objects that should be saved from the storage space. Then, all objects are sequentially examined in a sweep phase. Objects that are not marked are deleted and objects that are marked are unmarked and saved. This marked/sweep garbage collector stops all other activity while it is running. The time required for the mark/sweep garbage collector to complete its tasks is significant and unpredictable. Therefore, this type of mark/sweep garbage collector is difficult to use with systems that have real-time constraints. The uncontrolled time delay while the garbage collector runs is unacceptable.
One way to address the problem of conflicts with customer use of data and reclamation processing is to increase the speed of the reclamation process. However, conflicts still arise between the operation demands and the reclamation demands even when the time of reclamation processing is shortened.
One method for automatic memory reclamation within an object-oriented system reduces the number of conflicts by making reclamation processing time more predictable. Within this system, reclamation tasks are broken up into cycles that are equal to a predetermined amount of time. Each task comprises a non-decomposable task that can be performed within the predetermined amount of time. Thus, the scheduling of the task segments is controlled, so that garbage collection is less obtrusive to the system.
One problem with this system is that it does not take into account the amount of remaining storage space. If available storage space is exhausted while a customer program is running, the program will fail. It is important that reclamation processing keeps up with the demand for new storage space, in order to prevent the failure of programs. It is more preferable that the program operation is delayed by reclamation processing than that the program crashes due to lack of storage space.
The virtual tape system includes a library manager that allows the customer to set times during which reclamation does not occur. This allows the customer to prioritize certain activities that they do not wish to be delayed by reclamation activities. However, excessive interference between the reclamation processing and customer VTS usage can occur.
It can be seen that there is a need for automated reclamation scheduling that takes into account the amount of remaining available storage space in a virtual tape server. It can also be seen that there is a need for a system that is capable of overriding customer reclamation time preferences, in order to ensure that operation will continue smoothly.
SUMMARY OF THE INVENTION
To overcome the limitations in the prior art described above, and to overcome other limitations that will be apparent upon reading and understanding the present specification, the present invention discloses a method for managing reclamation scheduling and a system for storage reclamation management.
The method of the present invention is for managing storage reclamation on a virtual tape server having a plurality of tape devices, a library manager, and a number of scratch tapes. The method includes the steps of receiving reclamation-off time from the library manager, determining a number of scratch tapes, and setting a reclamation schedule dependent on the number of scratch tapes. The reclamation schedule may be set by overriding the reclamation-off time to perform frequent reclamations when the number of tapes is below a first threshold. The schedule may also be determined by performing reclamation according to the reclamation-off times, when the number of tapes is at or above the first threshold and below a second threshold. Additionally, if the number of tapes is at or above the second threshold, so that ample storage space is available, reclamation may be performed according to the reclamation-off times when the VTS is not occupied.
A storage reclamation management system on a virtual tape server is also described herein. The system includes a plurality of tape devices, a library manager that has a setting for reclamation-off times, and a storage manager that includes a reclamation subsystem that operates on a reclamation schedule depending on the number of scratch tapes available.
These and other advantages and features of novelty which characterize the invention are pointed out with particularity in the claims annexed hereto and form a part of this application. However, for a better understanding of the invention, its advantages, and the objects obtained by its use, reference should be made to the drawings which form a further part of this application, and to accompanying descriptive matter in which there are illustrated and described specific examples of an apparatus in accordance with the invention.
REFERENCES:
patent: 4667421 (1987-05-01), White
patent: 4814971 (1989-03-01), Thatte
patent: 4853842 (1989-08-01), Thatte et al.
patent: 4989134 (1991-01-01), Shaw
patent: 5008786 (1991-04-01), Thatte
patent: 5088036 (1992-02-01), Ellis et al.
patent: 5287459 (1994-02-01), Gniewek
patent: 5398142 (1995-03-01), Davy
patent: 5438674 (1995-08-01), Keele et al.
patent: 5475834 (1995-12-01), Anglin et al.
patent: 5485613 (1996-01-01), Engelstad et al.
patent: 5613082 (1997-03-01), Brewer et al.
patent: 5664146 (1997-09-01), Bolin et al.
patent: 5805864 (1998-09-01), Carlson et al.
patent: 5808821 (1998-09-01), Davy
patent: 5809511 (1998-09-01), Peake
patent: 5845297 (1998-12-01), Grimsrud et al.
Alam Hosain T.
Altera Law Group LLC
Fleurantin Jean Bolte
International Business Machines - Corporation
LandOfFree
Automated reclamation scheduling override in a virtual tape... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Automated reclamation scheduling override in a virtual tape..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automated reclamation scheduling override in a virtual tape... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2572944