Minimizing high resolution tape directory recovery time

By determining the validity of the HRTD in the tape drive and automatically restoring the HRTD when it is invalid, the problem of excessively long recovery time when the HRTD is invalid is solved, thus improving the efficiency of the tape drive.

CN121399688APending Publication Date: 2026-01-23INTERNATIONAL BUSINESS MACHINE CORPORATION
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202480035931.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2023-06-18
Filing Date
2024-05-07
Publication Date
2026-01-23

AI Technical Summary

Technical Problem

Existing tape drives require a significant amount of time to relocate to the End of Data (EOD) position to recover the HRTD when the High Resolution Tape Directory (HRTD) is invalid, resulting in excessively long recovery times.

Method used

When a tape drive receives a write or read command, it first determines whether the HRTD is valid; if invalid, it clears the timer or repositions to the EOD position to restore the HRTD, and then executes the command after restoration.

Benefits of technology

By reducing unnecessary repositioning of the EOD location, HRTD recovery time is significantly shortened, improving the efficiency and performance of the tape drive.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121399688A_ABST
    Figure CN121399688A_ABST
Patent Text Reader

Abstract

A system, method, and computer program product are provided for minimizing high resolution tape directory (HRTD) recovery time when HRTD is invalid. The tape drive may load a tape into the tape drive. In response to receiving a write command or a read command at a tape start (BOT) position, the tape driver may execute the write command or the read command without performing HRTD recovery. In response to receiving a write command or a read command at a location other than the BOT location, the tape drive may determine whether the HRTD is valid. In response to determining that the HRTD is invalid, the tape drive may clear the timer.
Need to check novelty before this filing date? Find Prior Art

Description

BACKGROUND

[0001] The present disclosure relates generally to the field of magnetic tape data storage systems, and more particularly to minimizing high resolution tape directory (HRTD) recovery time when the HRTD is invalid when loading a tape.

[0002] Computer systems can include data storage systems to process and store data. Historically, data has been stored on local storage devices such as hard disk drives (HDDs), solid state storage devices, and removable media such as compact discs (CDs) and digital versatile discs (DVDs). In addition, magnetic tape data storage systems are widely used to store digital data. Magnetic tape data storage systems provide increased data storage space and longevity at reduced cost. Modern magnetic tapes are typically packaged in cartridges or cassettes. A tape utility or tape drive is a device that performs writing or reading of digital data from a magnetic tape.

[0003] A tape drive linearly writes data from the beginning of the tape to the end of the tape or from the end of the tape to the beginning of the tape along each wrap region that divides the tape width into a plurality of regions. The data records written by the host server are packaged as units of data sets recorded from the beginning of the wrap to the end of the wrap. A portion of the data set records a data set information table (DSIT) that stores information of the data set. When the host requests to read or write new data to the tape, the tape drive must move to the data location from which it wants to read data or overwrite new data. The process of moving to the target data location is called repositioning. Repositioning requests are issued by record number or file marker number. The host application can specify a target record number, a target file marker number, or a target record and file marker. A file marker is a delimiter of each file containing a plurality of records on the tape. The tape drive does not know the location where the records or file markers are physically written on the tape. The tape drive utilizes the mechanism of a tape directory (TD) to coarsely identify the target record location. The TD divides a wrap into two regions and records the last record number and file marker of the region, and the number of records and file markers recorded in the region.

[0004] One of the standards that defines tape properties is the Linear Tape Open® (LTO®) standard (Linear Tape Open and LTO, all LTO-based trademarks and logos are trademarks or registered trademarks of Hewlett Packard Enterprise, IBM and Quantum and / or their subsidiaries). For example, in LTO tape drives, one wrap is divided into two sub-areas. In such systems, the tape directory identifies which of the two sub-areas a target record is located in. In contrast, in known tape drives, such as the TS1160, TS1155, TS1150 sold by IBM (written as TS11 xx in this disclosure), each wrap is divided into 128 smaller sub-areas in the length direction of the tape. In such systems, in addition to the TD data structure, a high resolution tape directory (HRTD) data structure identifies for each record recorded on the tape the specific sub-area of the sub-areas in which the target record is recorded. Whereas LTO tape drives have a virtual high resolution tape directory (vHRTD) that divides the wrap into 32 areas to store information similar to the HRTD in addition to the TD.

[0005] TS11 xx tape drives store the HRTD in a standard housekeeping data set (sHKDS) that is written on a data area outside of the user data area called the housekeeping data area. When the tape is unloaded, the sHKDS of the HRTD is recorded on the tape. The sHKDS is read when the tape is loaded and the HRTD information is used to relocate target data locations. In addition to the sHKDS, the tape drive records the HRTD in the last written user data set, called the end of data (EOD) data set.

[0006] LTO tape drives store the vHRTD only in the EOD. Because the EOD is not always written near the beginning of the tape, the tape drive does not attempt to retrieve the vHRTD by reading the EOD when the tape is loaded. Only when the drive has the opportunity to read the EOD by a host command does it retrieve the vHRTD for use in relocating target data locations.

[0007] Once a TS11 xx or LTO tape drive has retrieved the HRTD or vHRTD, the drive uses the HRTD to identify the area that includes the target record or file mark. Since the physical location of the identified area can be determined, the drive reads each data set in the area one at a time to confirm whether the target record or file mark is recorded in the data set. If the target record or file mark is included in a data set, the relocation is complete, otherwise, the drive keeps reading the data sets until it finds the target record or file mark.

[0008] An LTO tape drive can utilize only the TD until it reads the vHRTD from the EOD. In this case, the drive estimates a rough location based on the portion of the target record number or file marker between the first and last record number or file marker of the TD region, which ranges approximately 500m (half the length of a winding). The tape drive then begins reading the dataset from the location a few meters prior. Summary of the Invention

[0009] Embodiments of this disclosure include systems, methods, and computer program products for minimizing HRTD recovery time when a High-Resolution Tape Directory (HRTD) is invalid. A tape drive can load a tape into the tape drive. In response to receiving a write or read command at the Start of Tape (BOT) position, the tape drive can execute the write or read command without performing HRTD recovery. In response to receiving a write or read command at a position other than the BOT position, the tape drive can determine whether the HRTD is valid. In response to determining that the HRTD is invalid, the tape drive can clear a timer.

[0010] The above description is not intended to depict every illustrated embodiment or every implementation of this disclosure. Attached Figure Description

[0011] The accompanying drawings included in this disclosure are incorporated in and form a part of this specification. They illustrate embodiments of the present disclosure and, together with the description, serve to explain the principles of the disclosure. The drawings are merely illustrative of exemplary embodiments and do not limit the scope of this disclosure.

[0012] Figure 1A An embodiment of a computing environment employing one aspect of magnetic tape relocation management according to this disclosure is shown.

[0013] Figure 1B A high-level block diagram representation of an enterprise computer system including a magnetic tape storage drive is shown, wherein magnetic tape relocation management according to this disclosure can be employed.

[0014] Figure 2 An exemplary block diagram of the hardware and software architecture of a data storage system in a computer system that can employ magnetic tape relocation management according to this disclosure is shown.

[0015] Figure 3 An exemplary block diagram of a tape storage drive that can employ tape relocation management according to this disclosure is shown.

[0016] Figure 4 A known tape structure for a magnetic tape in a magnetic tape storage drive system is shown.

[0017] Figure 5A illustrates a known tape house data structure that records a high-resolution tape catalog (HRTD).

[0018] Figure 5 B illustrates a known End-of-Data (EOD) data structure that records the Virtual High-Resolution Tape Directory (vHRTD).

[0019] Figure 6 It shows that it can be used Figure 3 An example of a magnetic tape cassette used in a magnetic tape storage drive.

[0020] Figure 7 An example process diagram of the operation of a computer system employing a relocation management aspect according to this disclosure is shown.

[0021] Figure 8 An example process diagram of the operation of a computer system employing a relocation management aspect according to this disclosure is shown.

[0022] Figure 9 An example process diagram of the operation of a computer system employing a relocation management aspect according to this disclosure is shown.

[0023] Figure 10 An example diagram illustrating the probability of the next command occurring for repositioning a command interval according to an embodiment of the present disclosure is shown.

[0024] Figure 11 A high-level block diagram of an example computer system, according to embodiments of the present disclosure, is shown that can be used to implement one or more of the methods, tools, and modules described herein, as well as any related functions.

[0025] Figure 12 A schematic diagram is shown of program code related to the methods disclosed herein, according to at least one embodiment, and of a computational environment for minimizing HRTD recovery time in a tape drive system.

[0026] While the embodiments described herein may have various modifications and alternatives, their details have been shown by way of example in the accompanying drawings and will be described in detail. However, it should be understood that the specific embodiments described should not be construed as limiting. Rather, the invention will cover all modifications, equivalents, and alternatives falling within the spirit and scope of this disclosure. Detailed Implementation

[0027] Various aspects of this disclosure generally relate to the field of magnetic tape data storage systems, and more particularly to methods for minimizing HRTD recovery time when the HRTD is invalid during tape loading. While this disclosure is not necessarily limited to such applications, various aspects of this disclosure can be understood through the discussion of various examples in this context.

[0028] According to one aspect of the invention, a method is provided for minimizing HRTD recovery time when a High-Resolution Tape Directory (HRTD) is invalid, wherein the method is performed by a tape drive. The method includes loading a tape into the tape drive. In response to receiving a write command or read command at a Start of Tape (BOT) position, the tape drive executes the write command or read command without performing HRTD recovery. In response to receiving a write command or read command at a position other than the BOT position, the tape drive determines whether the HRTD is valid. In response to determining that the HRTD is invalid, the tape drive clears a timer. This is superior to standard HRTD recovery methods because the claimed steps reduce the time loss due to repositioning to the End of Data (EOD) position required for HRTD recovery.

[0029] In an embodiment, the method performed by the tape drive may further include, in response to receiving a write command at a location other than the BOT location, repositioning to the End of Data (EOD) location. The tape drive can read the HRTD from the EOD location. The tape drive can verify the HRTD. The tape drive can execute the write command. This is superior to standard HRTD recovery methods because the tape drive automatically verifies the HRTD before executing the write command.

[0030] In an embodiment, the method performed by the tape drive may further include, in response to receiving a read command at a location other than the BOT location, executing the read command, and setting a timer to a predetermined time limit if HRTD recovery is required after processing the read command. This is superior to the standard HRTD recovery method because the tape drive can set a timer to automatically perform HRTD recovery after executing the read command.

[0031] In an embodiment, the method performed by the tape drive may further include: repositioning to the End of Data (EOD) position in response to reaching a predetermined time limit, reading the HRTD from the EOD position, and verifying the HRTD. This is superior to the standard HRTD recovery method because the tape drive automatically performs HRTD recovery after the predetermined time limit is reached, which reduces the time loss due to repositioning.

[0032] In this embodiment, a predetermined time limit for achieving HRTD recovery is statistically calculated. This is superior to standard HRTD recovery methods because they cannot achieve HRTD recovery based on a statistically calculated time limit that has been reached.

[0033] In this embodiment, the predetermined time limit for the HRTD recovery is set to 10 seconds. This is superior to standard HRTD recovery methods because they do not include any such specific time limit for achieving HRTD recovery, which is statistically calculated to reduce maximum time loss.

[0034] In an embodiment, the method performed by the tape drive may further include: repositioning to the End of Data (EOD) position in response to the HRTD being invalid in write mode, reading the HRTD from the EOD position, verifying the HRTD, and repositioning to the target position by reading the tape. This is superior to the standard HRTD method because the tape drive can perform HRTD recovery regardless of whether the target write record exists in the segment buffer, wherein once the HRTD has been recovered, the drive moves to the target write position to write the data to the tape.

[0035] According to one aspect of the invention, a system is provided for minimizing HRTD recovery time when a High-Resolution Tape Directory (HRTD) is invalid. The system may include a processor and a computer-readable storage medium communicatively coupled to the processor of a tape drive and storing program instructions that, when executed by the processor, cause the processor of the tape drive to perform a method. The method executed by the processor may include loading tape into the tape drive. In response to receiving a write command or read command at a start-of-tape (BOT) position, the processor may execute the write command or read command without performing HRTD recovery. In response to receiving a write command or read command at a position other than the BOT position, the processor may determine whether the HRTD is valid. In response to determining that the HRTD is invalid, the processor may clear a timer. This is superior to standard HRTD recovery systems because the claimed steps reduce time loss due to relocation to the end-of-data (EOD) position required for HRTD recovery.

[0036] In an embodiment, the method executed by the system's processor may further include, in response to receiving a write command at a location other than the BOT location, repositioning to the End of Data (EOD) location. The system's processor can read the HRTD from the EOD location. The system's processor can verify the HRTD. The system's processor can execute the write command. This is superior to standard HRTD recovery systems because the tape drive automatically verifies the HRTD before executing the write command.

[0037] In an embodiment, the method executed by the system's processor may further include: in response to receiving a read command at a location other than the BOT location, executing the read command and setting a timer to a predetermined time limit if HRTD recovery is required after processing the read command. This is superior to standard HRTD recovery systems because the tape drive can set a timer to automatically perform HRTD recovery after executing the read command.

[0038] In an embodiment, the method executed by the system's processor may further include, in response to reaching a predetermined time limit, relocating to the End of Data (EOD) position, reading the HRTD from the EOD position, and verifying the HRTD. This is superior to standard HRTD recovery systems because the tape drive automatically performs HRTD recovery after the predetermined time limit is reached, which reduces time loss due to relocation.

[0039] In this embodiment, a predetermined time limit for achieving HRTD recovery is statistically calculated. This is superior to standard HRTD recovery systems, which cannot achieve HRTD recovery based on reaching a statistically calculated time limit.

[0040] In an embodiment, the method executed by the system's processor may further include, in response to the HRTD being invalid in write mode, repositioning to the End of Data (EOD) position, reading the HRTD from the EOD position, verifying the HRTD, and repositioning to the target position by reading the tape. This is superior to standard HRTD systems because the tape drive can perform HRTD recovery regardless of whether the target write record exists in the segment buffer, wherein once the HRTD has been recovered, the drive moves to the target write position to write the data to the tape.

[0041] According to one aspect of the invention, a computer program product is provided, comprising a computer-readable storage medium having program instructions implemented therewith, executable by a processor of a tape drive, to cause the processor to perform a method for minimizing HRTD recovery time when the High Resolution Tape Directory (HRTD) is invalid. The processor-executable program instructions of the tape drive cause the processor to load a magnetic tape into the tape drive. In response to receiving a write command or read command at the Start of Tape (BOT) position, the program instructions cause the processor to execute the write command or read command without performing HRTD recovery. In response to receiving a write command or read command at a position other than the BOT position, the program instructions cause the processor to determine whether the HRTD is valid. In response to determining that the HRTD is invalid, the program instructions cause the processor to clear a timer. This is superior to standard HRTD recovery computer program products because the claimed steps reduce the time loss due to relocation to the End of Data (EOD) position required for HRTD recovery.

[0042] In an embodiment, the program instructions executable by the tape drive's processor may further include instructions that cause the processor, in response to receiving a write command at a location other than the BOT location, to reposition to the End of Data (EOD) location, read the HRTD from the EOD location, verify the HRTD, and execute the write command. This is superior to standard HRTD recovery computer program products because the tape drive automatically verifies the HRTD before executing the write command.

[0043] In an embodiment, the processor-executable program instructions of the tape drive may further include instructions to execute a read command in response to receiving a read command at a location other than the BOT location, and to set a timer to a predetermined time limit if HRTD recovery is required after processing the read command. This is superior to standard HRTD recovery computer program products because the tape drive can set a timer to automatically perform HRTD recovery after executing the read command.

[0044] In an embodiment, the program instructions executable by the processor of the tape drive may further include instructions for repositioning to the End of Data (EOD) position in response to reaching a predetermined time limit, reading the HRTD from the EOD position, and verifying the HRTD. This is superior to standard HRTD recovery computer program products because the tape drive automatically performs HRTD recovery after the predetermined time limit is reached, which reduces the time loss due to repositioning.

[0045] In this embodiment, a predetermined time limit for achieving HRTD recovery is statistically calculated. This is superior to standard HRTD recovery computer program products, as they cannot achieve HRTD recovery based on a statistically calculated time limit that has been reached.

[0046] In an embodiment, the program instructions executable by the processor of the tape drive may further include instructions to relocate to the End of Data (EOD) position in response to an invalid HRTD in write mode, to read the HRTD from the EOD position, to verify the HRTD, and to relocate to the target position by reading the tape. This is superior to standard HRTD computer program products because the tape drive can perform HRTD recovery regardless of whether a write target record exists in the segment buffer, wherein once the HRTD has been recovered, the drive moves to the write target position to write the data onto the tape.

[0047] As described above, when the tape is loaded, the TS11xx tape drive retrieves the HRTD by reading the sHKDS from a position near the beginning of the tape. The position at the beginning of the tape media is where the drive head has run more times than other positions and may be worn out. The dataset around the beginning of the tape sometimes cannot be read back in a single attempt. The tape drive attempts to read the user dataset until it can be read by changing the tape drive settings. The number of read retries can reach up to approximately 80. Regardless of these retries, if the drive cannot read the dataset, it reports a read error to the host at the end. On the other hand, the tape drive does not read the retried sHKDS because it does not contain any user data, and the user requests that the tape should be loaded as soon as possible. When the host issues the first relocation command, such as a position or space, the TS11xx tape drive attempts to read the HRTD by moving to the EOD position instead of retrying. This is because HRTD recovery is not required when new data is written from the beginning of the tape (BOT) position or when the host begins reading data from the BOT.

[0048] LTO tape drives do not have a mechanism to actively move to the EOD location to retrieve the vHRTD from the EOD location. Instead, the drive only recovers the vHRTD when it has the opportunity to read the EOD. The drive locates the target record or file marker based on the ratio between the first and last record or file marker in the TD area.

[0049] When the HRTD is unreadable from the sHKDS or otherwise determined to be invalid, time loss may occur while the tape drive needs to navigate to the EOD position to recover the HRTD. Evaluations of the recovery times for both HRTD and vHRTD have shown that improvements can be made to reduce time loss, leading to increased tape drive efficiency.

[0050] The performance of both LTO and TS11xx tape drives was measured to identify issues related to HRTD recovery time. Experimental testing using an LTO-7 tape drive without vHRTD showed that the tape drive moved at the fastest speed to a position 4 meters before the HRTD boundary, which the tape drive estimated by the proportion of the target record between the beginning and end of the TD range. The tape drive then read each dataset one by one at normal speed until it found a dataset containing the target record. The experiments revealed that the LTO7 tape drive moved at the fastest speed to a position every 5251 longitudinal position counters (LPOS) (28.73 meters), corresponding to the interval of each HRTD boundary. Since the normal tape speed of the LTO9 drive is 5.6 m / s, the travel time from 4 meters before the HRTD boundary to the HRTD boundary is 4 m / 5.6 (m / s) = 0.714 s, and the travel time from one HRTD boundary to the next is 28.73 m / 5.6 (m / s) = 5.13 s. On average, when the target record is located anywhere within the HRTD region, it takes 0.714s + 5.13s / 2 = 3.28s to reach the target location.

[0051] The TX11xx tape drive utilizes a high-speed head-down disk (HRTD) that divides the wound length into 128 sections to move to the target position. Assuming a tape length of 1024 meters, each section is 8 meters long. After moving at high speed to the boundary of the HRTD section, it then repositions to the target position at a normal speed of 5.6 m / s. The head travels from one side of the HRTD section to the other in 8 m / 5.6 (m / sec) = 1.43 s. Therefore, the tape drive reaches the target in an average of 0.71 s. For statistical calculation purposes, 0.71 s is set as the variable β.

[0052] The average travel time from a certain position on the tape to the boundary of the HRTD area is the same for both LTO and TS11xx tape drives. Compared to the proportional method used on an LTO without vHRTD, the travel time saved by HRTD can be estimated as 3.28s - 0.71s = 2.57s. Here, 2.57s is set as the variable α.

[0053] If the TS11xx tape drive cannot retrieve the HRTD while loading the tape, it recovers the HRTD by traveling to the EOD when the host issues the first repositioning command (position / interval). Here, the travel time from the beginning of the tape to the EOD at any position on the tape is calculated.

[0054] It travels to the boundary of the HRTD region at a maximum speed of 12.4 m / s. Here, we assume its speed is a variable.v The length of the tape is a variable. p The high-speed travel time from the beginning to the end of the magnetic tape is expressed as: w = p / v .

[0055] The average travel time to reach an EOD at any location becomes w / 2. Since the HRTD has not yet been retrieved, α+β is added. The average travel time from EOD to the dataset storing the target record at any location becomes w / 3. In this case, since the HRTD has already been retrieved at EOD, only beta is added.

[0056] Therefore, the average travel time from the beginning of the tape to the target location via EOD requires w / 2 + w / 3 +α+2β. The travel time from the beginning of the tape drive to the target record after HRTD recovery is [time missing]. w / 3 +β additional time.

[0057] Assuming the tape length is 1024 meters, the travel time to the target after recovering the HRTD is: w / 3 +β = (1024 / 12.4) / 3 + 0.71 = 28.71s. This means that the tape drive spends an additional 28.21 seconds to recover the HRTD, reducing the α = 2.57 seconds per reposition. For example, this means that if more than 10 repositionings are performed, it is worthwhile to recover the HRTD. Considering the recovery effect of recovering the HRTD over time, this disclosure reconstructs the HRTD recovery process. Furthermore, this process, or a substantially similar process, can be applied to LTO tape drives to recover the vHRTD.

[0058] Embodiments of this disclosure include systems, methods, and computer program products for reducing time loss due to navigation / repositioning to the EOD to recover the HRTD. In embodiments, when HRTD recovery is required (e.g., sHKDS is unreadable), to reduce the time loss from repositioning the tape drive to the EOD to recover the HRTD, the tape drive uses the following process to recover the HRTD: The tape drive recovers the HRTD only after the host issues a tape movement command. For example, if a read or write command is issued at the BOT, the drive processes the command. If a repositioning command is issued, the drive moves to the target location.

[0059] In an embodiment, if a write command is issued when the current position is not at the BOT position and HRTD recovery is required, the drive attempts to recover the HRTD before writing data to the tape. If a read command is issued when the current position is not at the BOT position, the tape drive processes the read command.

[0060] In this embodiment, if HRTD recovery is required after processing a read command, the tape drive sets a timer. Furthermore, when the next read command is issued, the tape drive resets the timer, so that once the timer expires, the tape drive automatically attempts to recover the HRTD.

[0061] In one embodiment, if the tape drive determines that HRTD recovery is needed when a write command is issued, the tape drive moves to the EOD position to read the EOD, thereby recovering the HRTD, regardless of whether the write target record exists in the segment buffer. After recovering the HRTD, the drive moves to the write target position to write data on the tape.

[0062] The advantages described above are exemplary and not all advantages are discussed. Furthermore, embodiments of this disclosure may include all, some, or none of the foregoing advantages, while remaining within the spirit and scope of this disclosure.

[0063] Various aspects of this disclosure are described below with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products. [Go to...] Figure 1A The illustration depicts an example of a computer system 10, in which various aspects of embodiments of the present disclosure may be implemented. The computer system 10 includes a central processing unit (CPU) 12 connected to a mass storage device(s) 14 and a memory device 16. The mass storage device may include a hard disk drive (HDD) device, which may be configured in a redundant array of independent disks (RAID). In the illustrated embodiment, the mass storage device 14 includes a magnetic tape data storage system.

[0064] Memory device 16 may include, for example, random access memory (RAM), electrically erasable programmable read-only memory (EEPROM), or the host's memory of an associated device. Memory device 16 and mass storage device 14 are connected to CPU 12 via a signal-bearing medium. Furthermore, CPU 12 is connected to communication network 20 via communication port 18, which has multiple additional computer systems 22 and 24. Computer system 10 may include one or more processor devices (e.g., CPU 12) and additional memory device 16 for each individual component of computer system 10.

[0065] Figure 1BThis is a high-level block diagram illustrating a representation of an enterprise computer system including a magnetic tape data storage system, wherein various aspects of embodiments of this disclosure can be implemented. Examples of enterprise-wide applications include, but are not limited to, payroll, warehousing, transportation, and batch operations. Figure 1B The enterprise computer system 100 includes multiple host data processing systems (e.g., server data processing systems 102A, 102B and associated client data processing systems 104A, 104B... 104N), as shown, which are communicatively coupled together via a first network interconnect (e.g., a local area network or "LAN" interconnect 106). The server data processing systems 102A, 102B of the described embodiment are also coupled to a storage subsystem 108 including multiple data storage devices and a second network interconnect (e.g., a storage area network or "SAN" interconnect 112). One or more of the server data processing systems 102A, 102B, client data processing systems 104A, 104B... 104N, and storage system 108 can be configured for relocation management according to this disclosure.

[0066] exist Figure 1B In an exemplary embodiment, storage system 108 is described as including a tape data storage system represented by tape data storage system 110. In alternative embodiments, storage system 108 may also include any number and type of data storage devices (e.g., individual disk drives, tape drives, disk arrays, tape arrays, RAID array subsystems, robotic tape libraries, file managers, file servers), communicatively coupled together via storage interconnect (SAN interconnect 112), such as a Fibre Channel (FC) switch, switching fabric, arbitration loop, etc., and coupled to server data processing systems 102A, 102B. Server data processing system 102A of the embodiment of FIG1 includes an application server (e.g., a database server) to provide core operational functions to one or more of client data processing systems 104A-104N (where “N” is a positive integer), and server data processing system 102B includes another server (e.g., a cluster failover server, load balancing server, backup server, etc.).

[0067] The magnetic tape data storage system 110 of the illustrated embodiment is coupled to the SAN interconnect 112 via the illustrated communication links. Each communication link may include any of a plurality of communication media (e.g., copper wire, optical fiber, etc.) capable of transmitting one or more electrical, optical and / or acoustic propagation signals between the communication port of the SAN interconnect 112 and the magnetic tape data storage system 110.

[0068] In the illustrated embodiment, one or both of the magnetic tape data storage system 110 and the server data processing system 102A are configured to have sufficient functionality to employ magnetic tape relocation management according to this disclosure to control and / or manage magnetic tape relocation and access to data provided to the magnetic tape data storage medium within the tape cassette coupled to the magnetic tape data storage device 110, as will be further described herein. However, it should be understood that computer systems 10, 22, 23 ( Figure 1A Server data processing systems 102A and 102B Figure 1B One or more of the client data processing systems 104A, 104B... 104n and the data storage system 108 can be configured to adopt relocation management according to this disclosure.

[0069] Although a conventional SAN-type interconnect (SAN interconnect 112) is specifically described in the embodiment of Figure 1, other interconnects (e.g., direct connection, LAN, MAN, and / or WAN) and other protocols (e.g., FICON, ESCON, SSA, etc.) can be utilized. Furthermore, although already discussed... Figure 1B Enterprise 100 illustrates a specific number and arrangement of elements, but it should be understood that embodiments of this disclosure are not limited to enterprises, systems, or data storage devices having any specific number, type, or arrangement of components, and therefore can encompass a wide variety of system types, architectures, and form factors.

[0070] In an alternative embodiment, Figure 2 This is an exemplary computer system 200 illustrating the hardware and software architecture of a data storage system 204 in which aspects of tape relocation management according to this disclosure can be implemented. Host computers 210, 220, and 225 are shown, each acting as a central processing unit for performing data processing as part of the computer system 200 including the data storage system 204. Hosts (physical or virtual devices) 210, 220, and 225 can be one or more physical or logical devices used to achieve the purposes of embodiments of this disclosure. In one embodiment, by way of example only, the data storage system 204 may be implemented as an IBM® System Storage that has been modified to employ tape relocation management according to this disclosure. TM DS8000 TM .

[0071] Network connection 226 can be a Fibre Channel architecture, a Fibre Channel point-to-point link, an Ethernet architecture, or a Fibre Channel on a point-to-point link, a FICON or ESCON I / O interface, any other I / O interface type, a wireless network, a wired network, a LAN, a WAN, heterogeneous, homogeneous, public (i.e., the Internet), private, or any combination thereof. Hosts 210, 220, and 225 can be local or distributed in one or more locations and can be equipped with any type of fabric (or fabric access) to storage controller 228. Figure 2 (not shown) or network adapters, such as Fibre Channel, FICON, ESCON, Ethernet, fiber optic, wireless, or coaxial adapters. The data storage system 204 is accordingly equipped with a suitable architecture ( Figure 2 (not shown in the image) or network for communication. Figure 2 The image depicts a data storage system 204, which includes a storage controller 228 and a storage device 230 including a magnetic tape data storage drive 231 controlled by the storage controller 228.

[0072] Storage devices 230a, 230b...230n of storage device 230 may physically include one or more storage devices, such as storage arrays. A storage array is a logical grouping of individual storage devices, such as hard disk or tape data storage drives. In some embodiments, one or more storage devices in storage devices 230a, 230b...230n include JBOD (Simple Board Bundled) arrays or RAID (Redundant Array of Independent Disks) arrays. The collection of physical storage arrays can be further combined to form rank, which decouples physical storage from logical configuration. Storage space in a rank can be allocated to logical volumes, which define the storage location specified in write / read requests. Furthermore, as... Figure 1B and Figure 3 The magnetic tape data storage device 110 described herein (see [reference]) Figure 1B ) can be used Figure 2 It is implemented using the architecture described in [the document / document].

[0073] In one embodiment, as an example only, Figure 2The storage system shown may include logical volumes, or simply “volumes,” and may have different types of allocations. Storage devices 230a, 230b, and 230n are shown as columns in data storage system 200 and are referred to herein as columns 230a, 230b, and 230n. Columns may be local to data storage system 200 or may be located at physically remote locations. In other words, a local storage controller may connect to a remote storage controller and manage storage at a remote location. Column 230a is shown configured with two full volumes 234 and 236 and a partial volume 232a. Column 230b is shown having another partial volume 232b and a full volume 237. Thus, volume 232 is allocated across columns 230a and 230b. Column 230n is shown fully allocated to volume 238; that is, column 230n refers to the entire physical storage used for volume 238. From the above examples, it will be understood that columns can be configured to include one or more partial and / or entire volumes. Volumes and columns can be further divided into so-called "tracks," which represent fixed blocks of memory. Thus, a track is associated with a given volume and can be assigned to a given column.

[0074] To facilitate a clearer understanding of aspects of this disclosure, the storage controller 228 in Figure 2 The storage controller 228, shown as a single processing unit, includes a microprocessor 242 and a system memory 243 that may include a non-volatile storage device (“NVS”) described in more detail below. Note that in some embodiments, the storage controller 228 includes multiple processing units, each having its own processor complex and system memory, and interconnected via a dedicated network within the data storage system 204. In some embodiments, devices included in the storage device 230 may be connected in a loop architecture.

[0075] Storage controller 228 manages storage device 230 and facilitates the processing of write and read requests for storage device 230. System memory 243 of storage controller 228 stores program instructions and data, which processor 242 can access to perform functions and methods of embodiments of this disclosure for performing and managing storage device 230 as described herein. In one embodiment, system memory 243 includes tape repositioning management 255 associated with or communicating with operating software 250 for performing methods and operations employing repositioning management according to this disclosure. One aspect of tape repositioning management 255 is control tape repositioning logic 257, which controls… Figure 3(The location of the tape on the tape data storage drive 231). Although tape relocation logic 257 is described as a component of tape relocation management 255, it should be understood that tape relocation logic 257 may reside in other components of the system, such as storage controller 228, host 210-225, network 226, and one or more of tape storage drive 231. Similarly, although the logic of tape management 255 is described as a component of storage controller 228, it should be understood that tape relocation management 255 may reside in other components of the system, such as tape storage drive 231, host 210-225, and network 226. Therefore, tape relocation management 255 may be implemented individually or in combination using one or more of hardware, software, and firmware.

[0076] like Figure 2 As shown, system memory 243 may also include or communicate with cache 265 for storing 230, also referred to herein as "cache memory," for buffering "write data" and "read data," which refer to write / read requests and their associated data, respectively. In one embodiment, cache 265 is allocated in a device external to system memory 243 but remains accessible to microprocessor 242 and may be used to provide additional security against data loss in addition to performing the operations described herein.

[0077] In some embodiments, cache 265 is implemented in volatile and non-volatile memory and is connected via a local bus ( Figure 2 (Not shown) is coupled to microprocessor 242 for enhancing the performance of data storage system 200. An NVS portion of memory 243 included in the data storage controller is accessible to microprocessor 242 and is used to provide additional support for the operation and execution of embodiments of this disclosure as described in other figures. The NVS may also be referred to as a “permanent” cache or “cache memory” and is implemented using non-volatile memory that can retain the data stored therein, with or without the aid of an external power source. The NVS may be stored in and together with cache 265 for any purpose suitable for achieving the objectives of embodiments of this disclosure. In some embodiments, such as a backup power source for a battery ( Figure 2 (Not shown) provides sufficient power to the NVS to preserve the data stored therein in the event of a power outage of the data storage system 200. In some embodiments, the capacity of the NVS is less than or equal to the total capacity of the cache 265.

[0078] Storage controller 228 includes control switch 266 for controlling the communication protocol to host computers 210, 220, 225, such as Fibre Channel protocol. Buffer 267 helps cache 265 temporarily store (buffer) read and write data.

[0079] Figure 3 This is a block diagram depicting one embodiment of a tape data storage drive 231 in which aspects of tape relocation management according to this disclosure may be employed. The tape data storage drive 231 includes a removable data storage tape cartridge 302 and a communication interface (e.g., a host data processing system interface (I / F) 306) for communicatively coupling the tape data storage drive 231 to a storage controller 228. Figure 2 Alternatively, it may be coupled to one or more host data processing systems or associated communication channels (e.g., SAN interconnect 112).

[0080] Communication I / F 306 is configured to receive input / output (I / O) operation requests (e.g., "read" and / or "write" requests) and process such requests appropriately to control or "manage" access to the magnetic tape data storage medium 308 (e.g., magnetic tape) of the removable data storage tape cartridge 302 as described herein. In addition to the magnetic tape data storage medium 308, the data storage tape cartridge 302 includes a cartridge memory (CM) module 309, which in one embodiment includes a passive, contactless silicon memory device for storing data about the tape cartridge 302 in which it resides. Exemplary data may include, for example, data indicating, the volume serial number (VOLSER) of the associated tape cartridge, the "type" of the data storage medium within the cartridge, the data format type, and the data stored thereon (if any).

[0081] As shown, using media transport reels 312 and 314 and one or more media transport motors 316, the magnetic tape data storage medium 308 of the removable data storage cassette 302 is routed to the vicinity of the tape access (e.g., read / write) head 310. The tape access head 310 is configured to read data from and write data to the magnetic tape data storage medium 308, and temporarily store or "grade" such data in a buffer 318 (e.g., one or more "read-ahead" or grading buffers).

[0082] When on tape 308 ( Figure 3 When writing data to or reading data from tape 308, tape 308 moves relative to read / write head 310 to the location of the data to be written or read. The process of moving to the target data location is commonly referred to as a "relocation" process and is executed in response to a relocation request issued by the storage controller.

[0083] In one example embodiment, the tape cartridge 302 conforms to the standard specifications of one or more LTO-7 tape drives, such as the TS11xx tape drive TS1160 or the LTO generation standard such as the LTO-7 tape drive. In such an embodiment, the supply reel 312 may be part of the tape cartridge and connected to the beginning of the tape 308, and the end of the tape 308 is connected to a lead pin (not shown), which is mechanically gripped by a feature (not shown) of the tape data storage drive 231 and threaded onto the reel 314.

[0084] The control unit 320 includes read logic and write logic for reading data from and writing data to the magnetic tape storage drive. Therefore, the control unit 320 controls and manages the operation of the data flow, formatting, and data storage subsystem via control signals issued to one or more of the communication I / F 306, buffer 318, media transfer motor 316, and / or CM I / F 322 for accessing (reading or writing) data stored in CM 309.

[0085] In the illustrated embodiment, tape relocation logic 257 ( Figure 2 Some or all of the functions of the tape storage drive 231 may reside within the control unit 320. In another embodiment, such control functions may be incorporated into one or more other components of the tape data storage drive 231. Similarly, although the control unit 320 is located within... Figure 3 While depicted as part of the tape storage drive 231, it should be understood that the control unit's logic may reside in one or more of the various components of the system, such as the storage controller 228, hosts 210-225, and network 226, as well as one or more of the tape storage drive 231. Alternatively, some or all of the component functions may be implemented in hardware devices, such as in application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or executed by separate dedicated processors.

[0086] The memory 106 may include one or more volatile or non-volatile memory devices, such as dynamic random access memory (DRAM), phase change memory (PCM), magnetoresistive random access memory (MRAM), spin-transfer torque (STT)-MRAM, SRAM storage devices, DRAM, ferroelectric random access memory (FeTRAM), nanowire-based non-volatile memory, and non-volatile direct in-line memory modules (DIMM), NAND storage devices such as flash memory, solid-state drive (SSD) storage devices, non-volatile RAM, etc.

[0087] Storage device 108 may include different types or categories of storage devices from SAN 112, such as magnetic hard disk drives, solid-state storage devices (SSDs) including solid-state electronics, EEPROM (Electrically Erasable Programmable Read-Only Memory), flash memory, flash drives, random access memory (RAM) drives, storage class memory (SCM), phase-change memory (PCM), resistive random access memory (RRAM), spin-transfer torque memory (STM-RAM), conductive bridged RAM (CBRAM), magnetic hard disk drives, optical discs, magnetic tapes, etc. Volumes in storage device 108 can be further configured using a range of devices, such as simple disk bundling (JBOD), direct-access storage devices (DASD), redundant arrays of independent disks (RAID), virtualization devices, etc. Furthermore, storage device 108 may include heterogeneous storage devices from different vendors and different types of storage devices, such as the first type of storage device, such as hard disk drives, which have slower data transfer rates than the second type of storage device, such as SSDs.

[0088] Storage device 108 may include a cloud storage system provided by a cloud storage service provider. Examples of cloud storage service providers include Dropbox®, Google® Drive, Amazon Cloud Drive®, Amazon® S3, and IBM® Cloud Object Storage System. TM (Dropbox is a registered trademark of Dropbox, Inc., Google is a registered trademark of Google, Inc., Amazon and Amazon Cloud Drive are trademarks of Amazon Technologies, Inc., and IBM and Cloud Object Storage System are trademarks of IBM worldwide.)

[0089] Network 106 may include, but is not limited to, Storage Area Network (SAN), Local Area Network (LAN), Intranet, Internet, Wide Area Network (WAN), Peer-to-Peer Network, Wireless Network, and Arbitration Loop Network. Therefore, Enterprise Computer System 100 includes Storage System 108 coupled to Server 102 via Network 112.

[0090] In the illustrated embodiment, the magnetic tape data storage drive 231 is a linear system, wherein the width direction of the magnetic tape is such that... Figure 4 The traditional method shown divides the tape into multiple regions (wounds), and data is recorded along the length of the tape, indicated by arrows for each wound, from the beginning to the end and from the end to the beginning. The width of the region where valid data for each wound is written in the tape width direction is called the track width (track pitch Wtp). For example... Figure 4As shown, recording is performed on the track simultaneously from the beginning to the end (forward) in even-numbered windings, and simultaneously from the end to the beginning (backward) in odd-numbered windings. In a known magnetic tape standard, the HRTD (High Resolution Tape Catalog) data structure 510 ( Figure 5 A) is stored in a tape portion called “Household Dataset” 514, which is defined before the first user data area of ​​the tape and is read when the tape is loaded.

[0091] For example, according to the LTFS tape media winding allocation of the LTO-7 standard, a tape can have 112 windings allocated to four data tapes (data tape 0-3), with each tape having 28 windings. That is, data tape 0 has 28 windings 0-winding n-1, data tape 1 has 28 windings n+0-winding 2n-1, data tape 2 has 28 windings 2n+0-winding 3n-1, and data tape 3 has 28 windings 3n+0-winding 4n-1. For example, a known LTFS standard can divide the tape into two partitions, where the first partition includes windings 0-1 that can be used for metadata, and the second partition includes windings 4-111 for data retention associated with metadata. For example, LTFS typically creates 2-partition tapes when formatting the tape. Windings 0 and 1 are used to provide the index partition. Windings 2 and 3 are typically used as guard tapes. From winding 4 to the last winding, the data partition is provided for storing user data that can be constructed using the standard records of the tape drive system.

[0092] Figure 6 It shows suitability with, for example, Figure 3 An example embodiment of a tape cassette 302 used with the tape data storage system of the illustrated tape data storage drive 231 includes a housing 652, a magnetic tape medium 308 (“tape”) within the housing 652, and a cartridge memory 309 coupled to the housing 652. In other embodiments, the cartridge memory 309 may be embedded within the housing 652. In still other embodiments, the cartridge memory 309 may be attached to the interior or exterior of the housing 652 without modifying the housing 652. The cartridge 302 may also have an identification mark 654 in or on the housing 652.

[0093] According to an example embodiment, controller 320 ( Figure 3 The cartridge memory 309 is used via a cartridge memory reader or interface 322 as temporary storage for information about data to be written in both directions of operation of the magnetic tape medium 308, such as generated values ​​of the LTFS index. In another embodiment, the cartridge memory 309 may store information about tape partitions, as well as other information about the use of the magnetic tape medium 308, such as a tape catalog (TD).

[0094] In known magnetic tape data storage drive systems, tape relocation requests identify a target location, which is determined by the record number of the target record or the file tag number of the target file tag. A file tag is a data structure that defines a region or subregion of a file consisting of any number of records. However, the precise location of each file tag is typically unavailable to the storage controller or the magnetic tape data storage drive. Generally, the read logic in a magnetic tape drive storage system cannot know precisely where the target record or file tag is written on the tape. Instead, a data structure commonly referred to as the "tape catalog (TD)" is often used to determine which general area of ​​the tape the target record is located in.

[0095] For example, in an LTO tape drive, a volume is divided into two sub-regions. In such a system, the tape catalog identifies which of the two sub-regions the target record is located in. In contrast, in known tape drives, such as the IBM TS1160, each volume is divided into 128 smaller sub-regions along the tape length. In such a system, in addition to the TD data structure, the High Resolution Tape Catalog (HRTD) data structure 510 ( Figure 5 A) Identifies a specific sub-region within 128 sub-regions for each record recorded on the magnetic tape, where the target record is recorded. As previously described, the HRTD (High Resolution Tape Catalog) data structure 510 ( Figure 5 A) Stored in the tape data section called Housekeeping Dataset 514.

[0096] Therefore, in a known system with an HRTD type catalog, upon receiving a relocation request to relocate the tape to read a specified target record, the HRTD data structure is examined to identify which specific sub-region among the possible 128 sub-regions contains the specified target record number or file tag number. In a known tape drive system, the physical location of each HRTD sub-region of the tape is known to the tape relocation logic. Therefore, the tape is relocated by the tape relocation logic to the specific sub-region identified by the HRTD data structure. The tape drive system's read logic then sequentially searches for records in the dataset located within the region, starting from the beginning of the region.

[0097] The records stored in each region or subregion of a magnetic tape are generally referred to as a dataset. Known tape drive systems utilize a Dataset Information Table (DSIT), which identifies the number of records in a region of the dataset that occupies a subregion of the tape. The number of file tags in a particular dataset is also known, such as the number of file tags at the beginning of the dataset. Using the target record number of a specified target record in the target dataset, the number of records in the target dataset as indicated in the DSIT, and the first file tag number and the number of file tags in the target dataset, the read logic of a known tape drive can check whether the target record is found in the target dataset. Once it is confirmed that the desired record is in the dataset being checked, the relocation request is terminated. Therefore, reading one or more datasets continues until a dataset containing the desired record is found.

[0098] It is understandable that in tape drive systems using the HRTD data structure in tape house data sets, because each tape winding is subdivided into relatively small sub-regions, and the HRTD data structure identifies the records in each such sub-region, a specific record can be located relatively quickly. Therefore, a search for a relatively small sub-region of a specific record can be completed quickly. On the other hand, the specifications of LTO tape drives can be defined by different standards. As a result, datasets such as HRTD data structures cannot typically be written to house data sets in known LTO tape drives. To address this issue, known LTO tape drives sold by IBM create information that is the same as or similar to the information found in the HRTD data structure. This HRTD type information is recorded as a virtual HRTD (vHRTD) in the free space of the dataset, known as the End of Data (EOD), which is typically written last in the data writing process to the tape. Figure 5 B shows an example of a known vHRTD 530 recorded in the EOD dataset 534, which is partitioned as described below.

[0099] However, in known tape drive systems, the EOD dataset is not read when the tape is loaded and mounted. As a result, the vHRTD is not read in association with tape loading and mounting, and therefore cannot be used to facilitate read operations requested by applications after tape loading and mounting. Therefore, tape access operations responding to application access requests received after tape loading and mounting do not use the vHRTD directory for a time interval following tape loading and mounting completion. However, it should be understood that an access request can eventually be received from the host, causing the vHRTD to be read from the EOD. Examples of such subsequent access include data appended to or near the accessed EOD dataset as a result of a host-requested access. The vHRTD remains unread until such an access request is received, thus slowing down host-requested access during the intermediate period. However, once an access request leading to the reading of the vHRTD is received, subsequent relocation can be performed at high speed using the vHRTD.

[0100] Now for reference Figure 7 Figure 700 illustrates an example process of operating a computer system employing aspects of relocation management according to this disclosure. In this embodiment, tape relocation management 255 ( Figure 2 ) and the tape repositioning logic 257 controlled by the tape repositioning management 255 and the tape cartridge control unit ( Figure 3 ) is configured to execute Figure 7 The process involves 700 operations; however, it should be understood that, depending on the specific application, other logic may be configured to perform these operations.

[0101] In one embodiment, such as Figure 3 , Figure 6 The tape cassette 302 can be loaded into, for example, tapes via automated equipment. Figure 3 The tape drive 231 is located in the tape drive. In some embodiments, the tape cartridge can be manually loaded by the user and can be loaded using the appropriate user interface of the tape repositioning management 255, or it can be loaded by a combination of automatic and manual operation.

[0102] In one embodiment, process 700 begins by detecting that a tape cassette is being loaded into the tape drive system and determining whether the cassette being loaded is compatible with a known high-resolution tape catalog, such as an HRTD type tape cassette. This is illustrated in step 705. In one embodiment, the tape loading operation can be automatically activated by tape repositioning management 255 or by a unit controlled by tape repositioning management 255. In other embodiments, the tape loading or mounting operation can be manually activated via the appropriate user interface of tape repositioning management 255, or by a combination of automatic and manual operation.

[0103] In some embodiments, the tape repositioning management 255 attempts to read the sHKDS during tape loading. If readable, the HRTD is acquired and verified.

[0104] Once the tape is detected / loaded in the tape drive, process 700 continues by waiting for a command from the host. This is illustrated in step 710. Tape relocation management 255 will wait for a command from the host. If the command is neither a read command nor a write command, then in step 715 it is "No," and process 700 continues by executing the command. This is illustrated in step 725. For example, tape relocation management 255 may receive and execute relocation commands (e.g., positioning commands or space commands).

[0105] If the command is a read or write command, then in step 715, if "Yes", process 700 continues by determining whether the current position is at the beginning of the tape (BOT). This is illustrated in step 720. If the current position is at the BOT position, then in step 720, if "Yes", process 700 continues to step 725, where the read or write command is executed. If the current position is not at the BOT position, then in step 720, if "No", process 700 continues by attempting to read and verify the HRTD. This is illustrated in step 730.

[0106] If the HRTD is readable and valid, then step 730 is "Yes," and process 700 continues to step 725, executing a read or write command. If the HRTD is unreadable / valid, then step 730 is "No," and process 700 continues by clearing the timer. This is shown in step 735. In the embodiment, the timer is used as a trigger for HRTD recovery. Typically, the HRTD can be recovered at any time once a series of commands (from relocation to reading or writing the necessary data) has been executed. A timer is used as a means of distinguishing interruptions between a series of processes. Because the application executes a series of processes continuously, there are almost no interruptions between commands. Setting the timer to around 10 seconds is sufficient to reduce the time loss from relocation performed without the HRTD and media damage caused by skimming, as statistically calculated during the aforementioned performance tests.

[0107] Process 700 continues by determining whether the command is a read command. This is shown at 740. If the command is a read command, then "yes" is set at step 740, and the process continues by reading data from the tape (shown at step 745) and setting a timer (shown at step 755). The timer can be set to a predetermined time limit (e.g., 10 seconds). Once set, process 700 continues by returning to the command status at step 710, where it waits for a new command.

[0108] Now for referenceFigure 8 Figure 800 illustrates an example process of operating a computer system employing aspects of relocation management according to this disclosure. In some embodiments, process 700 may include, for example... Figure 8 The process or subprocess 800 is shown. Process 800 begins when the predetermined time limit set for the timer (in step 755) expires. This is shown in step 805. Once the predetermined time limit has expired, process 800 continues by repositioning the tape drive to EOD. This is shown in step 810. Process 800 continues by reading and verifying the HRTD. This is shown in step 815.

[0109] return Figure 7 If the command is not a read command, then "No" is set at step 740, and process 700 continues by performing a repositioning procedure. This is shown in step 750. Once the repositioning procedure is complete, process 700 continues by writing data onto the tape. This is shown in step 760. Once the data is written onto the tape, the process returns to the command state of step 710, where the tape drive awaits a new command.

[0110] Now for reference Figure 9 Figure 900 illustrates an example process of operating a computer system employing aspects of relocation management according to this disclosure. In some embodiments, process 700 may include, for example... Figure 9 The process or sub-process 900 is shown. Process 900 may include additional steps or sub-steps to the relocation process step 750. For a conventional relocation step, the relocation process is complete when the record intended as the relocation target has been read from the tape and recorded in the segment buffer. Only when there is no target record in the segment buffer does the tape drive move to the dataset location, where the target is recorded and read from the tape. As shown in process 900, when the HRTD is invalid in write mode, the tape drive reads the EOD, verifies the HRTD, and then moves to the dataset location where the target is recorded before writing. Thus, even if the target is recorded in the segment buffer, if the tape drive moves to the EOD location and reads the EOD, the information of the segment with the target recorded stored in the buffer is invalid. These steps will be described further below.

[0111] Process 900 begins by determining whether the tape drive is in write mode. This is shown in step 910. If the tape drive is in write mode (Yes at 910), process 900 continues by determining whether the HRTD is valid. This is shown in step 915. If the HRTD is unreadable or invalid, process 900 continues by reading the EOD to verify the HRTD. This is shown in step 925. Process 900 continues by repositioning to the location of the dataset in which the recording target is located before writing. This is shown in step 930. Once repositioned, process 900 continues where the repositioning process has been completed. This is shown at 940.

[0112] Returning to step 910, if the tape drive is not in write mode ("No"), process 900 continues by determining whether the record targeted for repositioning has been read from the tape and recorded in the segment buffer. This is shown in step 920. If the record targeted for repositioning has been read and recorded in the segment buffer ("Yes"), process 900 continues, where the repositioning process has been completed. This is shown in step 940.

[0113] If the record targeted for relocation is not in the segment buffer, then at step 920 it is "No", and process 900 continues by relocating to the location of the dataset, where the target is recorded and the target is read from the tape. This is shown in step 930.

[0114] Returning to step 915, if HRTD is valid, then in step 915, the condition is "Yes", and then process 900 continues by determining whether the record as the relocation target has been read from the tape and recording it in the segment buffer as described in step 920 above.

[0115] Now for reference Figure 10 Figure 1000 illustrates an example of the probability of the next command occurring within a relocation command interval according to an embodiment of the present disclosure. It is known that if an event occurs an average of λ times within a fixed period, the period X from one occurrence of the event to the next occurrence of the event follows an exponential distribution. The probability density function of the exponential distribution... f ( x The event is given by the following formula, where the period X until the next event occurs is X = x:

[0116]

[0117] The cumulative distribution function F(x) is given by the following expression using the probability density function f(x):

[0118]

[0119] That is, if X represents the period before the next event, which occurs an average of λ times within a fixed period, occurs, the probability that period X will become equal to or less than x is 1 - e^(-λx). Conversely, the probability that period X will become greater than x (i.e., the event will not occur until x has elapsed) is e^(-λx). If, after generating a relocation command, the tape drive moves to EOD to restore HRTD when x has elapsed, the probability that the next relocation command will not be generated until y has elapsed is calculated. The probability that the next relocation command will not be generated in the first period x is e^(-λx), the probability that the next relocation command will not be generated in the period x+y is e^(-λ(x+y)), and the probability that the next relocation command will not be generated in the first period x and further in the next period y is:

[0120]

[0121] This means that the probability of generating the next command depends only on the time y elapsed since the drive started moving to the EOD, and not on the timer setting x after the command is issued. This ensures that HRTD recovery can be performed at any time once the series of commands has been processed.

[0122] As mentioned above, HRTD recovery took 28.21 seconds. When relocation commands are generated an average of 60 times per hour (approximately once per minute -1002), 30 times per hour (approximately once per hour (1004), 20 times per hour (approximately once per hour (1006), 12 times per hour (approximately once per hour (1008), and 6 times per hour (10 times per hour (1010), the probability of generating the next relocation command within the 28 seconds spent recovering HRTD is... Figure 10 As shown, because each relocation command reduces α = 2.57 seconds, if no next relocation command is generated within 2.572 x 2 = 5.14 seconds after the first relocation command is generated, relocation using the conventional method wastes more time than HRTD recovery. Figure 10 As shown, if a relocation command is generated approximately once every 1 minute (1002), the probability that the next relocation command will not be generated until 5.14 seconds have elapsed is 8.2%; if a relocation command is generated approximately once every 2 minutes (1004), the probability is 4.2%; if a relocation command is generated approximately once every 5 minutes (1008), the probability is 1.7%; and if a relocation command is generated approximately once every 10 minutes (1010), the probability is 0.9%.

[0123] Now for reference Figure 11This illustration shows a high-level block diagram of an example computer system 1101 that can be used to implement one or more of the methods, tools, and modules described herein, as well as any associated functionality (e.g., using one or more processor circuits or a computer processor) according to embodiments of the present disclosure. In some embodiments, the main components of the computer system 1101 may include one or more CPUs 1102, a memory subsystem 1104, a terminal interface 1112, a storage interface 1116, an I / O (input / output) device interface 1114, and a network interface 1118, all of which may be directly or indirectly communicatively coupled to enable inter-component communication via a memory bus 1103, an I / O bus 1108, and an I / O bus interface 1110.

[0124] Computer system 1101 may include one or more general-purpose programmable central processing units (CPUs) 1102A, 1102B, 1102C, and 1102D, generally referred to herein as CPU 1102. In some embodiments, computer system 1101 may include a typical multiple processors of a relatively large system; however, in other embodiments, computer system 1101 may alternatively be a single-CPU system. Each CPU 1102 may execute instructions stored in memory subsystem 1104 and may include one or more levels of onboard cache. In some embodiments, the processor may include at least one or more memory controllers and / or memory controllers. In some embodiments, the CPU may perform processes included herein (e.g., respectively as follows). Figure 7 , Figure 8 and Figure 9 (Processes 700, 800, and 900 described herein). In some embodiments, computer system 1101 may be configured to Figure 2 Control storage controller 228 and / or Figure 3 Control unit 302.

[0125] System memory subsystem 1104 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 1122 or cache memory 1124. Computer system 1101 may also include other removable / non-removable, volatile / non-volatile computer system data storage media. By way of example only, storage system 1126 may be provided for reading from and writing to non-removable, non-volatile magnetic media such as a "hard disk drive," although not shown, and may be provided for reading from and writing to removable, non-volatile disks (e.g., "floppy disks"), or may be provided for reading from or writing to removable, non-volatile optical disks such as CD-ROMs, DVD-ROMs, or other optical media. Additionally, memory subsystem 1104 may include flash memory, such as a flash stick drive or flash drive. Memory devices may be connected to memory bus 1103 via one or more data media interfaces. Memory subsystem 1104 may include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of various embodiments.

[0126] Although memory bus 1103 is Figure 11 While shown as a single bus structure providing a direct communication path between CPU 1102, memory subsystem 1104, and I / O bus interface 1110, in some embodiments, memory bus 1103 may include multiple different buses or communication paths, which may be arranged in any of a variety of forms, such as hierarchical point-to-point links, star or mesh configurations, multi-layer buses, parallel and redundant paths, or any other suitable type of configuration. Furthermore, although I / O bus interface 1110 and I / O bus 1108 are shown as a single unit, in some embodiments, computer system 1101 may include multiple I / O bus interfaces 1110, multiple I / O buses 1108, or both. Additionally, although multiple I / O interface units separating I / O bus 1108 from various communication paths extending to individual I / O devices are shown, in other embodiments, some or all I / O devices may be directly connected to one or more system I / O buses.

[0127] In some embodiments, computer system 1101 may be a multi-user mainframe computer system, a single-user system, a server computer, or a similar device that has little or no direct user interface but receives requests from other computer systems (clients). Furthermore, in some embodiments, computer system 1101 may be implemented as a desktop computer, portable computer, laptop or notebook computer, tablet computer, pocket computer, telephone, smartphone, network switch or router, or any other suitable type of electronic device.

[0128] Notice, Figure 11 This description aims to depict representative main components of an exemplary computer system 1101. However, in some embodiments, the various components may have more... Figure 11 The greater or lesser complexities shown can exist differently from those described above. Figure 11 The components shown or other components besides these components, and the number, type and configuration of these components can be changed.

[0129] One or more programs / utilities 1128 may be stored in the memory subsystem 1104, each program / utility having at least one set of program modules 1130. Programs / utilities 1128 may include a hypervisor (also known as a virtual machine monitor), one or more operating systems, one or more applications, other program modules, and program data. Each of the operating system, one or more applications, other program modules, and program data, or some combination thereof, may include an implementation of a networking environment. Programs / utilities 1128 and / or program modules 1130 generally perform the functions or methods of various embodiments.

[0130] Various aspects of this disclosure are described by narrative text, flowcharts, block diagrams of computer systems, and / or block diagrams of machine logic included in embodiments of a computer program product (CPP). Regarding any flowchart, depending on the technology involved, operations may be performed in a different order than that shown in a given flowchart. For example, again according to the technology involved, two operations shown in consecutive flowchart blocks may be performed in reverse order, as a single integrated step, simultaneously, or in a manner that at least partially overlaps in time.

[0131] Computer Program Product Embodiment (“CPP Embodiment” or “CPP”) is a term used in this disclosure to describe any collection of one or more storage media (also referred to as “media”) collectively included in a collection of one or more storage devices, which collectively include machine-readable code corresponding to instructions and / or data for performing computer operations specified in a given CPP claim. A “storage device” is any tangible device capable of holding and storing instructions used by a computer processor. Without limitation, a computer-readable storage medium can be an electronic storage medium, a magnetic storage medium, an optical storage medium, an electromagnetic storage medium, a semiconductor storage medium, a mechanical storage medium, or any suitable combination of the foregoing. Some known types of storage devices that include these media include: magnetic disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), static random access memory (SRAM), compact disc read-only memory (CD-ROM), digital versatile disc (DVD), memory sticks, floppy disks, mechanical encoding devices (such as punched cards or pull-out discs formed in the main surface of the disk), or any suitable combination of the foregoing. Computer-readable storage media, as used in this disclosure, should not be construed as storing transient signals themselves, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through waveguides, optical pulses through fiber optic cables, electrical signals transmitted through wires, and / or other transmission media. As those skilled in the art will understand, data is typically moved at certain incidental points in time during normal operation of the storage device, such as during access, defragmentation, or garbage collection; however, this does not make the storage device transient, because the data is not transient when it is stored.

[0132] Embodiments of this disclosure can be implemented with virtually any type of computer, regardless of whether the platform is suitable for storing and / or executing program code. Figure 12 A computing environment 1200 (e.g., a cloud computing system) is illustrated as an example, adapted to execute program code related to the methods disclosed herein, and adapted to minimize HRTD recovery time in a tape drive storage system. In some embodiments, the computing environment 1200 may be associated with Figure 1 and Figure 2, respectively. Figure 2 The computing environment is the same as or implemented as 100 and / or 200.

[0133] The computing environment 1200 includes examples of environments for executing at least some of the computer code involved in performing the methods of the present invention, such as tape repositioning program code 1300. Tape repositioning program code 1300 may be a code-based implementation of the electronic cooling system 100. In addition to tape repositioning program code 1300, the computing environment 1200 includes, for example, a computer 1201, a wide area network (WAN) 1202, an end-user equipment (EUD) 1203, a remote server 1204, a public cloud 1205, and a private cloud 1206. In this embodiment, computer 1201 includes processor group 1210 (including processing circuitry 1220 and cache 1221), communication architecture 1211, volatile memory 1212, persistent storage device 1213 (including operating system 1222 and tape relocation program code 1300, as described above), peripheral device group 1214 (including user interface (UI) device group 1223, storage device 1224, and Internet of Things (IoT) sensor group 1225), and network module 1215. Remote server 1204 includes remote database 1230. Public cloud 1205 includes gateway 1240, cloud coordination module 1241, host physical machine group 1242, virtual machine group 1243, and container group 1244.

[0134] Computer 1201 may take the form of a desktop computer, laptop computer, tablet computer, smartphone, smartwatch or other wearable computer, mainframe computer, quantum computer, or any other form of computer or mobile device now known or to be developed in the future capable of running programs, accessing networks, or querying databases such as remote database 1230. As is well known in the field of computer technology, and depending on that technology, the performance of a computer-implemented method can be distributed across multiple computers and / or multiple locations. On the other hand, in this presentation of computing environment 1200, detailed discussion focuses on a single computer, specifically computer 1201, to keep the presentation as simple as possible. Computer 1201 may reside in the cloud, even... Figure 12 The computer 1201 is not shown in the cloud, and on the other hand, the computer 1201 does not need to be in the cloud unless it can be definitively indicated to any extent.

[0135] Processor group 1210 includes one or more computer processors of any type now known or to be developed in the future. Processing circuitry 1220 may be distributed across multiple packages, such as multiple cooperating integrated circuit chips. Processing circuitry 1220 may implement multiple processor threads and / or multiple processor cores. Cache 1221 is memory located within the processor chip package(s) and is typically used for data or code that should be readily accessible by the threads or cores running on processor group 1210. Cache memory is typically organized into multiple levels based on its relative proximity to the processing circuitry. Alternatively, some or all of the caches in the processor group may be located “off-chip.” In some computing environments, processor group 1210 may be designed to work with qubits and perform quantum computing.

[0136] Computer-readable program instructions are typically loaded onto computer 1201 to cause the processor assembly 1210 of computer 1201 to perform a series of operational steps to implement a computer-implemented method, such that the instructions thus executed instantiate the method specified in the flowcharts and / or descriptive descriptions of the computer-implemented method included in this document (collectively, the “method of the invention”). These computer-readable program instructions are stored in various types of computer-readable storage media, such as cache 1221 and other storage media discussed below. The program instructions and associated data are accessed by processor assembly 1210 to control and direct the execution of the method of the invention. In computing environment 1200, at least some of the instructions for performing the method of the invention may be stored in magnetic tape relocation program code 1300 in permanent storage device 1213.

[0137] Communication architecture 1211 is a signal transmission path that allows various components of computer 1201 to communicate with each other. Typically, this structure consists of switches and conductive paths, such as switches and conductive paths that form buses, bridges, physical input / output ports, etc. Other types of signal communication paths can be used, such as fiber optic communication paths and / or wireless communication paths.

[0138] Volatile memory 1212 is any type of volatile memory now known or to be developed in the future. Examples include dynamic random access memory (RAM) or static RAM. Typically, volatile memory 1212 is characterized by random access, but this is not required unless explicitly indicated. In computer 1201, volatile memory 1212 is located in a single package and is internal to computer 1201; however, alternatively or additionally, volatile memory may be distributed across multiple packages and / or located externally relative to computer 1201.

[0139] The persistent storage device 1213 is any form of non-volatile storage device for a computer, now known or to be developed in the future. The non-volatility of this storage device means that the stored data is retained regardless of whether power is being supplied to the computer 1201 and / or directly to the persistent storage device 1213. The persistent storage device 1213 may be a read-only memory (ROM), but typically at least a portion of the persistent storage device allows for data writing, data deletion, and data rewriting. Some common forms of persistent storage devices include hard disks and solid-state storage devices. The operating system 1222 may take several forms, such as various known proprietary operating systems or operating systems employing an open-source portable operating system interface type with a kernel. The code contained in the tape relocation procedure code 1300 typically includes at least some of the computer code involved in performing the methods of the present invention.

[0140] Peripheral device group 1214 includes the peripheral device group of computer 1201. Data communication connections between peripheral devices and other components of computer 1201 can be implemented in various ways, such as Bluetooth connections, near field communication (NFC) connections, connections made by cables (such as Universal Serial Bus (USB) type cables), plug-in connections (e.g., secure digital (SD) cards), connections made through local area communication networks, and even connections made through wide area networks such as the Internet. In various embodiments, UI device set 1223 may include components such as displays, speakers, microphones, wearable devices (such as goggles and smartwatches), keyboards, mice, printers, touchpads, game controllers, and haptic devices. Storage device 1224 is external storage, such as an external hard drive, or pluggable storage, such as an SD card. Storage device 1224 can be persistent and / or volatile. In some embodiments, storage device 1224 may take the form of a quantum computing storage device for storing data in the form of qubits. In embodiments where computer 1201 requires substantial storage (e.g., where computer 1201 locally stores and manages a large database), this storage can be provided by peripheral storage devices designed to store very large amounts of data, such as a storage area network (SAN) shared by multiple geographically distributed computers. The IoT sensor set 1225 consists of sensors that can be used in IoT applications. For example, one sensor could be a thermometer, while another could be a motion detector.

[0141] Network module 1215 is a collection of computer software, hardware, and firmware that allows computer 1201 to communicate with other computers via WAN 1202. Network module 1215 may include hardware such as a modem or Wi-Fi transceiver, software for packetizing and / or depacketizing data transmitted over the communication network, and / or web browser software for transmitting data over the Internet. In some embodiments, the network control and network forwarding functions of network module 1215 are performed on the same physical hardware device. In other embodiments (e.g., embodiments utilizing Software-Defined Networking (SDN), the control and forwarding functions of network module 1215 are performed on physically separate devices, such that the control function manages several different network hardware devices. Computer-readable program instructions for performing the methods of the present invention can typically be downloaded to computer 1201 from an external computer or external storage device via a network adapter card or network interface included in network module 1215.

[0142] A WAN 1202 is any wide area network (e.g., the Internet) capable of transmitting computer data over non-local distances using any technology known now or developed in the future for transmitting computer data. In some embodiments, a WAN 1202 may be replaced and / or supplemented by a local area network (LAN) designed to transmit data between devices located in a local area such as a Wi-Fi network. WANs and / or LANs typically include computer hardware such as copper transmission cables, fiber optic transmissions, wireless transmissions, routers, firewalls, switches, gateway computers, and edge servers.

[0143] End User Equipment (EUD) 1203 is any computer system used and controlled by an end user (e.g., a customer of the enterprise operating computer 1201) and can take any of the forms discussed above in conjunction with computer 1201. EUD 1203 typically receives helpful and useful data from the operation of computer 1201. For example, assuming computer 1201 is designed to provide recommendations to the end user, these recommendations are typically transmitted from network module 1215 of computer 1201 to EUD 1203 via WAN 1202. In this way, EUD 1203 can display or otherwise present the recommendations to the end user. In some embodiments, EUD 1203 can be a client device, such as a thin client, a heavy client, a mainframe computer, a desktop computer, etc.

[0144] Remote server 1204 is any computer system that provides at least some data and / or functionality to computer 1201. Remote server 1204 can be controlled and used by the same entity operating computer 1201. Remote server 1204 represents multiple machines that collect and store helpful and useful data for use by other computers such as computer 1201. For example, if computer 1201 is designed and programmed to provide recommendations based on historical data, that historical data can be provided to computer 1201 from a remote database 1230 of remote server 1204.

[0145] Public cloud 1205 is any computer system that can be used by multiple entities, providing on-demand availability of computer system resources and / or other computing capabilities (especially data storage (cloud storage) and computing power) without the need for direct, active management by users. Cloud computing typically leverages resource sharing to achieve scalability and economy. Direct and active management of the computing resources of public cloud 1205 is performed by the computer hardware and / or software of cloud coordination module 1241. The computing resources provided by public cloud 1205 are typically implemented by virtual computing environments running on various computers constituting the host physical machine set 1242, which are the entire domain of the physical computers in public cloud 1205 and / or available to the public cloud. Virtual computing environments (VCEs) typically take the form of virtual machines from virtual machine group 1243 and / or containers from container group 1244. It should be understood that these VCEs can be stored as images and can be transferred between various physical machine hosts as images or after the VCEs are instantiated. The cloud coordination module 1241 manages the transmission and storage of images, deploys new instantiations of VCE, and manages active instantiations of VCE deployments. Gateway 1240 is a collection of computer software, hardware, and firmware that allows the public cloud 1205 to communicate via WAN 1202.

[0146] Now, we will provide some further explanation of Virtualized Computing Environments (VCEs). A VCE can be stored as an "image." New active instances of a VCE can be instantiated from this image. Two common types of VCEs are virtual machines and containers. A container is a VCE that uses operating system-level virtualization. This refers to an operating system feature where the kernel allows multiple isolated user-space instances, called containers, to exist. From the perspective of the programs running within them, these isolated user-space instances typically appear as actual computers. Computer programs running on a regular operating system can utilize all the resources of that computer, such as connected devices, files and folders, network shares, CPU power, and quantifiable hardware capabilities. However, programs running within a container can only use the contents of the container and the devices allocated to the container; this is a characteristic known as containerization.

[0147] Private cloud 1206 is similar to public cloud 1205, except that computing resources are available only to a single enterprise. While private cloud 1206 is depicted communicating with WAN 1202, in other embodiments, private cloud may be completely disconnected from the internet and accessible only via a local / private network. A hybrid cloud is a combination of multiple clouds of different types (e.g., private, community, or public cloud types) typically implemented by different vendors. Each of the multiple clouds remains a separate and discrete entity, but the larger hybrid cloud architecture is bound together by standardization or proprietary technology that enables coordination, management, and / or data / application portability across the multiple component clouds. In this embodiment, both public cloud 1205 and private cloud 1206 are part of a larger hybrid cloud.

[0148] It should be understood that although this disclosure includes a detailed description of cloud computing, the implementation of the teachings set forth herein is not limited to a cloud computing environment. Rather, embodiments of this disclosure can be implemented in conjunction with any other type of computing environment now known or developed hereafter. In some embodiments, one or more of the operating system 1222 and tape relocation program code 1300 may be implemented as a service model. Service models may include Software as a Service (SaaS), Platform as a Service (PaaS), and Infrastructure as a Service (IaaS). In SaaS, the capability provided to consumers is the use of a provider's application running on cloud infrastructure. The application can be accessed from various client devices through a thin client interface such as a web browser (e.g., web-based email). Consumers do not manage or control the underlying cloud infrastructure, including the network, servers, operating system, storage, or even individual application capabilities, with the possible exception of limited user-specific application configuration settings. In PaaS, the capability provided to consumers is the deployment of consumer-created or acquired applications onto cloud infrastructure, the consumer-created or acquired applications being created using programming languages ​​and tools supported by the provider. Consumers do not manage or control the underlying cloud infrastructure, including networks, servers, operating systems, or storage, but they do have control over the deployed applications and the configuration of possible application hosting environments. In IaaS, the capabilities provided to consumers are processing, storage, networking, and other basic computing resources that enable consumers to deploy and run arbitrary software, which may include operating systems and applications. Consumers do not manage or control the underlying cloud infrastructure, but they have control over the operating system, storage, deployed applications, and possibly limited control over selected networking components (e.g., host firewalls).

[0149] Various aspects of the present invention are described herein with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer-readable program instructions.

[0150] These computer-readable program instructions may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions / actions specified in one or more blocks of a flowchart and / or block diagram. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and / or other devices to operate in a particular manner, such that the computer-readable storage medium in which the instructions are stored includes an article of writing comprising instructions for implementing aspects of the functions / actions specified in one or more blocks of a flowchart and / or block diagram.

[0151] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus or another device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer-implemented process, such that the instructions, which execute on the computer, other programmable apparatus or other device, implement the functions / actions specified in one or more blocks of a flowchart and / or block diagram.

[0152] The flowcharts and / or block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of instructions comprising one or more executable instructions for implementing a specified logical function(s). In some alternative embodiments, the functions mentioned in a block may occur in a non-consecutive order as shown in the figures. For example, two blocks shown consecutively may actually be executed substantially simultaneously, or these blocks may sometimes be executed in reverse order, depending on the functions involved. It will also be noted that each block illustrated in the block diagrams and / or flowcharts, and combinations of blocks illustrated in the block diagrams and / or flowcharts, may be implemented by a dedicated hardware-based system that performs the specified function or action or executes a combination of dedicated hardware and computer instructions.

[0153] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the various embodiments. As used herein, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that the terms “comprising” and / or “including” as used in this specification designate the presence of stated features, integers, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof. In the preceding detailed description of exemplary embodiments of various embodiments, reference has been made to the accompanying drawings (in which like reference numerals denote like elements), which form part of the invention, and in which specific exemplary embodiments in which various embodiments may be practiced are illustrated by way of illustration. These embodiments have been described in sufficient detail to enable those skilled in the art to practice them, but other embodiments may be used, and logical, mechanical, electrical, and other changes may be made without departing from the scope of the various embodiments. In the preceding description, numerous specific details have been set forth to provide a thorough understanding of the various embodiments. However, various embodiments may be practiced without these specific details. In other instances, well-known circuits, structures, and techniques have not been shown in detail so as not to obscure the embodiments.

[0154] Different instances of the term "embodiment" used in this specification do not necessarily refer to the same embodiment, but may refer to the same embodiment. Any data and data structures shown or described herein are merely examples, and in other embodiments, different amounts of data, data types, the number and types of fields, field names, the number and types of rows, records, entries, or organization of data may be used. Furthermore, any data can be logically combined, thus eliminating the need for a separate data structure. Therefore, the foregoing detailed description should not be construed as limiting.

[0155] Various embodiments of this disclosure have been described for illustrative purposes, but are not intended to be exhaustive or limited to the disclosed embodiments. Many modifications and variations will be apparent to those skilled in the art without departing from the scope and spirit of the described embodiments. The terminology used herein has been chosen to best explain the principles of the embodiments, their practical application, or improvements to existing technologies in the market, or to enable others skilled in the art to understand the embodiments disclosed herein.

[0156] Although this disclosure has been described with reference to specific embodiments, changes and modifications thereto will be apparent to those skilled in the art. Therefore, the appended claims are intended to be construed as covering all such alterations and modifications that fall within the true spirit and scope of this disclosure.

Claims

1. A method for minimizing HRTD recovery time when the High Resolution Tape Directory (HRTD) is invalid, wherein the method is performed by a tape drive, the method comprising: Load the magnetic tape into the magnetic tape drive; In response to receiving a write command or read command at the Beginning of Tape (BOT) position, the write command or read command is executed without performing HRTD recovery; In response to receiving a write command or a read command at a location other than the BOT location, determine whether the HRTD is valid; and In response to determining that the HRTD is invalid, the timer is cleared.

2. The method according to claim 1, further comprising: In response to receiving the write command at the location outside the BOT location, reposition to the End of Data (EOD) location; Read the HRTD from the EOD location; Verify the HRTD; and Execute the write command.

3. The method according to claim 1, further comprising: In response to receiving the read command at the location outside the BOT location, execute the read command; as well as If HRTD recovery is required after processing the read command, the timer is set to a predetermined time limit.

4. The method according to claim 3, further comprising: In response to the predetermined time limit being reached, the system is repositioned to the End of Data (EOD) position; Read the HRTD from the EOD location; as well as Verify the HRTD.

5. The method of claim 3, wherein the predetermined time limit is calculated statistically.

6. The method of claim 5, wherein the predetermined time limit is set to 10 seconds.

7. The method according to claim 1, further comprising: In response to the HRTD being invalid in write mode, the data is redirected to the end of data (EOD) position; Read the HRTD from the EOD location; Verify the HRTD; as well as The target location is repositioned by reading the tape.

8. A system for minimizing HRTD recovery time when a high-resolution tape catalog (HRTD) is invalid, the system comprising: processor; as well as A computer-readable storage medium communicatively coupled to a processor of a magnetic tape drive and storing program instructions that, when executed by the processor, cause the processor of the magnetic tape drive to perform a method comprising: Load the magnetic tape into the magnetic tape drive; In response to receiving a write command or read command at the Beginning of Tape (BOT) position, the write command or read command is executed without performing HRTD recovery; In response to receiving a write command or a read command at a location other than the BOT location, determine whether the HRTD is valid; and In response to determining that the HRTD is invalid, the timer is cleared.

9. The system of claim 8, wherein the method performed by the processor of the magnetic tape drive further comprises: In response to receiving the write command at the location outside the BOT location, reposition to the End of Data (EOD) location; Read the HRTD from the EOD location; Verify the HRTD; and Execute the write command.

10. The system of claim 8, wherein the method performed by the processor of the magnetic tape drive further comprises: In response to receiving the read command at the location outside the BOT location, execute the read command; as well as If HRTD recovery is required after processing the read command, the timer is set to a predetermined time limit.

11. The system of claim 10, wherein the method performed by the processor of the magnetic tape drive further comprises: In response to the predetermined time limit being reached, the system is repositioned to the End of Data (EOD) position; Read the HRTD from the EOD location; as well as Verify the HRTD.

12. The system of claim 10, wherein the predetermined time limit is calculated statistically.

13. The system of claim 8, wherein the method performed by the processor of the magnetic tape drive further comprises: In response to the HRTD being invalid in write mode, the data is redirected to the end of data (EOD) position; Read the HRTD from the EOD location; Verify the HRTD; as well as The target location is repositioned by reading the tape.

14. A computer program product comprising a computer-readable storage medium having program instructions executable by a processor of a tape drive to cause the processor to perform a method for minimizing HRTD recovery time when a High Resolution Tape Directory (HRTD) is invalid, the method comprising: Load the magnetic tape into the magnetic tape drive; In response to receiving a write command or read command at the Beginning of Tape (BOT) position, the write command or read command is executed without performing HRTD recovery; In response to receiving a write command or a read command at a location other than the BOT location, determine whether the HRTD is valid; and In response to determining that the HRTD is invalid, the timer is cleared.

15. The computer program product of claim 14, wherein the method executed by the processor of the magnetic tape drive further comprises: In response to receiving the write command at the location outside the BOT location, reposition to the End of Data (EOD) location; Read the HRTD from the EOD location; Verify the HRTD; and Execute the write command.

16. The computer program product of claim 14, wherein the method executed by the processor of the magnetic tape drive further comprises: In response to receiving the read command at the location outside the BOT location, execute the read command; as well as If HRTD recovery is required after processing the read command, the timer is set to a predetermined time limit.

17. The computer program product of claim 16, wherein the method executed by the processor of the magnetic tape drive further comprises: In response to the predetermined time limit being reached, the system is repositioned to the End of Data (EOD) position; Read the HRTD from the EOD location; as well as Verify the HRTD.

18. The computer program product of claim 16, wherein the predetermined time limit is calculated statistically.

19. The computer program product of claim 18, wherein the predetermined time limit is 10 seconds.

20. The computer program product of claim 14, wherein the method executed by the processor of the magnetic tape drive further comprises: In response to the HRTD being invalid in write mode, the data is redirected to the end of data (EOD) position; Read the HRTD from the EOD location; Verify the HRTD; as well as The target location is repositioned by reading the tape.