# US 2018/0025015 A1 · Estimating mount time completion in file systems

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

- Number: US 2018/0025015 A1
- Document ID: US20180025015A1
- Status: Published application
- Kind: A1
- Application number: 15/217,156
- Filed: 2016-07-22
- Published: 2018-01-25
- Earliest claimed: 2016-07-22
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Atsushi Abe; Tohru Hasegawa; Masayuki Iwanaga; Yutaka Oishi
- Web page: https://patentgrep.com/patent/US20180025015A1

## CPC

- G06F 3/0682: {Tape device}
- G06F 3/0617: {in relation to availability}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/0632: {by initialisation or re-initialisation of storage systems}
- G06F 3/0686: {Libraries, e.g. tape libraries, jukebox}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Embodiments of the present invention provide methods, systems, and computer program products for estimating mount time completion in file systems. In an embodiment, at a time of unmounting storage media, an index file is provided, which records information stored in the storage media. Information associated with a number of tags of the index file, the types of contents of the tags, and a size of the contents of an element are stored, in response to an unmounting operation of the storage media. A predicted time associated with loading the index file into the memory during a mounting operation of the storage media is calculated, based on the stored information.

## Claims

### Claim 1

A method comprising:
at a time of unmounting a storage media, providing an index file, wherein the index file records information stored in the storage media;
storing, by one or more computer processors, information associated with a number of tags of the index file, a type of contents of the tags, and a size of contents of an element, in response to unmounting the storage media; and
calculating, by the one or more computer processors, based on the stored information, a predicted time associated with loading the index file into a memory during a mounting operation of the storage media.

### Claim 2 (depends on 1)

The method of claim 1, wherein storing the information, comprises:
obtaining a function F(t) corresponding to a t-th tag of the index file in accordance with a set of procedures:
F(t)=W(t) when t=1; and
F(t)=F(t−1)+W(t) when t>1,
where function W(t) is defined based on a length of time required for each tag when parsing the index file and loading the index file into the memory during the mounting operation; and
calculating the information based on the function F(t).

### Claim 3 (depends on 2)

The method of claim 2, wherein a value of the function W(t) is calculated based on an average value of measured lengths of time required for processing of each tag.

### Claim 4 (depends on 2)

The method of claim 2, wherein storing the information, further comprises:
approximating the function F(x) using a polynomial expression G(x):
G(X)=anxn+an-1xn-1+ . . . +a1x+a0; and
storing an inode summary in the storage media at the time of unmounting the storage media, wherein the inode summary comprises: a maximum degree (n), a coefficient (aX, . . . , a0), and the total number of tags (S), of the polynomial expression G(x).

### Claim 5 (depends on 1)

The method of claim 1, wherein the stored information is stored in: an index partition of the storage media or a vendor-specific area of a Cartridge Memory (CM) of a tape cartridge.

### Claim 6 (depends on 4)

The method of claim 4, wherein calculating the predicted time comprises:
calculating, by the one or more processors, a period of time G(S), from a start of the mounting operation until a completion of the loading of the total number of tags (S) into the memory.

### Claim 7 (depends on 6)

The method of claim 6, wherein calculating the predicted time comprises:
obtaining an estimated time E(Tk), wherein the estimated time E(Tk) is a time required for loading of the tags into the memory, up to tag Tk, in accordance with the following procedure:
E(Tk)=(G(S)/G(Tk))×R(Tk),
where R(Tk) is an actual time that elapsed to load the tags, up to the tag Tk, into the memory.

### Claim 8

A computer program product comprising:
one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising:
program instructions to, at a time of unmounting a storage media, provide an index file, wherein the index file records information stored in the storage media;
program instructions to store information associated with a number of tags of the index file, a type of contents of the tags, and a size of contents of an element, in response to unmounting the storage media; and
program instructions to calculate, based on the stored information, a predicted time associated with loading the index file into a memory during a mounting operation of the storage media.

### Claim 9 (depends on 8)

The computer program product of claim 8, wherein the program instructions to store the information comprise:
program instructions to obtain a function F(t) corresponding to a t-th tag of the index file in accordance with a set of procedures:
F(t)=W(t) when t=1; and
F(t)=F(t−1)+W(t) when t>1,
where function W(t) is defined based on a length of time required for each tag when parsing the index file and loading the index file into the memory during the mounting operation; and
program instructions to calculate the information based on the function F(t).

### Claim 10 (depends on 9)

The computer program product of claim 9, wherein a value of the function W(t) is calculated based on an average value of measured lengths of time required for processing of each tag.

### Claim 11 (depends on 9)

The computer program product of claim 9, wherein the program instructions to store the information, further comprise:
program instructions to approximate the function F(x) using a polynomial expression G(x):
G(X)=anxn+an-1xn-1+ . . . +a1x+a0; and
program instructions to store an inode summary in the storage media at the time of unmounting the storage media, wherein the inode summary comprises: a maximum degree (n), a coefficient (aX, . . . , a0), and the total number of tags (S), of the polynomial expression G(x).

### Claim 12 (depends on 8)

The computer program product of claim 8, wherein the stored information is stored in: an index partition of the storage media or a vendor-specific area of a Cartridge Memory (CM) of a tape cartridge.

### Claim 13 (depends on 11)

The computer program product of claim 11, wherein the program instructions to calculate the predicted time comprise:
program instructions to calculate a period of time G(S), from a start of the mounting operation until a completion of the loading of the total number of tags (S) into the memory.

### Claim 14 (depends on 13)

The computer program product of claim 13, wherein the program instructions to calculate the predicted time comprise:
program instructions to obtain an estimated time E(Tk), wherein the estimated time E(Tk) is a time required for loading of the tags into the memory, up to tag Tk, in accordance with the following procedure:
E(Tk)=(G(S)/G(Tk))×R(Tk),
where R(Tk) is an actual time that elapsed to load the tags, up to the tag Tk, into the memory.

### Claim 15

A computer system comprising:
one or more computer processors;
one or more computer readable storage media;
program instructions stored on the computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising:
program instructions to, at a time of unmounting a storage media, provide an index file, wherein the index file records information stored in the storage media;
program instructions to store information associated with a number of tags of the index file, a type of contents of the tags, and a size of contents of an element, in response to unmounting the storage media; and
program instructions to calculate, based on the stored information, a predicted time associated with loading the index file into a memory during a mounting operation of the storage media.

### Claim 16 (depends on 15)

The computer system of claim 15, wherein the program instructions to store the information comprise:
program instructions to obtain a function F(t) corresponding to a t-th tag of the index file in accordance with a set of procedures:
F(t)=W(t) when t=1; and
F(t)=F(t−1)+W(t) when t>1,
where function W(t) is defined based on a length of time required for each tag when parsing the index file and loading the index file into the memory during the mounting operation; and
program instructions to calculate the information based on the function F(t).

### Claim 17 (depends on 16)

The computer system of claim 16, wherein a value of the function W(t) is calculated based on an average value of measured lengths of time required for processing of each tag.

### Claim 18 (depends on 16)

The computer system of claim 16, wherein the program instructions to store the information, further comprise:
program instructions to approximate the function F(x) using a polynomial expression G(x):
G(X)=anxn+an-1xn-1+ . . . +a1x+a0; and
program instructions to store an inode summary in the storage media at the time of unmounting the storage media, wherein the inode summary comprises: a maximum degree (n), a coefficient (aX, . . . , a0), and the total number of tags (S), of the polynomial expression G(x).

### Claim 19 (depends on 18)

The computer system of claim 18, wherein the program instructions to calculate the predicted time comprise:
program instructions to calculate a period of time G(S), from a start of the mounting operation until a completion of the loading of the total number of tags (S) into the memory.

### Claim 20 (depends on 18)

The computer system of claim 18, wherein the program instructions to calculate the predicted time comprise:
program instructions to obtain an estimated time E(Tk), wherein the estimated time E(Tk) is a time required for loading of the tags into the memory, up to tag Tk, in accordance with the following procedure:
E(Tk)=(G(S)/G(Tk))×R(Tk),
where R(Tk) is an actual time that elapsed to load the tags, up to the tag Tk, into the memory.