Minimizing seek times in a hierarchical storage management (HSM) system

Patent metadata

Field	Value
Publication number	US-10831374-B2
Application number	US-201615371057-A
Country	US
Kind code	B2
Filing date	Dec 6, 2016
Priority date	Dec 6, 2016
Publication date	Nov 10, 2020
Grant date	Nov 10, 2020

Abstract

A computer-implemented method, according to one embodiment, includes assigning one or more first-type tape cartridges to an upper tape layer of a hierarchical storage management system, assigning one or more second-type tape cartridges to a lower tape layer of the hierarchical storage management system, and moving, to the lower tape layer, data having lower access frequency and recorded in the first-type tape cartridge assigned to the upper tape layer. A length of a tape included in the second-type tape cartridge is longer than a length of a tape included in the first-type tape cartridge.

First claim

What is claimed is:

1. A computer-implemented method, comprising:
allocating physical space of an upper tape layer and a lower tape layer of a hierarchical storage management system;
assigning a plurality of first-type tape cartridges to the allocated physical space of the upper tape layer of the hierarchical storage management system;
assigning a plurality of second-type tape cartridges to the allocated physical space of the lower tape layer of the hierarchical storage management system,
wherein a length of each of the tapes included in the plurality of second-type tape cartridges is longer than a length of each of the tapes included in the plurality of first-type tape cartridges;
defining a copy of data currently stored on a tape included in the plurality of first-type tape cartridges and that has been migrated therefrom to another tape cartridge as invalid;
defining a copy of data currently stored on a tape included in the plurality of first-type tape cartridges and that has not been migrated therefrom to another tape cartridge as valid;
determining whether a first predetermined condition for performing reclamation processing is met, wherein the first predetermined condition includes a proportion of valid data on a first tape included in the plurality of first-type tape cartridges, relative to a total capacity of the first tape and/or an amount of invalid data on the first tape, being lower than a predetermined threshold; and
in response to a determination that the first predetermined condition for performing reclamation processing is met for the first tape, performing reclamation processing on the first tape, wherein performing reclamation processing on the first tape includes:
making a data band of the first tape available to be entirely overwritten, the data band of the first tape having valid data and invalid data,
wherein making the data band of the first tape available to be entirely overwritten includes moving, to the lower tape layer, only valid data having lower access frequency and recorded in the data band of the first tape, and
performing overwriting of all data in the data band of the first tape.

2. The computer-implemented method of claim 1 , wherein a second predetermined condition for performing the reclamation processing includes passage of a predetermined amount of time after a last access having been made to the valid data on the first tape.

3. The computer-implemented method of claim 1 , wherein the hierarchical storage management system includes a scratch pool of tape cartridges containing no data stored thereon,
wherein the tape cartridges included in the scratch pool are independent from the other layers of the hierarchical storage management system, and comprising:
in response to a determination that the plurality of second-type tape cartridges assigned to the lower tape layer are running out of storage space, assigning at least some of the tape cartridges of the scratch pool to the lower tape layer.

4. The computer-implemented method of claim 1 , comprising:
determining whether a second predetermined condition for performing reclamation processing is met,
wherein the second predetermined condition includes passage of a predetermined amount of time after a last access having been made to valid data stored on a data band of a second tape included in the plurality of first-type tape cartridges,
wherein the data band of the second tape includes valid data and invalid data; and
in response to a determination that the second predetermined condition for performing reclamation processing is met for the second tape, performing reclamation processing on the second tape, wherein performing reclamation processing on the second tape includes:
making the data band of the second tape available to be entirely overwritten,
wherein making the data band of the second tape available to be entirely overwritten includes moving, to the lower tape layer, the valid data stored on the data band of the second tape in response to a determination that the predetermined amount of time has elapsed after the last access time at which the valid data stored on the data band of the second tape was last accessed, and moving, to another first-type tape cartridge assigned to the upper tape layer, the valid data stored on the data band of the second tape in response to a determination that the predetermined amount of time has not elapsed after the last access time at which the valid data stored on the data band of the second tape was last accessed, and
performing overwriting of all data in the data band of the second tape.

5. The computer-implemented method of claim 4 , comprising:
determining whether a third predetermined condition for performing reclamation processing is met,
wherein the third predetermined condition includes passage of the predetermined amount of time after a last access having been made to valid data stored on a data band of a third tape included in the plurality of second-type tape cartridges,
wherein the data band of the third tape includes valid data and invalid data; and
in response to a determination that the third predetermined condition for performing reclamation processing is met for the third tape, performing reclamation processing on the third tape, wherein performing reclamation processing on the third tape includes:
making the data band of the third tape available to be entirely overwritten,
wherein making the data band of the third tape available to be entirely overwritten includes moving, to the upper tape layer, the valid data stored on the data band of the third tape in response to a determination that the predetermined amount of time has elapsed after the last access time at which the valid data stored on the data band of the third tape was last accessed, and moving, to another second-type tape cartridge assigned to the lower tape layer, the valid data stored on the data band of the third tape in response to a determination that the predetermined amount of time has not elapsed after the last access time at which the valid data stored on the data band of the third tape was last accessed, and
performing overwriting of all data in the data band of the third tape.

6. The computer-implemented method of claim 1 ,
wherein a second predetermined condition for performing the reclamation processing includes a ratio of an amount of valid data on the first tape to an amount of invalid data on the first tape falling into a predetermined range, and comprising:
retaining, in the upper tape layer, data having lower access frequency and recorded in the first-type tape cartridge assigned to the upper tape layer; and
performing a next read and/or write operation on the first-type and second-type tape cartridges.

7. The computer-implemented method of claim 6 , wherein the predetermined range is determined using a table.

8. The computer-implemented method of claim 1 , comprising:
identifying a type of tape cartridge that is to be subjected to the reclamation processing,
wherein the type of tape cartridge that is to be subjected to the reclamation processing is identified from input received from a queue; and
performing the reclamation processing on the identified type of tape cartridge.

9. The computer-implemented method of claim 1 , comprising:
identifying a type of tape cartridge that is to be subjected to the reclamation processing,
wherein the type of tape cartridge that is to be subjected to the reclamation processing is identified as a type of tape cartridge that was not the type of tape cartridge of a most recent reclamation processing event; and
performing the reclamation processing on the identified type of tape cartridge.

10. A computer program product f

Assignees

• IBM

Inventors

• Kawamura Kousei
• Masuda Koichi
• Matsui Sosuke
• Tanaka Jun
• Tsuda Takahiro

Classifications

• G06F12/0802

  Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches · CPC title

• G06F3/061 Primary

  Improving I/O performance · CPC title

• G06F3/0686

  Libraries, e.g. tape libraries, jukebox · CPC title

• G06F3/0647 Primary

  Migration mechanisms · CPC title