# US 2016/0254026 A1 · Reducing total seek time for determining an 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 2016/0254026 A1
- Document ID: US20160254026A1
- Status: Published application
- Kind: A1
- Application number: 15/148,437
- Filed: 2016-05-06
- Published: 2016-09-01
- Earliest claimed: 2012-08-09
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Takashi KATAGIRI; Yuhko MORI; Masakatsu MURATA; Hirokazu NAKAYAMA; Yutaka OISHI
- Web page: https://patentgrep.com/patent/US20160254026A1

## CPC

- G11B 27/107: {of operating tapes}
- G11B 5/5513: {Specially adapted for transducing in both travelling directions of tape}
- G11B 20/10: Digital recording or reproducing
- G11B 2020/10916: {Seeking data on the record carrier for preparing an access to a specific address}
- 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

A first data group in an access sequence is selected. A distance from a current position of the tape medium is set to be a logical distance value, determined by a calculation function, that is substituted for the physical distance value for the data groups that are located in the specified regions as compared with other data groups located in the alternative specified regions. A second data group in the access sequence is selected. The logical distance value is then determined by multiplying a coefficient based on a physical positioning of each of the data groups in the tape medium, and a percentage of those of the plurality of data groups that have already been selected as the first data group and the second data group.

## Claims

### Claim 1

A method using a processor device for reducing total seek time for determining an access sequence of a plurality of data groups stored on a tape medium, the method, using the processor device, comprising:
selecting, using the processor device, a first data group in the access sequence wherein:
a distance from a current position of the tape medium is set to be a logical distance value, determined by a calculation function, that is substituted for an actual physical distance value for specified regions different from alternative specified regions;
selecting, using the processor device, a second data group in the access sequence; and
multiplying, for determining the logical distance value, a coefficient based on a physical positioning of each of the plurality of data groups in the tape medium and a percentage of those of the plurality of data groups that have already been selected as the first data group and the second data group.

### Claim 2 (depends on 1)

The method of claim 1, further performing one of:
selecting the first data group based on the data group in the plurality of data groups having a beginning closest in distance, according to the logical distance value, to a current position; 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 3 (depends on 1)

The method of claim 1, further including performing one of:
determining the logical distance value to be 1 if both the beginning and an end of a movement-destination one of the plurality of data groups are not less than (L/K) and not greater than (L*(K−1)/K),
determining the logical distance value to be [1−(L/K−E)/(L/K)*a( )] if the beginning of the movement-destination one of the plurality of data groups is not less than (L/K) and not greater than (L*(K−1)/K) and the end of the movement-destination one of the plurality of data groups is less than (L/K),
determining the logical distance value to be [1−(L/K−E)/(L/K)*a( )] where a value of E is assumed to be a value of (L−E) if the end of the movement-destination one of the plurality of data groups is greater than [L*(K−1)/K],
determining the logical distance value to be [1−(L/K−S)/(L/K)*a( )] if the end of the movement-destination one of the plurality of data groups is not less than (L/K) and not greater than (L*(K−1)/K) and the beginning of the movement-destination one of the plurality of data groups is less than (L/K),
determining the logical distance value to be [1−(L/K−S)/(L/K)*a( )] where a value of S is assumed to be the value of (L−S) if the beginning of the movement-destination one of the plurality of data groups is greater than [L*(K−1)/K],
determining the logical distance value to be 1−(L/K−S)/(L/K)*a( )−(L/K−E)/(L/K)*a( )] if both the beginning and the end of the movement-destination one of the plurality of data groups are less than (L/K), and
determining the logical distance value to be 1−(L/K−S)/(L/K)*a( )−(L/K−E)/(L/K)*a( )] if either one of or both the beginning and the tail of the movement-destination one of the plurality of data groups is greater than [L*(K−1)/K], where a value of S is assumed to be the value of (L−S),
where L is an entire length of the tape media, S is a position of the beginning of the movement-destination one of the plurality of data groups in the length direction of the tape medium, E is a position of the end of the movement-destination one of the plurality of data groups in the length direction of the tape medium, K is a constant that is used for determining a resolution in the length direction of the tape medium when finding the coefficient, and a( ) is a function for determining an auxiliary coefficient for determining the logical distance value that is to be determined.

### Claim 4 (depends on 1)

The method of claim 1, wherein the logical distance value changes by one of a linear, stepwise, and curved pattern according to the calculation function.

### Claim 5 (depends on 1)

The method of claim 1, further including separating the specified regions that are viewed from a length direction, at two respective ends, and the alternative specified regions of the tape medium by dividing an entire region, which includes the specified regions and the alternative specified regions, into three regions in the length direction of the tape medium.

### Claim 6 (depends on 1)

The method of claim 1, further including selecting an nth 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 an (n−1)th data group in the access sequence.

### Claim 7 (depends on 6)

The method of claim 6, wherein the nth 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 8

A system for reducing total seek time for determining an access sequence of a plurality of data groups stored on a tape medium, the system comprising:
a processor device, controlling the tape medium and the plurality of data groups, wherein the processor device:
selects a first data group in the access sequence wherein:
a distance from a current position of the tape medium is set to be a logical distance value, determined by a calculation function, that is substituted for an actual physical distance value for specified regions different from alternative specified regions;
selects a second data group in the access sequence; and
multiplies, for determining the logical distance value, a coefficient based on a physical positioning of each of the plurality of data groups in the tape medium and a percentage of those of the plurality of data groups that have already been selected as the first data group and the second data group.

### Claim 9 (depends on 8)

The system of claim 8, wherein the processor device performs one of:
selecting the first data group based on the data group in the plurality of data groups having a beginning closest in distance, according to the logical distance value, to a current position 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 10 (depends on 8)

The system of claim 8, wherein the processor device performs one of:
determining the logical distance value to be 1 if both the beginning and the end of the movement-destination one of the plurality of data groups are not less than (L/K) and not greater than (L*(K−1)/K),
determining the logical distance value to be [1−(L/K−E)/(L/K)*a( )] if the beginning of the movement-destination one of the plurality of data groups is not less than (L/K) and not greater than (L*(K−1)/K) and the end of the movement-destination one of the plurality of data groups is less than (L/K),
determining the logical distance value to be [1−(L/K−E)/(L/K)*a( )] where a value of E is assumed to be a value of (L−E) if the end of the movement-destination one of the plurality of data groups is greater than [L*(K−1)/K],
determining the logical distance value to be [1−(L/K−S)/(L/K)*a( )] if the end of the movement-destination one of the plurality of data groups is not less than (L/K) and not greater than (L*(K−1)/K) and the beginning of the movement-destination one of the plurality of data groups is less than (L/K),
determining the logical distance value to be [1−(L/K−S)/(L/K)*a( )] where a value of S is assumed to be the value of (L−S) if the beginning of the movement-destination one of the plurality of data groups is greater than [L*(K−1)/K],
determining the logical distance value to be 1−(L/K−S)/(L/K)*a( )−(L/K−E)/(L/K)*a( )] if both the beginning and the end of the movement-destination one of the plurality of data groups are less than (L/K), and
determining the logical distance value to be 1−(L/K−S)/(L/K)*a( )−(L/K−E)/(L/K)*a( )] if either one of or both the beginning and the end of the movement-destination one of the plurality of data groups is greater than [L*(K−1)/K], where a value of S is assumed to be the value of (L−S),
where L is an entire length of the tape media, S is a position of the beginning of the movement-destination one of the plurality of data groups in the length direction of the tape medium, E is a position of the end of the movement-destination one of the plurality of data groups in the length direction of the tape medium, K is a constant that is used for determining a resolution in the length direction of the tape medium when finding the coefficient, and a( ) is a function for determining an auxiliary coefficient for determining the logical distance value that is to be determined.

### Claim 11 (depends on 8)

The system of claim 8, wherein the processor device changes the logical distance value by one of a linear, stepwise, and curved pattern according to the calculation function.

### Claim 12 (depends on 8)

The system of claim 8, wherein the processor device separates the specified regions that are viewed from a length direction, at two respective ends, and the alternative specified regions of the tape medium by dividing an entire region, which includes the specified regions and the alternative specified regions, into three regions in the length direction of the tape medium.

### Claim 13 (depends on 8)

The system of claim 8, wherein the processor device selects an nth 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 an (n−1)th data group in the access sequence.

### Claim 14 (depends on 13)

The system of claim 13, wherein the nth 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 15

A computer program product for reducing total seek time for determining an access sequence of a plurality of data groups stored on a tape medium in a computing environment by a processor device, the computer program product comprising a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
a first executable portion that selects a first data group in the access sequence wherein:
a distance from a current position of the tape medium is set to be a logical distance value, determined by a calculation function, that is substituted for an actual physical distance value for specified regions different from alternative specified regions;
a second executable portion that selects a second data group in the access; and
a third executable portion that multiplies, for determining the logical distance value, a coefficient based on a physical positioning of each of the plurality of data groups in the tape medium and a percentage of those of the plurality of data groups that have already been selected as the first data group and the second data group.

### Claim 16 (depends on 15)

The computer program product of claim 15, further including a fourth executable portion that performs one of:
selecting the first data group based on the data group in the plurality of data groups having a beginning closest in distance, according to the logical distance value, to a current position 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 17 (depends on 15)

The computer program product of claim 15, further including a fourth executable portion that performs one of:
determining the logical distance value to be 1 if both the beginning and the end of the movement-destination one of the plurality of data groups are not less than (L/K) and not greater than (L*(K−1)/K),
determining the logical distance value to be [1−(L/K−E)/(L/K)*a( )] if the beginning of the movement-destination one of the plurality of data groups is not less than (L/K) and not greater than (L*(K−1)/K) and the end of the movement-destination one of the plurality of data groups is less than (L/K),
determining the logical distance value to be [1−(L/K−E)/(L/K)*a( )] where a value of E is assumed to be a value of (L−E) if the end of the movement-destination one of the plurality of data groups is greater than [L*(K−1)/K],
determining the logical distance value to be [1−(L/K−S)/(L/K)*a( )] if the end of the movement-destination one of the plurality of data groups is not less than (L/K) and not greater than (L*(K−1)/K) and the beginning of the movement-destination one of the plurality of data groups is less than (L/K),
determining the logical distance value to be [1−(L/K−S)/(L/K)*a( )] where a value of S is assumed to be the value of (L−S) if the beginning of the movement-destination one of the plurality of data groups is greater than [L*(K−1)/K],
determining the logical distance value to be 1−(L/K−S)/(L/K)*a( )−(L/K−E)/(L/K)*a( )] if both the beginning and the end of the movement-destination one of the plurality of data groups are less than (L/K), and
determining the logical distance value to be 1−(L/K−S)/(L/K)*a( )−(L/K−E)/(L/K)*a( )] if either one of or both the beginning and the end of the movement-destination one of the plurality of data groups is greater than [L*(K−1)/K], where a value of S is assumed to be the value of (L−S),
where L is an entire length of the tape media, S is a position of the beginning of the movement-destination one of the plurality of data groups in the length direction of the tape medium, E is a position of the end of the movement-destination one of the plurality of data groups in the length direction of the tape medium, K is a constant that is used for determining a resolution in the length direction of the tape medium when finding the coefficient, and a( ) is a function for determining an auxiliary coefficient for determining the logical distance value that is to be determined.

### Claim 18 (depends on 15)

The computer program product of claim 15, wherein the logical distance value changes by one of a linear, stepwise, and curved pattern according to the calculation function.

### Claim 19 (depends on 15)

The computer program product of claim 15, further including a fourth executable portion that separates the specified regions that are viewed from a length direction, at two respective ends, and the alternative specified regions of the tape medium by dividing an entire region, which includes the specified regions and the alternative specified regions, into three regions in the length direction of the tape medium.

### Claim 20 (depends on 15)

The computer program product of claim 15, further including a fourth executable portion that selects an nth 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 an (n−1)th data group in the access sequence.

### Claim 21 (depends on 20)

The computer program product of claim 20, wherein the nth data group is a last data group in the access sequence if there are no remaining data groups in the plurality of data groups.
