International Business Machines Corporation

Takahiro Tsuda

Koichi Masuda

Sosuke Matsui

Kousei Kawamura

Yutaka Oishi

Norie Iwasaki

Tomokazu Nakamura

Tadaaki Minoura

Takeshi Sohda

Shinsuke Mitsuma

Takeshi Nohta

Tsuyoshi Miyamura

Noriko Yamamoto

Jun Tanaka

Yuki Asakura

Kohichi Masuda

Embodiments are provided for reducing data using a plurality of compression operations in a computing storage environment. A speed of data writing to a virtual tape device and an availability of one or more processor devices for the virtual tape device may be monitored. One or more requests may be received for writing data to the virtual tape device. Data to be written to the virtual tape device, corresponding to a selected number of the one or more requests for writing the data, may be compressed according to both the speed of data writing to the virtual tape device and the availability of one or more processor devices for the virtual tape device. The compressed data may be stored in the virtual tape device in record units. Non-compressed data may be compressed in the virtual tape device at a subsequent period of time (e.g., future time period).

Reducing data using a plurality of compression operations in a virtual tape library

A computer-implemented method, according to one embodiment, includes: receiving a volume at a first cluster in a first tier of a tiered data storage system. The first tier includes of a plurality of clusters, and the first cluster is coupled to a secondary storage in a second tier. A determination is made as to whether any clusters in the first tier are designated as copy target locations for the volume. In response to determining that one or more of the clusters in the first tier are designated as a copy target location, for each of the one or more clusters designated as a copy target location: a determination is made as to whether the given cluster is coupled to the secondary storage. Moreover, in response to determining that the given cluster is not coupled to the secondary storage, a copy of the volume is sent to the given cluster.

Reducing data replications among storage locations

A computer-implemented method for maintaining a storage volume in a virtual tape system includes writing one or more logical volumes associated with a first category and one or more logical volumes associated with a second category to a primary storage in a virtual tape system. The computer-implemented method further includes performing a first automatic removal process in order to free up space on the primary storage, wherein the first automatic removal process removes logical volumes associated with the first category in priority to logical volumes associated with the second category. The computer-implemented method further includes performing a second automatic removal process, wherein the second automatic removal process dynamically alters the priority of the first automatic removal process such that one or more virtual volumes associated with the second category are removed in priority to one or more virtual volumes associated with the first category.

Accelerated data removal in hierarchical storage environments

A storage system receives one or more records from a host system. The records are compressed in a first compression format that is native to the host system. The storage system identifies an incompatibility between the first compression format and a first operation of the storage system. In response to the identified incompatibility, the storage system decompresses the received records. The decompression is based on the first compression format. The storage system compresses the decompressed records in a second compression format. The storage system stores the secondarily compressed records onto a storage medium.

Reading and writing compressed data using long-term storage

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

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

A method for restoring a target file system in a storage system by a computer system, the computer system being connected to a network, the storage system including a tier of sequential access media, the method includes receiving a backup image including metadata of a file of the target file system, from a remote computer system via the network, the metadata indicating a sequential access medium, and restoring the metadata of the target file system using the backup image, the target file system being restored on the computer system by sharing a resource with a native file system operating on the computer system.

Backup and restoration of file system

Embodiments provide a method, a system, and a computer program product for performing copy operations of one or more data units in a hierarchical storage management (HSM) system. The HSM system includes an upper layer and a lower layer. The upper layer includes multiple storage nodes having a grid configuration. The method comprises scheduling a copy operations of multiple data units each of which is stored in at least one of the multiple storage nodes such that loads on the copy operations are distributed among the multiple storage nodes in which the multiple data units are stored and copying the multiple data units to the lower layer in accordance with the scheduling.

Efficient data migration in hierarchical storage management system

A computer-implemented method for providing access to plural virtual sequential access volumes by using random access media, includes: accepting an operation for writing first data to a specific virtual sequential access volume of the plural virtual sequential access volumes; and storing a first file including the first data in the random access media, the first file being separate from a second file including second data stored in the random access media in response to an operation for writing the second data to the specific virtual sequential access volume.

Providing access to virtual sequential access volume

As disclosed herein, a computer implemented method for reading a record on a storage device includes reading, by a processor, the record from the storage device, and generating, by a processor, a header corresponding to the record. The method further includes adding, by a processor, header information corresponding to the metadata to the header, and providing, by a processor, the header and the record to a host. Also disclosed herein, a computer implemented method for writing a record on a storage device includes receiving, by a processor, a header and the record from a host to be written to the storage device, and determining, by a processor, metadata included in header information corresponding to the header. The method further includes determining, by a processor, a write behavior specified by the metadata, and writing, by a processor, the metadata and the record to the storage device according to the write behavior.

Reading and writing a header and record on tape

A method for operating a tape drive may include receiving a command to read a record stored on a tape by a tape drive having a capability to compress and decompress data. The tape drive compresses a record prior to writing the record to tape when a command to write the record to tape specifies that the record is to be compressed, and when a compressed size of the record is smaller than an uncompressed size of the record. The method further include reading the record from the tape by the tape drive, where the tape includes a plurality of compressed records and a plurality of uncompressed records. The method further includes determining by the tape drive whether the record is not compressed. The method may additionally include generating a compressed record by compressing the record by the tape drive when it is determined that the record is not compressed.

Reading records from a tape medium

A method for writing data from a table to a tape includes setting a number of partitions on the tape, where the number of partitions is greater than or equal to a number of columns of the table to be written to the tape, and writing data from each column of the table to at least one partition of the tape, the at least one partition including two or more wraps, the data is written from a top of the two or more wraps towards a bottom of the two or more wraps in a direction of a width of the at least one partition. The written data is reciprocated from a beginning of the tape to an end of the tape in a longitudinal direction of the tape such that writing of a last data entry of one column ends at a beginning of the two or more wraps.

Columnar data storage on tape partition

An input to read two or more data records stored to a tape medium on a tape drive is received. A starting point is determined. The starting point is a closest data record, of the two or more data records, to a current position of a tape head of the tape drive. A read order of the two or more data records is determined. The read order is determined using an algorithm and the determined starting point. The determined read order is sent to a host device. A first data record is determined. A first locate operation within the tape drive is performed. The first data record, of the two or more data records stored on the tape medium, based on the determined read order is read. The first data record, of the two or more data records stored on the tape medium, is sent to the host device.

Growing community of inventors

Tokyo, Japan

Takahiro Tsuda