Abstract: A method to copy computer files, where that method includes receiving a computer file, mapping that file to its constituent blocks, generating meta-data describing those constituent blocks, saving that meta-data in a memory device, and copying the file to one or more information storage media, where the mapping step, the generating step, and the saving step, are performed substantially synchronously, and where the copying step is performed at a later time. A data storage and retrieval system comprising a computer useable medium having computer readable program code disposed therein to copy computer files on one or more information storage media disposed therein. A computer program product usable with a programmable computer processor having computer readable program code embodied therein for copying computer files.

Abstract: A method to copy computer files, where that method includes receiving a computer file, mapping that file to its constituent blocks, generating meta-data describing those constituent blocks, saving that meta-data in a memory device, and copying the file to one or more information storage media, where the mapping step, the generating step, and the saving step, are performed substantially synchronously, and where the copying step is performed at a later time. A data storage and retrieval system comprising a computer useable medium having computer readable program code disposed therein to copy computer files on one or more information storage media disposed therein. A computer program product usable with a programmable computer processor having computer readable program code embodied therein for copying computer files.

Abstract: A method and system for integrating migration level two (ML2) and backup tape processing provide for the backup, archival, and/or restoration of ML2 tape files without the use of tape mounts. In this manner, the amount of data movement required to recover from data loss is significantly reduced. Tape files may be recovered to their original status, even if the file has migrated to ML2. The status of the data is preserved after such a recovery operation. In this manner, data movement is reduced because no remigration of data is required after a recovery.

Abstract: A data storage hierarchy which inherently allows for a level 1 storage file to be uniquely identified across an entire network is disclosed. A directory naming convention is employed which includes an internal identifier and a name for each subdivision of the network. Because each file can be uniquely identified across the network, a single level 1 storage space in a file space, or a directory therein, can be used for the entire network. Also, because of the inherent uniqueness of the naming system, common DASD control files otherwise required to map between level 1 storage files and their level 0 source files can be eliminated.

Abstract: A method for dispatching work requests in a data storage hierarchy in which directory data is promoted in variable length spans, the use of which are maximized even for work requests entering the work request queue after the span is chosen, is disclosed. A queue of work requests is initially scanned to determine if any requests therein require access to directory data stored in secondary storage within a prescribed proximity of that required by the next request to be dispatched. If such other work requests exist, then directory data in addition to that required by the next request to be dispatched is also promoted. To minimize seek time and rotational latency, the additional data is promoted from secondary storage in a single device I/O cycle. The additional data is chosen by adjusting the outer limits of the span as each work request in queue is scanned. After the actual promotion of the span of data, the existing work request is completed.