# US 2012/0250176 A1 · Method and system for determining access sequence of data stored on a tape medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0250176 A1
- Document ID: US20120250176A1
- Status: Published application
- Kind: A1
- Application number: 13/523,654
- Filed: 2012-06-14
- Published: 2012-10-04
- Earliest claimed: 2010-12-16
- Assignees: International Business Machines Corporation
- Inventors: Takashi KATAGIRI; Setsuko MASUDA; Yuhko MORI; Hirokazu NAKAYAMA; Yutaka OISHI
- Web page: https://patentgrep.com/patent/US20120250176A1

## CPC

- G06F 3/0641: {De-duplication techniques}
- G06F 3/0611: {in relation to response time}
- G06F 3/064: {Management of blocks}
- G06F 3/0682: {Tape device}
- G11B 5/5508: {Control circuits therefor (G11B5/5513 takes precedence)}
- G11B 5/5513: {Specially adapted for transducing in both travelling directions of tape}
- G11B 27/107: {of operating tapes}
- G06F 3/0686: {Libraries, e.g. tape libraries, jukebox}
- G11B 2020/10916: {Seeking data on the record carrier for preparing an access to a specific address}
- G11B 2220/90: Tape-like record carriers
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G11B: INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER (recording measured values in a way that does not require playback through a transducer G01D9/00; recording or playback apparatus using mechanically marked tape, e.g. punched paper tape, or using unit records, e.g. punched or magnetically marked cards G06K; transferring data from one type of record carrier to another G06K1/18; circuits for coupling output of reproducer to radio receiver H04B1/20; gramophone pick-ups or like acoustic electromechanical transducers or circuits therefor H04R)

## Abstract

For determining an access sequence of a plurality of data groups stored on a tape medium, a first data group in the access sequence is selected based on which data group in the plurality of data groups has a beginning closest to a current position of the tape medium. A second data group in the access sequence is selected based on which remaining data group in the plurality of data groups has a beginning closest to an end of the first data group in the access sequence.

## Claims

### Claim 1

A method for determining an access sequence of a plurality of data groups stored on a tape medium, the method comprising:
selecting a first data group in the access sequence based on which data group in the plurality of data groups has a beginning closest to a current position of the tape medium; and
selecting a second data group in the access sequence based on which remaining data group in the plurality of data groups has a beginning closest to an end of the first data group in the access sequence.

### Claim 2 (depends on 1)

The method of claim 1, further comprising selecting an nth data group in the access sequence based on which remaining data group in the plurality of data groups has a beginning closet to an end of an (n-1)th data group in the access sequence.

### Claim 3 (depends on 2)

The method of claim 2, wherein the n-th data group is a last data group in the access sequence if there are no remaining data groups in the plurality of data groups.

### Claim 4 (depends on 3)

The method of claim 3, further comprising calculating a plurality of total seek times for the access sequence, each of the plurality of total seek times corresponding to a different position of the last data group in the access sequence.

### Claim 5 (depends on 4)

The method of claim 4, further comprising modifying the access sequence to generate a modified access sequence based on which position of the last data group in the access sequence corresponds to a shortest total seek time.

### Claim 6 (depends on 5)

The method of claim 5, further comprising repeating the modifying of the access sequence until the modified access sequence is the same as the previous modified access sequence.

### Claim 7 (depends on 6)

The method of claim 6, wherein the calculating of the plurality of total seek times for the access sequence is based on the time required to move between the plurality of data groups.
