A storage control apparatus includes a processor. The processor is configured to store, during a normal operation mode, first data as a first logical volume in a storage section of a first virtual storage device. The first data is transmitted and received between a first host device and a physical storage device. The physical storage device stores data in a physical volume. The first virtual storage device is connected to the physical storage device during the normal operation mode. The processor is configured to serve, during a data migration mode, as a pseudo host device connected to a second virtual storage device. The pseudo host device accesses the second virtual storage device to read out second data of a second logical volume stored in the second virtual storage device. The first virtual storage device is connected to the second virtual storage device during the data migration mode.

A method for pairing a first device with a second device is disclosed. A salient idea is to generate a discriminant and visually differentiable visual representation from a unique identifier of a device, to make it available for example together with the unique identifier on a printed package of the device, and to regenerate it for display as part of the pairing process. A user checking the displayed visual representation matches the printed visual representation of the package can successfully terminate a pairing process.

A computer-implemented method for altering a position on a tape at which the tape transitions to a DATA_FULL state is disclosed. The computer-implemented method further includes determining, after a file is written to a Data Partition of the tape, a size of an Index representing metadata associated with the file. The computer-implemented method further includes altering, based on the size of the Index representing metadata associated with the file, a position in the Data Partition of the tape at which the tape transitions to the DATA_FULL state.

A computing system may generate a directed graph to access data stored in multiple locations or blocks of a data storage device or system. Cost values may be determined for each of multiple paths between nodes, representing the blocks or subsets of data. In some cases, nodes having a cost value between them that is less than a threshold may be combined into a single node. A master path, linking at least two of the multiple paths, between a start node and an end node, may be generated by iteratively selecting paths with a lowest cost. The number of paths considered for determining the lowest path cost may be limited by a complexity parameter, so as to optimize the path to access the data without introducing unbeneficial computational complexity.

Methods, computer systems, and computer program products for processing data a computing environment are provided. The computer environment for data deduplication storage receives a plurality of write operations for deduplication storage of the data. The data is buffered in a plurality of buffers with overflow temporarily stored to a memory hierarchy when the data received for deduplication storage is sequential or non sequential. The data is accumulated and updated in the plurality of buffers per a data structure, the data structure serving as a fragment map between the plurality of buffers and a plurality of user file locations. The data is restructured in the plurality of buffers to form a complete sequence of a required sequence size. The data is provided as at least one stream to a stream-based deduplication algorithm for processing and storage.

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.

The present invention provides a method of partitioning a tape medium dynamically by using a new method of writing data. It enables users to change size of the partitions later and to use all capacity of a tape efficiently. When a tape is divided into partitions, data is written in such a manner that the wraps are written in the partitions of the data band alternately in the forward direction and in the backward direction on the data band from the different sides of the data band toward the inside of the data band (W1,W2,W3 . . . ) and the location (C) at which the wrap (Wm) of the one partition collides with the wrap (Wn) of the other partition is defined as the demarcation (PB) of these partitions (P0,P1).

An information processing device includes a processor. The processor is configured to transmit to a tape drive a write request in one of a first mode and a second mode for accompanying data. The write request in the first mode requests to store the accompanying data in a buffer memory included in the tape drive without writing the accompanying data to a magnetic tape. The write request in the second mode requests to write data stored in the buffer memory and the accompanying data to the magnetic tape. The processor is configured to transmit a write request for one of multiple pieces of data in the first mode if a remaining amount of the buffer memory is larger than a predetermined threshold value, and in the second mode if the remaining amount is equal to or smaller than the predetermined threshold value.

In one embodiment, an apparatus includes a processor and logic integrated with and/or executable by the processor. The logic is configured to position a magnetic tape volume to a position corresponding to an end of a last data set stored to the magnetic tape volume, and read an existing tape volume access block (TVAB) from the magnetic tape volume in response to a determination that the existing TVAB is stored to the magnetic tape volume. The logic is also configured to write one or more data sets to the magnetic tape volume subsequent to reading the existing TVAB in response to the determination that the existing TVAB is stored to the magnetic tape volume, determine metadata corresponding to the one or more written data sets, and update the existing TVAB with the metadata corresponding to the one or more written data sets to produce an updated TVAB.

A method, computer program product, and system for dividing a file and writing the file to a plurality of tapes in a tape library system comprising a plurality of tape apparatuses. A request to write a file to a plurality of tapes is received. The file comprises data. A number of available tapes is predicted with respect to a number of drives available at a time when the file requested to be written is written to the plurality of tapes. The data of the file is divided into a predetermined number of segments to reduce a time period for reading the file. The predetermined number of segments is based on the predicted number of tape drives. The data segments are written to the available tape drives.