An apparatus, method, system, and program product are disclosed for Tape positioning. One method includes identifying a first position on a first tape between a start of the first tape and an end of the first tape. The method includes determining that an access position of the first tape reaches the first position. The method also includes providing an indication indicating that the access position of the first tape has reached the first position.

Various embodiments of a tape storage system having a physical control unit configured to support multiple logical control units are provided. Each logical control unit supports communication with a single tape drive model type up to a maximum number of drives. A customer obtains a number N of logical control units through purchase, lease or other legitimate avenues. Based on the number of tape drive model types L and the number of tape drives for each type Q.sub.L, the model types are mapped to the N LCUs. In general, mapping priority is given to the newer generation model types and the model types in which the number of attached tape drives Q.sub.L exceeds the capacity M of a single LCU.

In one embodiment, a system includes a disk cache that includes a plurality of hard disk drives (HDDs) and a controller. The controller is configured to create one or more tape-managed partitions in the disk cache, each of the one or more tape-managed partitions being configured to store data that is subject to hierarchical storage management (HSM). The controller is also configured to create a premigration queue configured to service premigration data for all of the one or more tape-managed partitions. Moreover, the controller is configured to receive a premigration delay value for a first tape-managed partition, the premigration delay value defining a time period that elapses prior to queuing the premigration data for the first tape-managed partition to the premigration queue. The premigration delay value is based on a volume creation time. Other systems, methods, and computer program products are described in accordance with more embodiments.

A tape drive system server includes a non-volatile memory used as a cache memory for storing data files, at least part of the cache memory comprising a first region managed using a First In First Out policy management and a second region managed using a Least Recently Used policy management; a file system interface for interacting with data files stored on a tape drive system; an interface for allowing one or more remote systems reading and writing data stored on the cache memory; the server configured to: receive from the one or more remote systems one or more write requests for writing one or more data files; interpret attributes associated to data files instructed to be written by the one or more remote systems; and store data files instructed to be written by the remote systems according to the interpreted attributes.

Various embodiments of a tape storage system having a physical control unit configured to support multiple logical control units are provided. Each logical control unit supports communication with a single tape drive model type up to a maximum number of drives. A customer obtains a number N of logical control units through purchase, lease or other legitimate avenues. Based on the number of tape drive model types L and the number of tape drives for each type Q.sub.L, the model types are mapped to the N LCUs. In general, mapping priority is given to the newer generation model types and the model types in which the number of attached tape drives Q.sub.L exceeds the capacity M of a single LCU.

A computer-implemented method includes identifying a source data object of a distributed computing environment. The distributed computing environment includes two or more storage nodes. The source data object exists as two or more slices. At least one of the slices is replicated on at least two storage nodes. The computer-implemented method further includes associating the source data object with a tape. The tape is written by a tape drive controlled from the distributed computing environment. The computer-implemented method further includes copying the source data object to the tape by, for each source slice of the two or more slices, in sequence: selecting a source node of the two or more storage nodes whereon the source slice is replicated, mounting the tape drive to the source node, appending the source slice to the tape, and unmounting the tape drive. A corresponding computer program product and computer system are also disclosed.

A computer-implemented method includes identifying a source data object of a distributed computing environment. The distributed computing environment includes two or more storage nodes. The source data object exists as two or more slices. At least one of the slices is replicated on at least two storage nodes. The computer-implemented method further includes associating the source data object with a tape. The tape is written by a tape drive controlled from the distributed computing environment. The computer-implemented method further includes copying the source data object to the tape by, for each source slice of the two or more slices, in sequence: selecting a source node of the two or more storage nodes whereon the source slice is replicated, mounting the tape drive to the source node, appending the source slice to the tape, and unmounting the tape drive. A corresponding computer program product and computer system are also disclosed.

Various embodiments are provided for identifying matching tape volumes for data deduplication in an automated data storage library by a processor. A weak hash function on a selected block of streamed data from a host such that the selected block of streamed data with the weak hash function is further compressed to a reduced block of compressed data. N most similar tape volumes in a tape library may be matched according to the weak hash function for performing a data deduplication operation on the reduced block of compressed data between the N most similar tape volumes, wherein N is a positive integer.

A tape storage system having a physical control unit configured to support multiple logical control units is provided. Each logical control unit supports communication with a single tape drive model type up to a maximum number of drives. A customer obtains a number N of logical control units through purchase, lease or other legitimate avenues. Based on the number of tape drive model types L and the number of tape drives for each type Q.sub.L, the model types are mapped to the N LCUs. In general, mapping priority is given to the newer generation model types and the model types in which the number of attached tape drives Q.sub.L exceeds the capacity M of a single LCU. An exception being that the oldest model type is ensured a mapping to an LCU. The LCUs may be reconfigured and the model types remapped on the physical CU if the customer adds different model types to the storage system or obtains a different number of LCUs.

Data is relocated, based on an intelligent data placement algorithm, from a first storage location to a second storage location in a disk storage system. A data placement record is generated including a virtual disk location associated with the data, the second storage location, and a first sequence value. The first sequence value indicates relative sequence when compared to other sequence values. The data placement record is written to a first record location on a first tape cartridge loaded in a tape drive. The data placement records are used with data records to restore data to disk storage from tape backup.