Настройки

Укажите год
-

Небесная энциклопедия

Космические корабли и станции, автоматические КА и методы их проектирования, бортовые комплексы управления, системы и средства жизнеобеспечения, особенности технологии производства ракетно-космических систем

Подробнее
-

Мониторинг СМИ

Мониторинг СМИ и социальных сетей. Сканирование интернета, новостных сайтов, специализированных контентных площадок на базе мессенджеров. Гибкие настройки фильтров и первоначальных источников.

Подробнее

Форма поиска

Поддерживает ввод нескольких поисковых фраз (по одной на строку). При поиске обеспечивает поддержку морфологии русского и английского языка
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Укажите год
Укажите год
Применить Всего найдено 375. Отображено 104.
30-04-2015 дата публикации

NEURODEGENERATIVE DISEASE TESTING METHOD

Номер: WO2015060317A1
Автор: HASEGAWA Tohru
Принадлежит:

Provided is a neurodegenerative disease testing method which is not burdensome on the human or animal test subject, and which not only can determine whether said test subject suffers from neurodegenerative disease, but also whether there is a high risk thereof in the future. The homocysteic acid concentration in urine collected from the test subject, the homocysteic acid concentration in blood collected from the test subject and the homocysteine and/or methionine concentration in the same blood are measured. This testing method further is characterized by measuring the creatinine concentration in the urine and the creatinine concentration in the blood.

Подробнее
Номер записи: 1
17-04-2014 дата публикации

DETECTION OF OPERATIONAL STATE OF COMPONENT BY COMPUTER

Номер: WO2014057743A1
Автор: ARAKI Hiroshi, HASEGAWA Tohru
Принадлежит:

The present invention ensures that a computer detects the operational state of a component in a computer system which includes a plurality of components. The invention includes steps for: transmitting a command in a command-line interface (a CLI command) to a component (S11); receiving an output string for the CLI command from the component (S12); parsing the output character string into significant partial character strings including a label character string representing the meaning of the data and data character strings representing the data itself (S13); setting regular expressions corresponding to each of the significant partial character strings (S14); calculating the difference between each of the set regular expressions and a corresponding significant partial character string as a character string distance (S15); comparing the calculated character string distance with a corresponding predetermined threshold (S16); and outputting the operational state of the component according to ...

Подробнее
Номер записи: 2
05-06-2014 дата публикации

METHOD FOR DISPLAYING MODULE OPERATING STATE WITHIN COMPUTER SYSTEM

Номер: WO2014083905A1
Автор: HASEGAWA Tohru, ARAKI Hiroshi
Принадлежит:

Provided is a method for displaying operating states of a plurality of first modules formed from dedicated software and of a plurality of second modules formed from general-purpose software or hardware in a system including a computer and a storage device. The method comprises: a step of preparing a table which shows the operating states of the first and second modules; a first acquisition step (S33) of acquiring, from a module which is selected from among the first modules, the operating state of the module itself; a second acquisition step (S35) of acquiring, from the other first modules and/or the second modules which operate along with the operation of the selected module, the operating states of the modules; steps (S34, S37) of using the operating states of the modules acquired in the first acquisition step and/or the second acquisition step to update the operating state of the corresponding modules in the table, and a step of displaying the operating states of the first and second ...

Подробнее
Номер записи: 3
18-04-2013 дата публикации

TAPE DRIVE DATA ALTERATION DETECTION METHOD AND FILE SYSTEM

Номер: WO2013054597A1
Автор: OISHI Yutaka, HASEGAWA Tohru, IMAI Naoki, KAMIYA Masanori, HIRATA Takamasa
Принадлежит:

The invention provides a method that detects whether data on a tape drive used in a file system has been altered. The method contains: (a) a step that prepares a first tape cartridge provided with a tape in which multiple files and an index information history have been stored in a WORM partition, and index information has been stored in an R/W partition; (b) a step that reads and compares the R/W partition index information and the index information at the end of the WORM partition; and (c) a step that determines that the R/W partition index information has been altered if the R/W partition index information does not match the index information at the end of the WORM partition.

Подробнее
Номер записи: 4
01-06-2017 дата публикации

CONTROL ACCESS TO FUNCTION OF INFORMATION DEVICE

Номер: US20170154172A1
Автор: Tohru HASEGAWA, Yutaka OISHI, Masao TAKAYAMA, HASEGAWA TOHRU, OISHI YUTAKA, TAKAYAMA MASAO, HASEGAWA Tohru, OISHI Yutaka, TAKAYAMA Masao
Принадлежит:

A control system for controlling access to a protected function of an information device is disclosed. The control system includes a communication device configured to communicate with the information device entering an area. The control system also includes a database configured to store a relationship between the information device and a registered user. The control system further includes a control computer communicably coupled to the communication device. The control computer is configured to identify a user entering the area with the information device. The control computer is also configured to determine whether or not to permit access to the protected function based on the identified user and the registered user for the information device. The control computer is further configured to control the information device via the communication device so as to unlock or lock the protected function based on a result of determination whether or not to permit access. 1. A control system for controlling access to a protected function of an information device , comprising:a communication device configured to communicate with the information device entering an area;a database configured to store a relationship between the information device and a registered user; identify a user entering the area with the information device;', 'determine whether or not to permit access to the protected function based on the identified user and the registered user for the information device; and', 'control the information device via the communication device so as to unlock or lock the protected function based on a result of determination whether or not to permit access., 'a control computer communicably connected to the communication device, the control computer being configured to2. The control system of claim 1 , wherein the control computer is further configured to:generate a new identifier used to identify the information device;send the new identifier to the information device via the ...

Подробнее
Номер записи: 5
09-02-2012 дата публикации

ABNORMALITY DETECTION DEVICE FOR DETECTION CIRCUIT AND ELECTRIC CIRCUIT, AND DETECTION SYSTEM AND ELECTRONIC SYSTEM WHICH USES ABNORMALITY DETECTION DEVICE

Номер: US20120035824A1
Автор: Abu Whishah Mustafa, Akita Takeo, HASEGAWA Tohru, Hitomi Isamu, Kurita Yasuaki, Okada Takuya, Stegmaier Juergen, Sy Williamson, Tajiri Daichi, Takasaki Minoru, Yurue Kenji
Принадлежит: BOSCH CORPORATION

In an electric circuit whose behavior is changed corresponding to a peripheral environment, an abnormality detection device can surely detect abnormality in the electric circuit even in a state where a value of the peripheral environment cannot be specified. An abnormality detection device according to the present invention detects abnormality in a detection circuit () which detects a specific kind of physical quantity. The abnormality detection device includes an abnormality detection part () which changes magnitude of a power source voltage (Vcc′) which is supplied to the detection circuit (), and detects abnormality in the detection circuit based on an output signal (Vo) from the detection circuit at a power source voltage (Vc) after the change. 1. An electric system comprising:{'b': '112', 'a first electric circuit (),'}{'b': 3', '103', '112, 'a ground line (L, ) which is connected to a ground terminal of the first electric circuit (), and'}{'b': 3', '103', '2, 'i': a', 'a, 'a monitoring conductive line (L, ) which is electrically connected to the ground line and detects a potential (V′) at a connection point with the ground line, wherein'}{'b': 112', '2, 'the electric system corrects a behavior (Vout) of the first electric circuit () based on a detection voltage (V) through the monitoring conductive line.'}2310356aa. The electric system according to claim 1 , wherein the monitoring conductive line (L claim 1 , ) is connected to a power source voltage (Vcc) through a first resistance (R) claim 1 , and is also connected to a ground potential (GND) through a second resistance (R) claim 1 , and{'b': '2', 'abnormality in the monitoring conductive line per se is detected by detecting a voltage of the second resistance as the detection voltage (V).'}321122. The electric system according to claim 2 , wherein when the detection voltage (V) through the monitoring conductive line is smaller than a first threshold value (Vth) claim 2 , the correction of the behavior (Vout) ...

Подробнее
Номер записи: 6
22-03-2012 дата публикации

GUI-BASE APPLICATION SYSTEM AND METHOD FOR DISPLAYING WARNINGS OF THE SAME

Номер: US20120072862A1
Автор: HASEGAWA Tohru, Hasegawa Yuhko
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A display apparatus includes means for recording numbers and display times of a series of plurality of setting screens displayed in transition, means for assigning the degrees of forgetting of the current screen which is shifted from other setting screens that are displayed in the process of transition from the previous setting screen to the current screen, means for evaluating the total degree of forgetting of the current screen in consideration of all degrees of forgetting in transition from the other setting screens displayed in the process of transition, means for determining forgetting threshold values for the individual screens on the basis of the degree of importance of the application, means for comparing total degree of forgetting with the forgetting threshold values, and means for highlighting a predetermined content of the current screen in the case where the total degree of forgetting is lower than the forgetting threshold values. 1123. A method for displaying , for a same setting screen , content of a current setting screen shifted from a previous setting screen in a GUI-base message display apparatus that executes an application by shifting display of a series of setting screens ( , , , . . . , i , . . . , j , . . . , and i) , the method comprising the steps of:recording numbers and display times of a series of a plurality of setting screens displayed in a process of transition;assigning degrees of forgetting V(i, j) of a current setting screen i which is shifted from other setting screens j that are displayed in the process of transition from a previous setting screen i to the current setting screen i;evaluating a total degree of forgetting L(i) of the current setting screen i in consideration of all the degrees of forgetting V(i, j) in transition from the other setting screens j displayed in the process of transition;determining forgetting threshold values N(i) to individual setting screens on a basis of degree of importance of the application; ...

Подробнее
Номер записи: 7
15-11-2012 дата публикации

CONTROLLING STORING OF DATA

Номер: US20120290801A1
Автор: HASEGAWA Tohru, IMAI Naoki, KAMIYA Masanori, OISHI Yutaka
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

First characteristic information indicating a characteristic of input data is extracted from the input data that is input as data to be stored in any of the storages. Second characteristic information elements are read from a memory unit storing the second characteristic information elements indicating respective characteristics of stored data elements stored in the storages. A specific storage in which the input data is to be stored is determined, out of the storages, by determining a degree of match between the extracted first characteristic information and the second characteristic information elements read. The input data to the determined specific storage is read. The second characteristic information element indicating the characteristic of the stored data element stored in the specific storage is updated, out of the second characteristic information elements retained in the memory unit, on the basis of the extracted first characteristic information.

Подробнее
Номер записи: 8
09-05-2013 дата публикации

Generating Information with Plurality of Files Enumerated Therein

Номер: US20130117239A1
Автор: HASEGAWA Tohru, Hirata Takamasa, IMAI Naoki, KAMIYA Masanori, OISHI Yutaka
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A mechanism is provided for generating enumerated information in which a plurality of files is enumerated except entirely-invalidated files on a sequential medium. Management information for managing locations where the plurality of files on the sequential medium are recorded is acquired from the sequential medium. The enumerated information in which the plurality of files are enumerated is generated in an order according to the locations where the plurality of files are recorded on the basis of the acquired management information. 17-. (canceled)8. A method , in a data processing system , for generating enumerated information in which a plurality of files are enumerated except entirely-invalidated files on a sequential medium , the method comprising:acquiring management information for managing locations where the plurality of files on the sequential medium are recorded from the sequential medium; andgenerating the enumerated information in which the plurality of files are enumerated in an order according to the locations where the plurality of files are recorded on the basis of the acquired management information.9. A computer program product for generating enumerated information in which a plurality of files are enumerated except entirely-invalidated files on a sequential medium comprising a computer readable medium having a computer readable program stored therein , wherein the computer readable program , when executed on a computing device , causes the computing device to:acquire management information for managing locations where the plurality of files on the sequential medium are recorded from the sequential medium; andgenerate the enumerated information in which the plurality of files are enumerated in an order according to the locations where the plurality of files are recorded on the basis of the management information acquired by the acquisition unit.108. The method of clam , wherein , upon update of a file recorded in a first location , at least a part ...

Подробнее
Номер записи: 9
10-04-2014 дата публикации

Detection of Component Operating State by Computer

Номер: US20140101432A1
Автор: ARAKI Hiroshi, HASEGAWA Tohru
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A mechanism is provided for detecting an operating state of a component. A CLI command is transmitted via a command line interface to the component. An output character string is received responsive to the CLI command. A set of significant character substrings is dissected from the output character string, where each significant character substring comprises a label character string indicating a meaning of the output character string and a data character string expressing data of the output character string. A regular expression corresponding to each significant character substring is set thereby forming a set of regular expressions. A difference is calculated between each of the set regular expressions and each significant character substring corresponding to the regular expression as a character string distance. Each calculated character string distance is compared to a corresponding predetermined threshold and the operating state of the component is output based on results of the comparison. 1. A method in a computer system for detecting an operating state of a component in the computer system comprising a plurality of components , the method comprising:transmitting a command line interface (CLI) command via a command line interface to the component;receiving an output character string from the component responsive to the CLI command;dissecting a of significant character substrings from the output character string, wherein each significant character substring comprises a label character string indicating a meaning of the output character string and a data character string expressing data of the output character string;setting a regular expression corresponding to each significant character substring of the set of significant character substrings thereby forming a set of regular expressions;calculating a difference between each of the set regular expressions and each significant character substring corresponding to the regular expression as a character string ...

Подробнее
Номер записи: 10
04-01-2018 дата публикации

METHOD OF MOVING FILES IN HIERARCHICAL STORAGE SYSTEM

Номер: US20180004450A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A method for moving files in a hierarchical storage system having a primary storage and a secondary storage including a sequential storage device from the primary storage to the secondary storage includes obtaining a predetermined file size to be written to the secondary storage, extracting, from a plurality of files in the primary storage, a file not stored in the secondary storage and having the oldest last access time, estimating a file size of the file having the oldest last access time on the secondary storage if the file having the oldest last access time is written to the secondary storage, and selecting the file having the oldest last access time as a file to be moved to the secondary storage as long as the estimated file size does not exceed the predetermined file size to be written to the secondary storage. 1. A computer system for moving files from a primary storage to a secondary storage in a hierarchical storage system , the computer system comprising: obtaining, from the secondary storage, a predetermined file size of an area of the secondary storage available to be sequentially written in one direction of the secondary storage, the secondary storage comprising a sequential access storage device;', 'receiving, from the secondary storage, an indication whether the one direction of the secondary storage comprises a trailing end direction of the secondary storage or a leading end direction of the secondary storage opposite to the trailing end direction at a time of accessing the secondary storage;', 'extracting, from a plurality of files in the primary storage, a file not stored in the secondary storage and having an oldest last access time;', 'estimating a physical size needed for writing the extracted file in the secondary storage;', 'in response to the estimated physical size not exceeding the predetermined file size of the area of the secondary storage available to be sequentially written, selecting the file having the oldest last access time as a ...

Подробнее
Номер записи: 11
14-01-2016 дата публикации

METHOD OF MANAGING, WRITING, AND READING FILE ON TAPE

Номер: US20160012073A1
Автор: Ashida Takashi, HASEGAWA Tohru, Itagaki Hiroshi, Mitsuma Machida, Watanabe Terue
Принадлежит:

Managing a file on a tape. In response to a request to write a first file to a tape, whether a second file including data identical to the first file already exists on the tape is detected. If the second file exists, a first index of the second file is updated. After completing the write of the first file, metadata, including data starting position and size of the first file, is added to the first index. In response to a request to read the first or second files, the metadata of the first and second indexes are read. Based on the metadata, which of the first or second files can be accessed faster from a current head position is determined. The first file or the second file that can be accessed faster is then read from the tape. 1. A method for managing a file on a tape in a file system , the method comprising:in response to a request to write a first file to a tape, detecting whether a second file including data identical to data of the first file already exists on the tape;if the second file exists on the tape, updating a first index of the second file; andin response to completing the write of the first file to the tape, adding metadata, including a data starting position and a size of the first file, to the first index.2. The method according to claim 1 , further comprising:writing the first file onto the tape; andcreating or updating a second index with metadata including a data starting position and a size of the first file on the tape.3. The method according to claim 2 , further comprising:writing the updated first index onto the tape; andwriting the created or updated second index onto the tape.4. The method according to claim 2 , further comprising:in response to a request to read the first file or the second file, reading the metadata of the first index and the second index;determining, based on the read metadata, which of the first file and the second file can be accessed faster from a current head position; andreading, from the tape, the first file or the ...

Подробнее
Номер записи: 12
18-01-2018 дата публикации

STORING DATA IN A STUB FILE IN A HIERARCHICAL STORAGE MANAGEMENT SYSTEM

Номер: US20180018089A1
Автор: ARAKI Hiroshi, FUJIHARA Shinobu, HASEGAWA Tohru, Ishimoto Takeshi, Itagaki Hiroshi, MIYOSHI Hiroyuki, OISHI Yutaka
Принадлежит:

According to an aspect of the present invention, there is a method, computer program product and/or system for storing data that performs the following operations (not necessarily in the following order): (i) receiving a request to migrate a data file from primary storage to secondary storage; (ii) invoking a primary data extraction function, registered by a user, to determine primary data for the data file; and (iii) inserting the primary data into a stub file. 1. A method for storing data , the method comprising:receiving a request to migrate a data file from primary storage to secondary storage;invoking a primary data extraction function, registered by a user, to determine primary data for the data file; andinserting the primary data into a stub file.2. The method of further comprising:migrating the data file to secondary storage to produce a migrated data file.3. The method of claim 1 , wherein the primary data extraction function is registered with a hierarchical storage management system.4. The method of claim 1 , wherein the primary data comprises a copy of a portion of the data file.5. The method of claim 4 , wherein the portion is of particular interest to a user application.6. The method of claim 1 , wherein the primary data comprises metadata for the data file.7. The method of claim 6 , wherein the metadata comprises generated statistical information based at least in part on data within the data file.8. The method of claim 7 , wherein the generated statistical information is selected from the group consisting of a maximum value claim 7 , a minimum value claim 7 , and a mean value of the data within the data file.9. A method for retrieving data claim 7 , the method comprising:receiving, from a requester, a request to access primary data for a data file;determining if the primary data is in a stub file corresponding to the data file;on condition that the primary data is in the stub file, retrieving the primary data from the stub file; andproviding the ...

Подробнее
Номер записи: 13
18-01-2018 дата публикации

REDUCING A SIZE OF BACKUP DATA IN STORAGE

Номер: US20180018110A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A method, a computer program product, and a computer system for backing up data in a backup storage space. A computer receives a request for backing up a second data file, wherein the second data file is created from a first data file. The computer determines whether a third data file satisfies one or more of predetermined conditions for backup; wherein the third data file is generated when the second data file is created from the first data file and the third data file comprises information for creating the second data file from the first data file. In response to determining that the third data file satisfies the one or more of the predetermined conditions for backup, the computer backs up the third data file, without backing up the second data file. 1. A method for backing up data in a backup storage space , the method comprising:receiving, by a computer, a request for backing up a second data file, the second data file created from a first data file;determining, by the computer, whether a third data file satisfies one or more of predetermined conditions for backup, the third data file generated when the second data file is created from the first data file, the third data file comprising information for creating the second data file from the first data file; andbacking up, by the computer, the third data file, without backing up the second data file, in response to determining that the third data file satisfies the one or more of the predetermined conditions for backup.2. The method of claim 1 , further comprising:restoring, by the computer, the first data file;restoring, by the computer, the third data file;restoring, by the computer, the second data file by creating the second data file from the first data file, based on the information in the third data file.3. The method of claim 1 , further comprising:backing up, by the computer, the first data file, in response to determining that the first data file has not been backed up.4. The method of claim 1 , wherein ...

Подробнее
Номер записи: 14
22-01-2015 дата публикации

ADAPTING TRANSFER RATE OF CACHED DATA TO PREVENT STOPPAGE OF DATA TRANSMISSION

Номер: US20150022917A1
Автор: Ashida Takashi, HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A file system to controls access to a tape library that selectively loads and unloads a plurality of cartridges from a plurality of slots to a drive for transmitting to the file system archived data retrieved from a particular cartridge. The file system includes a cache and receives a request from a requestor to access the tape library, estimates a first data transfer rate from an anticipated tape library operation completion duration and from a capacity of cached data to be transmitted from the cache to the requestor, initiates access to the tape library, and adapts the first data transfer rate to a second data transfer rate to transmit the capacity of the cached data to the requestor throughout the anticipated tape library operation completion duration. 1. A method for adapting a transfer rate of cached data in a file system controlling access to a tape library comprising:receiving, at the file system, a request to access the tape library;estimating, by the file system, a first data transfer rate from an anticipated tape library operation completion duration and from a capacity of cached data to be transmitted from a cache of the file system;initiating access to the tape library; andadapting the first data transfer rate to a second data transfer rate to transmit the capacity of the cached data throughout the anticipated tape library operation completion duration.2. The method according to claim 1 , wherein adapting the first data transfer rate to a second data transfer rate further comprises:updating the first data transfer rate with the second data transfer rate.3. The method according to claim 1 , wherein adapting the first data transfer rate to a second data transfer rate further comprises:determining remaining capacity of the cached data.4. The method according to claim 3 , wherein the first data transfer rate is updated in response to the determined remaining capacity of the cached data indicating at least 75% utilization of the cache.5. The method according ...

Подробнее
Номер записи: 15
25-01-2018 дата публикации

ESTIMATING MOUNT TIME COMPLETION IN FILE SYSTEMS

Номер: US20180025015A1
Автор: Abe Atsushi, HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

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. 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; andcalculating, 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.2. The method of claim 1 , wherein storing the information claim 1 , 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; andF(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; andcalculating the information based on the function F(t).3. 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.4. The method of claim 2 , wherein storing the information claim 2 , further comprises: {'br': ...

Подробнее
Номер записи: 16
29-01-2015 дата публикации

EFFICIENT DISTRIBUTION AND SELECTION OF STORAGE MEDIA IN A STORAGE MEDIUM LIBRARY

Номер: US20150032251A1
Автор: HASEGAWA Tohru, Hirata Takamasa, IMAI Naoki, KAMIYA Masanori, OISHI Yutaka
Принадлежит:

A location of a first drive in a storage medium library is determined. In response to a determination of the location of the first drive, it is determined whether a first storage medium is located within a first distance from the first drive. In response to a determination that the first storage medium is not located within the first distance from the first drive, it is determined whether the first storage medium is located within a second distance from the first drive. In response to a determination that the first storage medium is located within the first distance or the second distance from the first drive, the first storage medium is made available to be read by or written to by the first drive. 1. A method comprising:determining a location of a first drive in a storage medium library, wherein the location of the first drive comprises a first library unit;in response to said determining the location of the first drive in the storage medium library, determining whether a storage medium is located within a first distance from the first drive;in response to determining that a storage medium is not located within the first distance from the first drive, determining a location of a second drive in the storage medium library, wherein the location of the second drive comprises a second library unit;in response to said determining the location of the second drive in the storage medium library, determining whether a storage medium is located within the first distance from the second drive;in response to determining that a storage medium is not located within the first distance from the second drive, determining whether a storage medium is located within a second distance from the first drive, wherein the second distance is farther than the first distance;in response to determining that a storage medium is located within the first distance or the second distance from the first drive, making the storage medium available to be read by or written to by the first drive; andin ...

Подробнее
Номер записи: 17
02-02-2017 дата публикации

RECLAMATION OF STORAGE MEDIUM

Номер: US20170031603A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

Software for reclaiming a storage medium. The software receives a read request targeting data in a storage system. The software reads the targeted data from a first storage medium storing the targeted data. The software responds to the read request with the targeted data. Responsive to reading the targeted data from the first storage medium and responsive to determining that the first storage medium meets a predetermined condition, the software writes the targeted data to a second storage medium for reclamation. The software may also, subsequent to writing the targeted data to the second storage medium for reclamation, explicitly reclaim the data on the first storage medium to the second storage medium, wherein a time required for explicitly reclaiming is reduced due to the targeted data having already been written to the second storage medium. 1. A method for reclaiming a storage medium , the method comprising:receiving, by one or more processors, a read request targeting data in a storage system;reading, by one or more processors, the targeted data from a first storage medium storing the targeted data;responding, by one or more processors, to the read request with the targeted data; andresponsive to reading the targeted data from the first storage medium, and responsive to determining that the first storage medium meets a predetermined condition, writing, by one or more processors, the targeted data to a second storage medium for reclamation.2. The method of claim 1 , further comprising:responsive to writing the targeted data, updating, by one or more processors, metadata for the targeted data to indicate that the targeted data is stored on the second storage medium.3. The method of claim 1 , wherein the storage system is a hierarchical storage system that includes a tape tier having the first storage medium and the second storage medium claim 1 , and one or more upper tiers above the tape tier in the hierarchical storage system.4. The method of claim 3 , further ...

Подробнее
Номер записи: 18
04-02-2021 дата публикации

Electrochromic device, control device of electrochromic device, and control method of electrochromic device

Номер: US20210033939A1
Автор: Keiichiroh Yutani, Tohru Hasegawa
Принадлежит: Individual

An electrochromic device includes: an electrochromic element operating in at least one of a first optical characteristic state and a second optical characteristic state; and a temperature measuring device configured to measure temperature, and circuitry to control voltage to be applied to the electrochromic element such that the second optical characteristic state becomes constant irrespective of the measured temperature.

Подробнее
Номер записи: 19
11-02-2016 дата публикации

Method of detecting tampering of data in tape drive, and file system

Номер: US20160042760A1
Автор: Masanori Kamiya, Naoki Imai, Takamasa Hirata, Tohru Hasegawa, Yutaka Oishi
Принадлежит: International Business Machines Corp

A method of detecting whether data in a tape drive used in a file system is tampered is described according to one embodiment. The method includes: (a) preparing a first tape cartridge including a tape on which multiple files and archival records of index information are stored in a WORM partition, and index information is stored in the R/W partition; (b) reading and comparing the index information of the R/W partition and the last index information of the WORM partition; and (c) when these two pieces of index information do not match, determining that the index information of the R/W partition is tampered when these two pieces of index information do not match.

Подробнее
Номер записи: 20
06-02-2020 дата публикации

Copy from source medium to target medium

Номер: US20200042185A1
Автор: Hiroshi Itagaki, Noriko Yamamoto, Shinsuke Mitsuma, Sosuke Matsui, Tohru Hasegawa, Tsuyoshi Miyamura
Принадлежит: International Business Machines Corp

A computer-implemented method, according to one embodiment, includes: estimating, by the computer system, a waiting time for copy target data to be transferred from the source medium. The waiting time includes an estimated time for locating and reading the copy target data from the source medium. The method also includes selecting, by the computer system, migration target data on the source medium based on whether migration of data to the target medium is expected to be finished within the waiting time. The selecting is based at least in part on comparing a size of the data and an allowable size calculated based on the waiting time and an estimated write transfer rate to the target medium. The method further includes migrating, by the computer system, the migration target data from the source medium to the target medium.

Подробнее
Номер записи: 21
06-02-2020 дата публикации

TAPE DRIVE DATA RECLAMATION

Номер: US20200042229A1
Автор: HASEGAWA Tohru, Itakagi Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

Method, computer program product, and system embodiments of the present disclosure may include a computing device which may set a predetermined flag on data to be copied from a primary storage tier and a secondary storage tier. The computing device may identify a first portion of the flagged data as being in a pre-migrated state stored on the primary storage tier and migrate the flagged pre-migrated data from the primary storage tier to a target medium. The computing device may identify a second portion of the flagged data as being in a migrated state stored on the secondary storage tier. The computing device may recall the flagged migrated data from the secondary storage tier to the primary storage tier and migrate the recalled migrated data from the primary storage tier to the target medium. 1. A method for copying data from source media to target media in a storage system , the method comprising:setting a predetermined flag on data to be copied from a primary storage tier and a secondary storage tier, by a node in a computer system;identifying, by the node, migrated data being a first portion of the flagged data in a migrated state stored on the secondary storage tier;recalling, by the node, the flagged migrated data from the secondary storage tier to the primary storage tier; andmigrating, by node, of recalled migrated data from the primary storage tier to the target medium.2. A method as in claim 1 , further comprising:identifying, by the node, pre-migrated data being a second portion of the flagged data in a pre-migrated state stored on the primary storage tier;migrating, by the node, the flagged pre-migrated data from the primary storage tier to a target medium;3. A method as in claim 1 , further comprising:identifying, by the node, a third portion of the flagged data in a resident state stored on the primary storage tier;transforming, by the node, the flagged resident data into pre-migrated data by placing a copy of the flagged resident data from the primary ...

Подробнее
Номер записи: 22
06-02-2020 дата публикации

TAPE IMAGE RECLAIM IN HIERARCHICAL STORAGE SYSTEMS

Номер: US20200042607A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A computer-implemented method for performing a storage reclaim on a storage device includes generating a second tape image on a first storage device. The computer-implemented method further includes copying metadata associated with a first data extent of a valid file from a first index partition of a first tape image to a second index partition of the second tape image. The computer-implemented method further includes copying file data associated with the first data extent from a first data partition of the first tape image to a second data partition of the second tape image. The computer-implemented method further includes adjusting metadata associated with the file data of the first data extent copied to the second data partition of the second tape image. The computer-implemented method further includes releasing a storage area corresponding to the first data extent of the valid file included in the first tape image. 1. A computer-implemented method for performing a storage reclaim on a storage device , the computer-implemented method comprising:generating a second tape image on a first storage device, wherein the second tape image is void of any data;copying metadata associated with a first data extent of a valid file from a first index partition of a first tape image to a second index partition of the second tape image;copying file data associated with the first data extent of the valid file from a first data partition of the first tape image to a second data partition of the second tape image;adjusting metadata associated with the file data of the first data extent of the valid file copied to the second data partition of the second tape image; andreleasing a storage area corresponding to the first data extent of the valid file included in the first tape image.2. The computer-implemented of claim 1 , further comprising:releasing a storage area of an invalid file included in the first tape image.3. The computer-implemented method of claim 1 , wherein copying ...

Подробнее
Номер записи: 23
18-02-2021 дата публикации

Web-sourced device control

Номер: US20210049200A1
Автор: Asako Ono, Hiroaki Uetsuki, Issei Yoshida, Kenta WATANABE, Shunsuke Ishikawa, Tohru Hasegawa, Yasuyuki Tominaga
Принадлежит: International Business Machines Corp

A method, computer program product and computer system are provided to promote device usage compliance. A processor retrieves a current position for a device. A processor determines at least one nearby location based on the current position of the device. A processor retrieves search data regarding the at least one nearby location. A processor determines compliance information regarding the at least one location based, at least in part, on the search data. A processor configures the device based on the compliance information regarding the at least one location.

Подробнее
Номер записи: 24
15-02-2018 дата публикации

METHOD OF WRITING A FILE TO A PLURALITY OF MEDIA AND A STORAGE SYSTEM THEREOF

Номер: US20180046397A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MIYAMURA TSUYOSHI, Watanabe Terue
Принадлежит:

A method according to one embodiment includes instructing a first tape drive to load a parent tape medium, and instructing the first tape drive to retrieve identification (ID) information about the parent tape medium from metadata stored (saved) thereon. The first tape drive is instructed to write a first file part of a file to the parent tape medium. Information about the file and information about the first file part are written to the parent tape medium as metadata. A second tape drive is instructed to load and retrieve ID information about a child tape medium from metadata stored thereon. The second tape drive is instructed to write one or more subsequent file parts of the file to the child tape medium. The first tape drive is instructed to write the ID information about the child tape medium and attribute information about the one or more subsequent file parts stored to the child tape medium as metadata to the parent tape medium. 1. A method , comprising:instructing a first tape drive to load a parent tape medium;instructing the first tape drive to retrieve identification (ID) information about the parent tape medium from metadata stored on the parent tape medium;instructing the first tape drive to write a first file part of a file to the parent tape medium, wherein information about the file and information about the first file part are written to the parent tape medium as metadata;instructing a second tape drive to load a child tape medium;instructing the second tape drive to retrieve ID information about the child tape medium from metadata stored on the child tape medium;instructing the second tape drive to write one or more subsequent file parts of the file to the child tape medium, wherein information about the file and information about the one or more subsequent file parts are written to the child tape medium as metadata; andinstructing the first tape drive to write the ID information about the child tape medium and attribute information about the one or ...

Подробнее
Номер записи: 25
16-02-2017 дата публикации

FILE MIGRATION IN A HIERARCHICAL STORAGE SYSTEM

Номер: US20170046351A1
Автор: HASEGAWA Tohru, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A method, executed by at least one processor, includes receiving a migration request for a plurality of files, assigning files of the plurality of files that are smaller than a selected size to one or more small-file secondary storage devices, assigning files of the plurality of files that are larger than the selected size to one or more large-file secondary storage devices, and initiating migration of the plurality of files from one or more primary storage devices to the secondary storage devices to which they are assigned. A corresponding computer program product and computer system are also disclosed herein. 1. A method , executed by at least one processor , the method comprising:receiving a migration request for a plurality of files;assigning files of the plurality of files that are smaller than a selected size to one or more small-file secondary storage devices;assigning files of the plurality of files that are larger than the selected size to one or more large-file secondary storage devices; andinitiating migration of the plurality of files from one or more primary storage devices to the secondary storage devices to which they are assigned.2. The method of claim 1 , wherein the migration request is generated in response to closing a file on the primary storage device.3. The method of claim 1 , wherein the selected size is automatically determined from at least one recall specification.4. The method of claim 3 , wherein the recall specification is selected from the group consisting of a file transfer speed claim 3 , an unmounting time claim 3 , an unloading time claim 3 , a loading time claim 3 , a mounting time claim 3 , and a seek time.5. The method of claim 1 , wherein initiating migration comprises invoking a file system function call.6. The method of claim 1 , wherein the secondary storage devices correspond to a storage library.7. The method of claim 6 , wherein the secondary storage devices are managed by a linear media file system.8. A computer program ...

Подробнее
Номер записи: 26
03-03-2022 дата публикации

MULTI-CHANNEL SEARCH

Номер: US20220067053A1
Автор: GOTO Takuya, HASEGAWA Tohru, Kikuchi Hiroaki, Liu Xiangning, ONO ASAKO
Принадлежит:

A method for a multi-channel search includes receiving a specific post selection submitted in a first channel and query text associated with the specific post in the first channel, where the query text includes one or more words for performing a query evaluation. The method receives a query location which includes a plurality of channels for performing the query evaluation. Responsive to extracting one or more ranking factors from the specific post selection, the method performs the query evaluation at the query location to collect a plurality of potential matching posts based on the one or more ranking factors. The method reorders the plurality of potential matches according to a plurality of determined scores for the plurality of potential matches. The method displays two-dimensional search results based on a timeline and channel relevancy, where the plurality of channels is ordered according to channel relevancy compared to the first channel.

Подробнее
Номер записи: 27
22-02-2018 дата публикации

FILE MANAGEMENT IN A FILE SYSTEM

Номер: US20180052640A1
Автор: HASEGAWA Tohru, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A memory that includes a data partition and an index partition is mounted. The data partition includes an original data and an original index written directly after the original data. The index partition includes the original index at the beginning of the index partition. The first data is written to a data partition of the memory. The first data is written directly after the at least one data on the data partition and the original index is deleted and invalidated. Responsive to a time interval elapsing, a first index is written to the data partition of the memory directly after the first data. The time interval starts at the writing of the first data. Responsive to the time interval elapsing, the first index is written to the index partition of the memory at the closest location, in terms of movement time, to the first index on the data partition. 1. A method for writing data , the method comprising the steps of:mounting, by one or more computer processors, a memory, wherein the memory includes a data partition and an index partition, and wherein the data partition includes an original data and an original index written directly after the original data, and wherein the index partition includes the original index at the beginning of the index partition, and wherein the index partition is placed vertically above the data partition, and wherein a beginning of the index partition aligns with a beginning of the data partition;writing, by one or more computer processors, a first data to the data partition of the memory, wherein the first data is written directly after the original data on the data partition and wherein the original index is deleted on the data partition; andresponsive to the time interval elapsing, wherein the time interval starts at the writing of the first data, writing, by one or more computer processors, the first index to the index partition of the memory, wherein the first index is written on the index partition at a closest location, in terms of ...

Подробнее
Номер записи: 28
23-02-2017 дата публикации

LISTING STORAGE MEDIA

Номер: US20170052705A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki
Принадлежит:

A directory listing for use with a file system for a storage media library including a plurality of storage drives and a plurality of storage mediums, where all of the storage mediums are respectively either mounted on a storage drive or unmounted with respect to the storage drives, at least one storage medium is mounted on a storage drive, at least one storage medium is unmounted with respect to the storage drives. In the directory listing the mounted storage medium(s) are not intermingled with the unmounted storage medium(s). In some embodiments the storage media library system is a tape media library system where the storage mediums are tape mediums and the storage drives are tape drives. 1. A computer implemented method for use with a file system for a storage media library including a plurality of storage drives and a plurality of storage mediums , where all of the storage mediums are respectively either mounted on a storage drive or unmounted with respect to the storage drives , at least one storage medium is mounted on a storage drive , at least one storage medium is unmounted with respect to the storage drives , the method comprising:determining a set of mounted storage medium(s) of the plurality of storage mediums that are respectively mounted on a storage drive;determining a set of unmounted storage medium(s) of the plurality of storage mediums that are respectively unmounted with respect to the storage drive; andgenerating a machine readable display data set corresponding to a directory listing of the plurality of storage mediums where the set of mounted storage medium(s) are not intermingled with the set of unmounted storage medium(s) in the directory listing.2. The method of further comprising:displaying, on a display device, the directory listing based on the machine readable display data set.3. The method of wherein the generation of the machine readable display data set is performed so that the storage medium(s) of the set of mounted display medium(s ...

Подробнее
Номер записи: 29
23-02-2017 дата публикации

SCALABLE AND EFFICIENT ACCESS TO AND MANAGEMENT OF DATA AND RESOURCES IN A TIERED DATA STORAGE SYSTEM

Номер: US20170052706A1
Автор: Abe Atsushi, Ashida Takashi, Bjoerkqvist Mathias, HASEGAWA Tohru, Ishimoto Takeshi, Itagaki Hiroshi, Petermann Martin, SARAFIJANOVIC Slavisa, Weigold Thomas D.
Принадлежит:

In a general embodiment, a method includes storing hierarchically-organized global configuration information for each node and each tape library resource in a storage cluster to at least one memory accessible by each node of the storage cluster, the storage cluster comprising at least one tape library. The method further includes migrating and/or recalling, using the hierarchically-organized global configuration information, data to and/or from a tape cartridge pool within a tape library. The migration or recall is performed by an appropriate node of the storage cluster and in response to receiving a migration or recall request at an arbitrary node of the storage cluster. 1. A computer program product , the computer program product comprising a computer readable storage medium having program instructions embodied therewith , the embodied program instructions being executable by at least one processor to cause the at least one processor to:store, by at least one processor of at least one node of a storage cluster, hierarchically-organized global configuration information for each node and each tape library resource in the storage cluster to at least one memory accessible by each node of the storage cluster, the storage cluster comprising at least one tape library;store, using the global configuration information, by at least one processor of a first node of the storage cluster, data from a high availability (HA) memory to a tape cartridge pool within a first tape library in response to receiving a migration request at any node of the storage cluster, wherein the first tape library is in electronic communication with the first node, and wherein the tape cartridge pool comprises one or more tape cartridges; andrecall, using the global configuration information, by the at least one processor of a second node, the data from the tape cartridge pool within the first tape library in response to receiving a recall request at any node of the storage cluster, wherein the first ...

Подробнее
Номер записи: 30
23-02-2017 дата публикации

DUPLEXING FILE SYSTEM DATA

Номер: US20170052718A1
Автор: Abe Atsushi, Ashida Takashi, HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue
Принадлежит:

One or more processors receive data records from a file system, and convert the data records to a tape image having a format defined by the file system. The tape image is written to a first storage device, and a sequence of data types of the first storage device and a second storage device are monitored to determine whether the first storage device sequence of data types differs from the sequence of data types of the second storage device. Determining that the sequence of data types of the first storage device and second storage device do differ, one or more processors copying, to the second storage device, the data records from the first storage device, from the position on the first storage device that corresponds to the end-of-data position of the second storage device, to the end-of-data position of the first storage device. 1. A method for duplicating data of a file system , the method comprising:receiving, by one or more processors, data records of a file system in response to an input-output request of an application;converting, by one or more processors, the data records to a tape image, wherein the tape image assumes a format defined by the file system;writing, by one or more processors, the tape image to a first storage device, wherein the tape image includes a sequence of data types including data records, file markers, and an end-of-data position of the tape image on the first storage device;monitoring, by one or more processors, the sequence of data types of the first storage device, and a sequence of data types of a second storage device;determining, by one or more processors, whether the sequence of data types of the first storage device differs from the sequence of data types of the second storage device; andresponsive to determining the sequence of data types of the first storage device does differ from the sequence of data types of the second storage device, copying, by one or more processors, to the second storage device, the data records from the ...

Подробнее
Номер записи: 31
13-02-2020 дата публикации

DETECTING DAMAGED AREAS ON MAGNETIC TAPE MEDIA USING DIAGNOSTICS LOCATE

Номер: US20200051591A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a processor to cause the processor to: determine, by the processor, a first error location on a magnetic tape where a first error occurred. One or more areas on the magnetic tape to be examined are also determined, by the processor, based on the first error location. Independent of a read and/or write operation, relative motion between a tape head and the magnetic tape is induced by the processor, such that the tape head is positioned adjacent to each of the one or more areas in turn. Moreover, each of the one or more areas having a respective number of measured servo errors which exceeds a threshold value are identified, by the processor, as a damaged area of the magnetic tape. 1. A computer program product comprising a computer readable storage medium having program instructions embodied therewith , the program instructions readable and/or executable by a processor to cause the processor to:determine, by the processor, a first error location on a magnetic tape where a first error occurred;determine, by the processor, one or more areas on the magnetic tape to be examined based on the first error location;independent of a read and/or write operation, induce, by the processor, relative motion between a tape head and the magnetic tape such that the tape head is positioned adjacent to each of the respective one or more areas in turn; andidentify, by the processor, each of the one or more areas having a respective number of measured servo errors which exceeds a threshold value as a damaged area of the magnetic tape.2. The computer program product as recited in claim 1 , wherein the one or more areas on the magnetic tape to be examined includes a first area claim 1 , wherein the first area is located adjacent to an area containing the first error location claim 1 , ...

Подробнее
Номер записи: 32
13-02-2020 дата публикации

DETECTING DAMAGED AREAS ON MAGNETIC TAPE MEDIA USING DIAGNOSTICS LOCATE

Номер: US20200051592A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A computer-implemented method, according to one embodiment, includes: receiving, from a tape drive, a first error location on a magnetic tape where a first error occurred, in addition to determining one or more areas on the magnetic tape to be examined based on the first error location. Independent of a read and/or write operation, the tape drive is instructed to induce relative motion between a tape head and the magnetic tape such that the tape head is positioned adjacent to each of the respective one or more areas in turn. Moreover, each of the one or more areas having a respective number of measured servo errors which exceeds a threshold value is identified as a damaged area of the magnetic tape. 1. A computer-implemented method , comprising:receiving, from a tape drive, a first error location on a magnetic tape where a first error occurred;determining one or more areas on the magnetic tape to be examined based on the first error location;independent of a read and/or write operation, instructing the tape drive to induce relative motion between a tape head and the magnetic tape such that the tape head is positioned adjacent to each of the respective one or more areas in turn; andidentifying each of the one or more areas having a respective number of measured servo errors which exceeds a threshold value as a damaged area of the magnetic tape.2. The computer-implemented method as recited in claim 1 , wherein the first error is a permanent error which occurred while performing read and/or write operations on the magnetic tape.3. The computer-implemented method as recited in claim 1 , comprising:making a backup copy of data stored in the identified damaged area(s) of the magnetic tape by copying the data from a buffer memory or another storage medium having a copy of the data stored in the identified damaged area(s) of the magnetic tape, wherein the backup copy is stored on a second magnetic tape.4. The computer-implemented method as recited in claim 1 , comprising: ...

Подробнее
Номер записи: 33
01-03-2018 дата публикации

RECALLING FILES STORED ON A TAPE

Номер: US20180059959A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

The time required for recalling the file is reduced when the file is written in a mounted plurality of tapes in comparison to recalling the file when written in a non-mounted plurality of tapes. In the non-mounted state, criteria does not typically exist in order to recall the written file within the plurality of tapes. Embodiments of the present invention provide systems and methods for recalling files based on criteria which considers: the mounted state of a tape; the type of tape; the type of available tape drive; the number of files included in a tape; and the location of the written file in a tape. 1. A method for recalling a file , comprising:recording, by one or more processors, a file within a plurality of storage media;calculating, by one or more processors, an expected reading time to read the file for each component within the plurality of storage media in which the file is recorded, wherein the expected reading time includes a time required for mounting the component loaded in a drive;identifying, by one or more processors, the component to be used for reading the file, wherein the identified component has the lowest expecting reading time among the plurality of storage media; andconverting, by one or more processors, the file into a stub file based on attributes of the file, wherein the attributes of the file include correspondence information and a location of the file within the plurality of storage media.2. The method of claim 1 , further comprising:dynamically counting, by one or more processors, a number of files and directories stored in the component; andcalculating, by one or more processors, the time required for mounting the component based on the dynamically counted number of files and directories stored in the component.3. The method of claim 1 , wherein calculating the expected reading time claim 1 , further comprises:determining, by one or more processors, a time required for loading a component in the drive.4. The method of claim 3 , ...

Подробнее
Номер записи: 34
01-03-2018 дата публикации

RECALLING FILES STORED ON A TAPE

Номер: US20180059960A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

The time required for recalling the file is reduced when the file is written in a mounted plurality of tapes in comparison to recalling the file when written in a non-mounted plurality of tapes. In the non-mounted state, criteria does not typically exist in order to recall the written file within the plurality of tapes. Embodiments of the present invention provide systems and methods for recalling files based on criteria which considers: the mounted state of a tape; the type of tape; the type of available tape drive; the number of files included in a tape; and the location of the written file in a tape. 1a non-transitory computer readable storage medium and program instructions stored on the non-transitory computer readable storage medium, the program instructions comprising:program instructions to record a file within a plurality of storage media containing at least one component; 'determining a time required to load each component, characteristics associated with the drive, a first time required for seeking a recording location of the file on each component and for reading the file, a second time required for reading the file based, on a position in a vertical direction of the file and a position in a longitudinal direction of the file;', 'program instructions to calculate an expected reading time to read the file for each component within the plurality of storage media in which the file is recorded, wherein the expected reading time includes a time required for mounting each component loaded in a drive, wherein calculating the expected reading time comprisesresponsive to migrating a file from a primary storage to a component within the plurality of storage media, program instructions to associate the vertical direction of the file and the longitudinal direction of the file on the component with an identification of the component to be utilized for reading the file, wherein the component has a lowest expected reading time among the plurality of storage media; ...

Подробнее
Номер записи: 35
01-03-2018 дата публикации

RECALLING FILES STORED ON A TAPE

Номер: US20180059961A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

The time required for recalling the file is reduced when the file is written in a mounted plurality of tapes in comparison to recalling the file when written in a non-mounted plurality of tapes. In the non-mounted state, criteria does not typically exist in order to recall the written file within the plurality of tapes. Embodiments of the present invention provide systems and methods for recalling files based on criteria which considers: the mounted state of a tape; the type of tape; the type of available tape drive; the number of files included in a tape; and the location of the written file in a tape. 1one or more computer processors;one or more non-transitory computer readable storage media; andprogram instructions stored on the one or more non-transitory computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising:program instructions to record a file within a plurality of storage media containing at least one component; 'determining a time required to load each component, characteristics associated with the drive, a first time required for seeking a recording location of the file on each component and for reading the file, a second time required for reading the file based, on a position in a vertical direction of the file and a position in a longitudinal direction of the file;', 'program instructions to calculate an expected reading time to read the file for each component within the plurality of storage media in which the file is recorded, wherein the expected reading time includes a time required for mounting each component loaded in a drive, wherein calculating the expected reading time comprisesresponsive to migrating a file from a primary storage to a component within the plurality of storage media, program instructions to associate the vertical direction of the file and the longitudinal direction of the file on the component with an identification of the component to be utilized for ...

Подробнее
Номер записи: 36
04-03-2021 дата публикации

OPTIMIZED TAPE DRIVE UNMOUNTING

Номер: US20210064298A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A computer-implemented method for faster unmount of tape drives includes generating a batch file to be migrated from a primary storage to a tape media acting as a secondary storage. The size of the batch file is determined based on an amount of available storage space on the tape media between a position in a longitudinal direction of storage (LPOS) and longitudinal position three (LP) on the tape media. The computer-implemented method further includes migrating the batch file from the primary storage to the tape media mounted on a tape drive. Upon completion of migrating the batch file, the LPOS is within a predetermined threshold distance of LP on the tape media. 1. A computer-implemented method for faster unmount of tape drives , the computer-implemented method comprising:{'b': '3', 'generating, by one or more processors, a batch file to be migrated from a primary storage to a tape media acting as a secondary storage, wherein a size of the batch file is determined based on an amount of available storage space on the tape media between a position in a longitudinal direction of storage (LPOS) and longitudinal position three (LP) on the tape media; and'}{'b': '3', 'migrating, by the one or more processors, the batch file from the primary storage to the tape media mounted on a tape drive, wherein upon completion of migrating the batch file, the LPOS is within a predetermined threshold distance of LP on the tape media.'}2. The computer-implemented method of claim 1 , wherein the LPOS is a file recording end position on the tape media that includes a longitudinal position with respect to a lateral position perpendicular to the longitudinal position.33. The computer-implemented method of claim 1 , wherein upon completion of migrating the batch file claim 1 , the LPOS is within the predetermined threshold distance of LP on a particular Wrap having a longitudinal recording direction from right to left on the tape media.43. The computer-implemented method of claim 1 , ...

Подробнее
Номер записи: 37
02-03-2017 дата публикации

FILE MANAGEMENT IN A FILE SYSTEM

Номер: US20170060895A1
Автор: HASEGAWA Tohru, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A memory that includes a data partition and an index partition is mounted. The data partition includes an original data and an original index written directly after the original data. The index partition includes the original index at the beginning of the index partition. The first data is written to a data partition of the memory. The first data is written directly after the at least one data on the data partition and the original index is deleted and invalidated. Responsive to a time interval elapsing, a first index is written to the data partition of the memory directly after the first data. The time interval starts at the writing of the first data. Responsive to the time interval elapsing, the first index is written to the index partition of the memory at the closest location, in terms of movement time, to the first index on the data partition. 1. A method for writing data , the method comprising the steps of:mounting, by one or more computer processors, a memory, wherein the memory includes a data partition and an index partition, and wherein the data partition includes an original data and an original index written directly after the original data, and wherein the index partition includes the original index at the beginning of the index partition;writing, by one or more computer processors, a first data to a data partition of the memory, wherein the first data is written directly after the at least one data on the data partition and the original index is deleted and invalidated;responsive to a time interval elapsing, wherein the time interval starts at the writing of the first data, writing, by one or more computer processors, a first index to the data partition of the memory, wherein the first index is written directly after the first data on the data partition; andresponsive to the time interval elapsing, wherein the time interval starts at the writing of the first data, writing, by one or more computer processors, the first index to the index partition of ...

Подробнее
Номер записи: 38
22-05-2014 дата публикации

EFFICIENT MOVEMENT OF STORAGE MEDIA IN A STORAGE MEDIA LIBRARY

Номер: US20140140803A1
Автор: HASEGAWA Tohru, Hirata Takamasa, IMAI Naoki, KAMIYA Masanori, OISHI Yutaka
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method includes receiving a request for the use of a first storage medium located in a first library unit in a storage medium library. It is determined that the first storage medium is to be moved by a transportation component. In response to determining that the first storage medium is to be moved by the transportation component, it is determined that the transportation component is located at a second library unit. In response to determining that the transportation component is located at the second library unit, it is determined that a second storage medium, which is in the second library unit, can be transported to the first library unit. In response to a determination that the second storage medium can be transported to the first library unit, the second storage medium is transported to the first library unit. 1. A method comprising:receiving a request for the use of a first storage medium located in a first library unit in a storage medium library;determining that the first storage medium is to be moved by a transportation component, wherein the transportation component moves storage media within a library unit or between library units in the storage medium library;responsive to determining that the first storage medium is to be moved by the transportation component, determining that the transportation component is located at a second library unit;responsive to determining that the transportation component is located at the second library unit, determining that a second storage medium, which is in the second library unit, can be transported to the first library unit; andresponsive to determining that the second storage medium can be transported to the first library unit, transporting the second storage medium to the first library unit.2. The method of claim 1 , wherein determining that the second storage medium claim 1 , which is in the second library unit claim 1 , can be transported to the first library unit comprises:determining that the first library ...

Подробнее
Номер записи: 39
02-03-2017 дата публикации

ENCODING INFORMATION ON TAPE USING WRITE OFFSET GAPS

Номер: US20170061996A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

As disclosed herein a method for encoding information on tape using write offset gaps. The method includes receiving a request to write a dataset on a tape medium using a plurality of head groups, and identifying information to be encoded when writing the dataset. The method further includes determining a head group offset pattern that encodes the information, and writing the dataset using the head group offset pattern. Also disclosed herein is a method for decoding information on tape using write offset gaps. The method includes reading a dataset from a tape medium using a plurality of head groups, and determining a head group offset pattern used to read the dataset. The method further includes decoding information encoded in the head group offset pattern to provide decoded information. A computer program product corresponding to the above method is also disclosed herein. 120-. (canceled)21. A method comprising:receiving a request to write a dataset on a tape medium using a plurality of head groups;identifying information to be encoded when writing the dataset;determining a head group offset pattern that encodes the information;writing the dataset using the head group offset pattern; andwriting a synchronization pattern on the tape medium for each head group, wherein the synchronization pattern for each head group is offset on the tape medium according to the head group offset pattern.22. A method comprising:receiving a request to write a dataset on a tape medium using a plurality of head groups;identifying information to be encoded when writing the dataset;determining a head group offset pattern that encodes the information, wherein the head group offset pattern indicates whether error recovery parameters are encoded therein; andwriting the dataset using the head group offset pattern.23. A method comprising:reading a dataset from a tape medium using a plurality of head groups;determining a head group offset pattern used to read the dataset, wherein the head group ...

Подробнее
Номер записи: 40
01-03-2018 дата публикации

MULTIPLE TAPE VIDEO DATA SPLITTER

Номер: US20180063469A1
Автор: ARAKI Hiroshi, FUJIHARA Shinobu, HASEGAWA Tohru, Ishimoto Takeshi, Itagaki Hiroshi, MIYOSHI Hiroyuki, OISHI Yutaka
Принадлежит:

An approach, for storing video data in a plurality of tape media via a ring buffer. A tape data splitter receives video data stored in a ring buffer. The tape data splitter writes the video data to a current tape media. The tape data splitter detects an end of tape media event. The tape data splitter responds to the end of tape media event, by switching the current tape media to a next tape media. The tape data splitter selects a resume point for the video data stored in the ring buffer and writes to the next tape media, the video data stored in the ring buffer that is subsequent to the resume point. 1. A method , for storing video data in a plurality of tape media via a ring buffer , the method comprising:receiving, by a tape data splitter, video data stored in a ring buffer;writing, by the tape data splitter, the video data to a current tape media;detecting, by the tape data splitter, an end of tape media event;responsive to the end of tape media event, switching, by the tape data splitter, the current tape media to a next tape media;selecting, by the tape data splitter, a resume point for the video data stored in the ring buffer; andwriting, by the tape data splitter, to the next tape media, the video data stored in the ring buffer that is subsequent to the resume point.2. The method of wherein the resume point claim 1 , comprises at least one of a previous cut point preceding the end of tape media event claim 1 , a minimum secured time point corresponding a predetermined time duration preceding the end of tape media event and a predetermined margin time point added to at least one of the previous cut point and the minimum secured time point.3. The method of claim 1 , wherein writing the video data stored in the ring buffer further comprises clearing the video data stored in the ring buffer preceding the resume point.4. The method of claim 1 , wherein the ring buffer storage has a size that encompasses the video data for a selected time interval wherein the ...

Подробнее
Номер записи: 41
22-05-2014 дата публикации

EFFICIENT MOVEMENT OF STORAGE MEDIA IN A STORAGE MEDIA LIBRARY

Номер: US20140142741A1
Автор: HASEGAWA Tohru, Hirata Takamasa, IMAI Naoki, KAMIYA Masanori, OISHI Yutaka
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

An apparatus comprises a network interface, a processor and a computer readable storage medium coupled with the processor. The computer readable storage medium includes computer usable program code. The computer usable program code, when executed by the processor, causes the processor to receive a request for a first storage medium located in a first library unit in a storage medium library. The processor is caused to determine that the first storage medium is to be moved by a transportation component. The processor is caused to, responsive to said determination, determine that the transportation component is located in a second library unit. The processor is caused to, responsive to said determination, determine that a second storage medium located in the second library unit can be transported to the first library unit. Responsive to said determination, the processor is caused to transport the second storage medium to the first library unit. 19.-. (canceled)10. A computer program product comprising: receive a first request to perform an action within a storage medium library, wherein a transportation component will be used to service the first request;', 'receive a second request to perform an action within the storage medium library, wherein the transportation component will be used to service the second request;', 'determine that the transportation component will be empty while servicing part of the first request;', 'responsive to a determination that the transportation component will be empty while servicing part of the first request, determine that the second request can be serviced using the transportation component while servicing the first request; and', 'responsive to a determination that the second request can be serviced using the transportation component while servicing the first request, service at least part of the second request while servicing at least part of the first request., 'a computer readable storage medium having computer usable program code ...

Подробнее
Номер записи: 42
22-05-2014 дата публикации

Efficient distribution and selection of storage media in a storage medium library

Номер: US20140142742A1
Автор: Masanori Kamiya, Naoki Imai, Takamasa Hirata, Tohru Hasegawa, Yutaka Oishi
Принадлежит: International Business Machines Corp

An apparatus includes a network interface, a processor and a computer readable storage medium. The processor is coupled with the computer readable storage medium. The computer readable storage medium has computer readable program code embodied therewith. The computer readable program code, when executed by the processor, causes the processor to determine the state of a storage medium library and determine distribution for a plurality of distributable components within the storage medium library based, at least in part, on the state of the storage medium library. The computer readable program code also causes the processor to, responsive to a determination of the distribution for the plurality of distributable components within the storage medium library, issue commands distributing the plurality of distributable components within the storage medium library in accordance with the distribution.

Подробнее
Номер записи: 43
22-05-2014 дата публикации

EFFICIENT DISTRIBUTION AND SELECTION OF STORAGE MEDIA IN A STORAGE MEDIUM LIBRARY

Номер: US20140142743A1
Автор: HASEGAWA Tohru, Hirata Takamasa, IMAI Naoki, KAMIYA Masanori, OISHI Yutaka
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method includes determining a distribution for a plurality of distributable components within a storage medium library. It is determined that the plurality of distributable components are not currently distributed across the storage medium library in accordance with the distribution. In response to determining the distribution for the plurality of distributable components and to determining that the plurality of distributable components are not currently distributed across the storage medium library in accordance with the distribution, a set of one or more commands to move one or more of the plurality of distributable components to different locations of the storage medium library in accordance with the distribution are issued. 1. A method comprising:determining a distribution for a plurality of distributable components within a storage medium library;determining that the plurality of distributable components are not currently distributed across the storage medium library in accordance with the distribution; andresponsive to said determining the distribution for the plurality of distributable components and said determining that the plurality of distributable components are not currently distributed across the storage medium library in accordance with the distribution, issuing a set of one or more commands to move one or more of the plurality of distributable components to different locations of the storage medium library in accordance with the distribution.2. The method of claim 1 , wherein the plurality of distributable components comprises one of storage media and storage media cars claim 1 , wherein the storage media cars transport storage media.3. The method of claim 1 , wherein the distribution is one of a distribution in which at least one distributable component of the plurality of distributable components is located within each library unit of the same type claim 1 , a distribution in which plurality of distributable components are distributed in equal ...

Подробнее
Номер записи: 44
08-03-2018 дата публикации

WRITING FILES TO A STORAGE MEDIUM

Номер: US20180067681A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A method for writing a plurality of files that reduces average seek time includes receiving data of the plurality of files requested to be written to a tape from an application of a host, dividing a group of the received plurality of files into segments with specified sizes, and writing a series of the plurality of respective segments of the group of the plurality of files in sequence in a specified order, the respective segments having the specified sizes, wherein when writing the segments in the specified order, a left end portion of the tape is positioned and respective top segments of the files are first collectively written thereto. A tape drive system in which the method for writing is implemented can reduce an average time required for seek of a plurality of image files. 1. A method for writing a plurality of image files capable of reducing an average time for seek of the plurality of files stored on a tape , comprising:receiving data of the plurality of files from an application of a host;dividing a group of the received plurality of files into segments having specified sizes; andwriting a series of the plurality of respective segments of the group of the plurality of files in sequence in a specified order, the respective segments having the specified sizes, wherein writing the segments in the specified order comprises collectively writing respective top segments of the files to a left end portion of the tape.2. The method of claim 1 , wherein writing the series of the plurality of respective segments of the group of the plurality of files in sequence in a specified order comprises starting to collectively write respective top segments of the files to a left end portion of an even wrap of the tape.3. The method of claim 1 , wherein writing a series of the plurality of respective segments of the group of the plurality of files in sequence in a specified order further comprises starting to collectively write respective last segments of the files to a left end ...

Подробнее
Номер записи: 45
27-02-2020 дата публикации

MANAGEMENT OF A MULTI-LIBRARY STORAGE SYSTEM

Номер: US20200065022A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A computer-implemented method for managing a first storage library and a second storage library, according to one embodiment, includes associating a first physical tape and a second physical tape with a logical tape. The associating includes writing a first identifier to an index of the logical tape. The first identifier represents the first physical tape and the first storage library. The associating further includes writing a second identifier to the index of the logical tape. The second identifier represents the second physical tape and the second storage library. The computer-implemented method further includes storing the index of the logical tape in memory, and displaying the logical tape by reading the index from memory as a file system. 1. A computer-implemented method for managing a first storage library and a second storage library , the computer-implemented method comprising: writing a first identifier to an index of the logical tape, wherein the first identifier represents the first physical tape and the first storage library, and', 'writing a second identifier to the index of the logical tape, wherein the second identifier represents the second physical tape and the second storage library;, 'associating a first physical tape and a second physical tape with a logical tape, wherein the associating includesstoring the index of the logical tape in memory; anddisplaying the logical tape by reading the index from memory as a file system.2. A computer-implemented method as recited in claim 1 , comprising: identifying both the first physical tape and the second physical tape as a destination to which the data is to be written;', 'writing the data on both the first physical tape and the second physical tape; and', 'updating the index of the logical tape to reflect the written data., 'in response to receiving a request to write data3. A computer-implemented method as recited in claim 2 , comprising:receiving a read request for the data;reading the index of the ...

Подробнее
Номер записи: 46
09-03-2017 дата публикации

WRITING DATA SPANNING PLURALITY OF TAPE CARTRIDGES

Номер: US20170068461A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A method includes, in a tape apparatus system, receiving a request to write a file from a host, and, in response to the request, dividing sequentially received data of the file into two or more segments. Each of the two or more segments have a predetermined size. The method further includes sequentially writing a series of the two or more segments onto one or more tapes, and determining the predetermined size based on a capacity use efficiency of a plurality of other tapes and a time to copy when a spanning file, written by spanning on the one or more tapes, is copied to the plurality of other tapes. A corresponding computer program product and computer system are also disclosed. 1. A tape apparatus system comprising:means for receiving a request to write the file from a host;means for dividing sequentially received data of the file into segments each having a predetermined size, in response to the request;means for sequentially writing a series of the segments onto one or more tapes in order to store the file into the tapes; andmeans for determining the predetermined size of each segment on the basis of capacity use efficiency of a plurality of other tapes and a time to copy when a spanning file that is written by spanning on the plurality of tapes is copied to the plurality of other tapes.2. The system according to claim 1 , wherein the determining the predetermined size of each segment includes determining the predetermined size on the basis of a free space of the tape.3. The system according to claim 1 , wherein the determining the predetermined size of each segment includes determining the time to copy when the spanning file is copied to the plurality of other tapes claim 1 , on the basis of a time to rewrite the segment and a time to write meta-information of the segment.4. The system according to claim 2 , wherein the predetermined size is determined so as to be smaller than the free space of the tape.5. The system according to claim 3 , wherein the ...

Подробнее
Номер записи: 47
08-03-2018 дата публикации

MANAGEMENT OF MEDIA CONTENT ON A STORAGE MEDIUM

Номер: US20180070048A1
Автор: ARAKI Hiroshi, FUJIHARA Shinobu, HASEGAWA Tohru, Ishimoto Takeshi, Itagaki Hiroshi, MIYOSHI Hiroyuki, OISHI Yutaka
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method for managing media content is disclosed. In one embodiment, the method stores a first data part relating to target media content in a storage medium. The first data part include degraded media content of the target media content. The method further stores a second data part relating to the target media content. The second data part includes complemental data configured to be combined with the first data part to reproduce the target media content. A corresponding apparatus and computer program product are also disclosed. 1. A method for managing media content , the method comprising;storing a first data part relating to target media content in a storage medium, the first data part being degraded media content having reduced quality compared to the target media content; andstoring a second data part relating to the target media content, the second data part being complemental data configured to be combined with the first data part to reproduce the target media content.2. The method of claim 1 , wherein storing the first data part comprises storing at least two first data parts relating to a set of at least two target media contents in the storage medium claim 1 , and storing the second data part comprising storing at least one second data part relating to a subset of the set of at least two target media contents.3. The method of claim 2 , further comprising:exporting the storage medium storing the at least two first data parts; andoutputting the at least one second data part.4. The method of claim 3 , wherein the storage medium is a tape medium and outputting comprises one of:saving the at least one second data part into a removable medium; andtransmitting the at least one second data part through a network.5. The method of claim 3 , wherein outputting the at least one second data part comprises:outputting at least two second data parts relating to the set of at least two target media contents.6. The method of claim 3 , wherein the target media content ...

Подробнее
Номер записи: 48
29-05-2014 дата публикации

METHOD FOR DISPLAYING OPERATION STATES OF MODULES INCLUDED IN COMPUTER SYSTEM

Номер: US20140149899A1
Автор: ARAKI Hiroshi, HASEGAWA Tohru
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method for obtaining and displaying operation states of a plurality of modules of a system. The operation state of one module that is carrying out a current function is acquired along with the operation states of a module set that is being used by the one module in carrying out its current function, wherein the module set may itself include a plurality of individual modules. Thereby, the latest operation states of the one module and its module set are acquired without inquiring of the operating state of each individual module that makes up the one module and its module set. Thus, the latest operation states of the individual modules included in the system can be displayed without imposing extra loads on the modules, i.e., without imposing extra negative influence on the current function being carried out, and/or on essential operations of the system. 1. A computer implemented method comprising:acquiring an operating state by a computer of a first one of a plurality of modules;acquiring operating states by said computer of a first module set comprising at least one module that is being used by said first one of said plurality of modules to carry out a function being performed by said first one of said plurality of modules; anddisplaying a graphical user interface (GUI) comprising computer system operation states comprising said operating state of said first one of said plurality of modules and said operating states of said first module set.2. The method of wherein said first module set dynamically changes based on a change in said function being performed by said first one of said plurality of modules.3. The method of wherein said acquiring said operating state by said computer of said first module set does not impose an extra load on said function being performed by said first one of said plurality of modules.4. The method of wherein said operating states of said first one of said plurality of modules and said first module set are acquired without inquiring of ...

Подробнее
Номер записи: 49
17-03-2016 дата публикации

STORING META-INFORMATION ON TAPE RECORDING SYSTEMS

Номер: US20160077757A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue, YAMAMOTO NORIKO
Принадлежит:

A capability to store meta-information related to file access histories on tape recording systems is provided. Base meta-information is stored on a tape. The base meta-information is meta-information that is associated with one or more files that are stored on the tape and is based, at least in part, on a tape access operation history. A first quantity of differentiated meta-information is stored on the tape at a predetermined time interval after storing the base meta-information, wherein the first quantity of differentiated meta-information is based, at least in part, on the tape access operation history and reflects a history of at least one file of the one or more files that are associated with the base meta-information. 1. A method for storing meta-information related to file access histories on tape recording systems , the method comprising:storing base meta-information on a tape, wherein the base meta-information is meta-information that is associated with one or more files that are stored on the tape and is based, at least in part, on a tape access operation history; andstoring a first quantity of differentiated meta-information on the tape at a predetermined time interval after storing the base meta-information, wherein the first quantity of differentiated meta-information is based, at least in part, on the tape access operation history and reflects a history of at least one file of the one or more files that are associated with the base meta-information.2. The method of claim 1 , wherein:the tape includes (i) a data partition for, at least in part, storing file data and (ii) an index partition for storing meta-information;storing the base meta-information to the tape includes appending the base meta-information to the data partition; andstoring the first quantity of differentiated meta-information includes appending the first quantity of differentiated meta-information to the data partition.3. The method of claim 2 , further comprising:updating the base ...

Подробнее
Номер записи: 50
15-03-2018 дата публикации

WRITING DATA SPANNING PLURALITY OF TAPE CARTRIDGES

Номер: US20180074720A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A method includes, in a tape apparatus system, receiving a request to write a file from a host, and, in response to the request, dividing sequentially received data of the file into two or more segments. Each of the two or more segments have a predetermined size. The method further includes sequentially writing a series of the two or more segments onto one or more tapes, and determining the predetermined size based on a capacity use efficiency of a plurality of other tapes and a time to copy when a spanning file, written by spanning on the one or more tapes, is copied to the plurality of other tapes. A corresponding computer program product and computer system are also disclosed. 1. A method comprising:receiving a request to write a file from a host;in response to the request, dividing sequentially received data of the file into two or more segments, each of the two or more segments having a predetermined size;sequentially writing a series of the two or more segments onto one or more tapes;determining the predetermined size based on a capacity use efficiency of a plurality of other tapes and a time to copy when a spanning file written by spanning on the one or more tapes is copied to the plurality of other tapes;sequentially reading the spanning file written on a plurality of copy-source tapes in units of copy-source segments to yield read data;sequentially writing the read data onto a plurality of copy-destination tapes in units of segments; andrewriting the data of the copy-source segments onto a second tape of the plurality of copy-destination tapes, in a case where a free space up to an end of a storage capacity region of a first tape of the plurality of copy-destination tapes is smaller than the predetermined size of each segment.2. The method of claim 1 , wherein determining the predetermined size is based on an amount of free space on the one or more tapes.3. The method of claim 1 , wherein determining the predetermined size comprises determining the time to ...

Подробнее
Номер записи: 51
15-03-2018 дата публикации

MANAGEMENT OF OBJECT LOCATION IN HIERARCHICAL STORAGE

Номер: US20180074747A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

There is disclosed a method performed by a computer system for managing a location of an object in a hierarchical storage that includes a plurality of storage layers. In the method, the computer system receives a selection of one storage layer for storing a selected object from among the plurality of the storage layers via a network connected to the computer system. The computer system also moves the selected object to the one storage layer from other storage layer currently that stores the selected object among the plurality of the storage layers. The computer system further excludes the selected object from targets of a predetermined space management that is being applied to objects in the hierarchical storage. 1. A method performed by a computer system for managing a location of an object in a hierarchical storage , the hierarchical storage including a plurality of storage layers , the method comprising:receiving a selection of one storage layer for storing a selected object from among the plurality of the storage layers via a network connected to the computer system;moving the selected object to the one storage layer from other storage layer currently storing the selected object among the plurality of the storage layers; andexcluding the selected object from targets of a predetermined space management applied to objects in the hierarchical storage.2. The method of claim 1 , wherein the excluding comprises:setting a specific value in an extended attribute of the selected object, the specific value indicating that the selected object is excluded from the targets of the predetermined space management by a user.3. The method of claim 2 , wherein the predetermined space management includes automatic migration and recall activities of objects among the plurality of the storage layers based on a predetermined policy claim 2 , the predetermined policy including a condition for the specific value in the extended attribute of each object.4. The method of claim 1 , wherein ...

Подробнее
Номер записи: 52
15-03-2018 дата публикации

Worm data falsification detection

Номер: US20180075027A1
Автор: Atsushi Abe, Tohru Hasegawa
Принадлежит: International Business Machines Corp

A computer determines the file system that contains a first partition, a second partition and a third partition. The first partition contains metadata comprising metadata associated with a WORM-specified file, and metadata associated with a rewritable file. The second partition contains a file body of a file and a copy of the metadata. The third partition contains metadata associated with the WORM-specified file. The computer receives a request to set a file setting of a target file to a WORM setting. The computer stores metadata associated with the target file in the first partition, the second partition, and the third partition.

Подробнее
Номер записи: 53
15-03-2018 дата публикации

REDUCING READ OPERATIONS AND BRANCHES IN FILE SYSTEM POLICY CHECKS

Номер: US20180075043A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A method to identify data elements conforming to a policy includes receiving a request to identify data elements in an input set of data elements that conform to one or more requested policies. According to the method, policy output information describing data elements that conform to a requested policy are saved in association with the requested policy. In response to receiving a subsequent request to identify data elements in a subsequent set of data elements that conform to the requested policy, the method includes outputting the saved policy output information based on the policy output information having been saved in association with the requested policy. A computer program product and a system, configured with processors and a memory that can store saved policy information, can implement the method. 1. A computer-implemented method for identifying a set of data elements conforming to a policy , the method comprising:receiving, by at least one processor, a first request to determine a set of data elements, included in a first input set of data elements, that conform to at least one input policy;identifying, by the at least one processor, in response to the first request, a first subset of data elements, included in the first input set of data elements, that conform to a requested policy, wherein the requested policy is included in the at least one input policy;saving, by the at least one processor, in association with the requested policy, first policy output information descriptive of data elements included in the first subset of data elements;receiving, by the at least one processor, a subsequent request to determine a subsequent set of data elements, included in a first input set of data elements, that conform to the requested policy; andoutputting, by the at least one processor, in response to the subsequent request and based, at least in part, on the first policy output information saved in association with the requested policy, the first policy output ...

Подробнее
Номер записи: 54
07-03-2019 дата публикации

Moving cartridges within a shuttle complex

Номер: US20190074033A1
Автор: Tohru Hasegawa, Yuhko HASEGAWA
Принадлежит: International Business Machines Corp

The present description is directed to moving a cartridge including a storage medium within a shuttle complex that includes numerous shuttle connections, and a plurality of library strings connected by at least one shuttle connection. Each shuttle connection has a car able to move within the shuttle connection and each library string has at least one cartridge including a storage medium. The shuttle complex identifies a library string that contains the access-cartridge (LSAC), identifies whether there is a drive within the LSAC that has a second cartridge mounted therein which comprises only inactive data chunks, removes the second cartridge from the drive within the LSAC if an elapsed time since the drive within the LSAC most recently accessed the second cartridge exceeds a predetermined time period threshold, and mounts the access-cartridge to the drive within the LSAC.

Подробнее
Номер записи: 55
17-03-2016 дата публикации

SYSTEM FOR MONITORING ACCESS TO NETWORK WITHIN SECURED SITE

Номер: US20160080391A1
Автор: HASEGAWA Tohru, Motoki Toshiyasu, OISHI Yutaka, Takayama Masao
Принадлежит:

A controller is provided which monitors/manages information terminals' access to a network within a secured site. A controller of the present invention includes: a storage device for storing security information about at least one or more information terminals received from the information terminals before accessing a network; and a processor for determining whether to permit access of an information terminal to the network based on the security information read from the storage device and access permission criteria on the security information, and generating a control signal for permitting or blocking the access of the information terminal to the network according to the determination result. 1. A controller for monitoring access of an information terminal to a network within a secured site , comprising:a storage device for storing security information regarding at least one information terminal received from the at least one information terminal before accessing the network; anda processor for determining whether to permit access of the at least one information terminal to the network based on the security information read from the storage device and access permission criteria in the security information, and for generating a control signal for permitting or blocking the access of the information terminal to the network according to a determination result.2. The controller according to claim 1 , wherein the controller receives claim 1 , through an RFID reader claim 1 , the security information stored in an RFID tag included in the information terminal.3. The controller according to claim 1 , wherein the security information includes information on types and versions of software that run on the information terminal.4. The controller according to claim 3 , wherein when predetermined software that runs on the information terminal is not of a predetermined version or higher claim 3 , the processor generates a control signal for blocking access of the information ...

Подробнее
Номер записи: 56
22-03-2018 дата публикации

ADAPTIVE SUCCESSIVE WARNING MESSAGE HANDLING

Номер: US20180081700A1
Автор: HASEGAWA Tohru, Hasegawa Yuhko
Принадлежит:

A computer receives a plurality of warning messages. The computer determines that a first warning message of the plurality of warning messages was not previously displayed based on determining the first warning message does not match a warning message contained in a previous warning message list. The computer displays the first warning message without an active User Interface (UI) object based on determining that the first warning message was not previously displayed. The computer presents an active UI object after a delay time. 1. A method for warning message handling , the method comprising:receiving a plurality of warning messages;determining that a first warning message of the plurality of warning messages was not previously displayed based on determining the first warning message does not match a warning message contained in a previous warning message list;displaying the first warning message without an active User Interface (UI) object based on determining that the first warning message was not previously displayed; andpresenting an active UI object after a delay time.2. The method of claim 1 , further comprising updating the previously displayed warning message list.3. The method of claim 2 , further comprising based on determining that the first warning message was not previously displayed claim 2 , adding the first warning message to the previous warning message list wherein first warning message comprises a list consisting of date claim 2 , time claim 2 , and content of the first warning message.4. The method of claim 2 , wherein updating the previously displayed warning message list further comprises:determining a second warning message was displayed beyond a predetermined timeframe in a past; andremoving the second warning message from the previously displayed warning message list.5. The method of claim 1 , wherein presenting an active UI object after a delay time further comprises:displaying the first warning message;calculating a delay based on a size ...

Подробнее
Номер записи: 57
23-03-2017 дата публикации

RECLAIMING OF SEQUENTIAL STORAGE MEDIUM

Номер: US20170083437A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

Software for reclaiming a sequential storage medium that includes: copying all active data blocks in a first part of sequentially written data on a first sequential storage medium, to a second sequential storage medium, the first part extending from a first intermediate position to an end of the sequentially written data; and defining all data blocks in a second part of the sequentially written data on the first sequential storage medium, to be a new sequentially written data, the second part extending from a beginning to a second intermediate position of the sequentially written data, and excluding the active data blocks copied to the second sequential storage medium. 1. A computer-implemented method for reclaiming a sequential storage medium , the method comprising:copying all active data blocks in a first part of sequentially written data on a first sequential storage medium, to a second sequential storage medium, the first part extending from a first intermediate position to an end of the sequentially written data; anddefining all data blocks in a second part of the sequentially written data on the first sequential storage medium, to be a new sequentially written data, the second part extending from a beginning to a second intermediate position of the sequentially written data, and excluding the active data blocks copied to the second sequential storage medium.2. The method of claim 1 , further comprising changing storage location information of the active data blocks from indicating the first sequential storage medium to indicating the second sequential storage medium.3. The method of claim 2 , further comprising:storing a data block in a high-speed storage medium accessible at a speed higher than the sequential storage medium;migrating the data block to the first sequential storage medium under a predetermined condition; andplacing, in the high-speed storage medium, the storage location information of the data block, the storage location information indicating ...

Подробнее
Номер записи: 58
23-03-2017 дата публикации

SECURING RECORDED DATA

Номер: US20170083712A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue, YAMAMOTO NORIKO
Принадлежит:

A method, executed by a computer, for recording data includes splitting a file into sequential extents, reordering the sequential extents into non-sequential extents, writing the non-sequential extents to a storage medium, writing dummy data to the storage medium, and writing extent placement information corresponding to a placement for the non-sequential extents to the storage medium. A computer program product and computer system corresponding to the above method are also disclosed herein. 1. A computer-implemented method for recording data , the method comprising:splitting a file into a plurality of sequential extents;reordering the plurality of sequential extents into a plurality of non-sequential extents;writing the plurality of non-sequential extents to a storage medium; andwriting extent placement information corresponding to a placement for the plurality of non-sequential extents to the storage medium.2. The method of claim 1 , further comprising writing dummy data in between the non-sequential extents.3. The method of claim 1 , wherein reordering the plurality of sequential extents into a plurality of non-sequential extents comprises reordering using an order determined by a pseudo-random number generator.4. The method of claim 1 , wherein the extent placement information is recorded in an index corresponding to the file.5. The method of claim 4 , wherein the index contains a file expiration time corresponding to the file; and further comprising automatically deleting the file when the index is read at a time that is after the file expiration time.6. The method of claim 2 , wherein the dummy data is generated by using a pseudo-random number generator.7. The method of claim 1 , wherein the file is stored in a Linear Tape File System format.8. A computer system for recording data claim 1 , the computer system comprising:one or more computer processors;one or more computer readable storage media;program instructions stored therein for execution by at least one ...

Подробнее
Номер записи: 59
12-06-2014 дата публикации

METHOD OF WRITING A FILE TO A PLURALITY OF MEDIA AND A STORAGE SYSTEM THEREOF

Номер: US20140164693A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MIYAMURA TSUYOSHI, Watanabe Terue
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

According to one embodiment, a method for writing a file to a plurality of media includes loading a parent medium into a first drive to retrieve ID information about the parent medium from metadata, writing a first file part to the parent medium and, at about a same time, saving a file name, attribute information, and attribute information about the first file part to the parent medium as metadata, loading a child medium into a second drive in order to write subsequent file parts and retrieving ID information about the child medium from metadata, writing the subsequent file parts to the child medium and, at about a same time, saving the ID information and attribute information about the subsequent file parts to the parent medium, and additionally saving the ID information about the child medium and the attribute information about the subsequent file parts as metadata in the child medium. 1. A method for writing a file to a plurality of media in a storage system that comprises at least two drives , the plurality of media being identified as a parent medium and at least one child medium , the method comprising:loading the parent medium into a first drive to retrieve identification (ID) information about the parent medium from metadata stored thereon;writing a first file part of a file to the parent medium and at about a same time, saving a file name, attribute information about the file, and attribute information about the first file part to the parent medium as metadata;keeping the parent medium loaded in the first drive until all subsequent file parts of the file are completely written to the at least one child medium;loading a child medium into a second drive in order to write one or more subsequent file parts of the file and retrieving ID information about the child medium from metadata stored thereon;writing the one or more subsequent file parts to the child medium and, at about a same time, saving the ID information and attribute information about the one or ...

Подробнее
Номер записи: 60
30-03-2017 дата публикации

WRITING DATA TO SEQUENTIAL STORAGE MEDIUM

Номер: US20170090761A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A computer-implemented method for writing data to a sequential storage medium, includes: writing plural data blocks sequentially to the sequential storage medium; and writing a data pattern to an area on the sequential storage medium, the area being an area to which none of the plural data blocks is written, the data pattern including plural bit patterns appearing in none of the plural data blocks, and thus representing that none of the plural data blocks is written to the area and representing specific information regarding the sequential storage medium. 1. A method for writing data to a sequential storage medium , the method comprising:writing a plurality of data blocks sequentially to the sequential storage medium; andwriting a data pattern to an area on the sequential storage medium, the area being an area to which none of the plurality of data blocks is written, the data pattern including a plurality of bit patterns appearing in none of the plurality of data blocks, and none of the plurality of data blocks are written to the area and the data pattern represents specific information regarding the sequential storage medium.2. The method of claim 1 , wherein the specific information comprises tape directory information indicating correspondence between physical positions on the sequential storage medium and logical data units written to the physical positions claim 1 , any one of the plurality of data blocks comprises one of the logical data units.3. The method of claim 1 , wherein the area is an area accessible prior to accessing any of the plurality of data blocks claim 1 , after the sequential storage medium has been threaded.4. The method of claim 1 , wherein the specific information includes write condition information indicating a write condition in writing a first data block out of the plurality of data blocks to the sequential storage medium.5. The method of claim 4 , wherein the area is an area to be accessed after accessing the first data block and ...

Подробнее
Номер записи: 61
26-06-2014 дата публикации

METHOD FOR DIVISIONALLY MANAGING FILES ON A USER BASIS, AND A STORAGE SYSTEM AND COMPUTER PROGRAM PRODUCT THEREOF

Номер: US20140181425A1
Автор: Ashida Takashi, HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

According to one embodiment, a method for a plurality of users to write at least one file to a medium in such a manner that the file is divisionally managed in a system environment in which an input/output control is performed on a storage system includes saving, in the medium as metadata, a user identifier (ID) for identifying a user and file attribute information about the file managed by a user associated with the user ID, and writing, as data, the file managed by the user to the medium as indicated by the file attribute information. In other embodiments, a writing program product, a reading program product, and a system are presented that allow a plurality of users to write at least one file to a medium in such a manner that the file is divisionally managed in a system environment. 1. A method for a plurality of users to write at least one file to a medium in such a manner that the file is divisionally managed in a system environment in which an input/output control is performed on a storage system , the method comprising:saving, in the medium as metadata, a user identifier (ID) for identifying a user and file attribute information about the file managed by a user associated with the user ID; andwriting, as data, the file managed by the user to the medium as indicated by the file attribute information.2. The method as recited in claim 1 , wherein the medium is divided into two or more partitions so as to enable reading and writing by a file system for a tape drive claim 1 , wherein the partitions include an index partition in which the metadata is stored and a data partition in which data of the file is stored claim 1 , wherein the metadata saved in the index partition includes the user ID for identifying the user and the file attribute information associated with the user ID claim 1 , and wherein the file attribute information includes a file name claim 1 , a data location in the medium claim 1 , and a size of the file.3. The method as recited in claim 2 , ...

Подробнее
Номер записи: 62
12-04-2018 дата публикации

Provision of Information About Fragmentation of File on Sequential Access Medium

Номер: US20180101309A1
Автор: Hiroshi Itagaki, Noriko Yamamoto, Shinsuke Mitsuma, Sokuke Matsui, Tohru Hasegawa, Tsuyoshi Miyamura
Принадлежит: International Business Machines Corp

A mechanism is provided for providing information about fragmentation of a file on a sequential access medium by a computer system is disclosed. An actual time for reading the file recorded on the sequential access medium is estimated based on a physical position of the file. A total length of the file on the sequential access medium is calculated based on a physical length of each data piece constituting the file. An expected time for reading the file by assuming that the file is rewritten continuously is estimated based on the total length of the file. Information about the fragmentation of the file is then provided based on the actual time and the expected time.

Подробнее
Номер записи: 63
12-04-2018 дата публикации

REDUCING READ OPERATIONS AND BRANCHES IN FILE SYSTEM POLICY CHECKS

Номер: US20180101539A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A method to identify data elements conforming to a policy includes receiving a request to identify data elements in an input set of data elements that conform to one or more requested policies. According to the method, policy output information describing data elements that conform to a requested policy are saved in association with the requested policy. In response to receiving a subsequent request to identify data elements in a subsequent set of data elements that conform to the requested policy, the method includes outputting the saved policy output information based on the policy output information having been saved in association with the requested policy. A computer program product and a system, configured with processors and a memory that can store saved policy information, can implement the method. 1receiving, by at least one processor, a first request to determine a set of data elements, included in a first input set of data elements, that conform to at least one input policy, wherein each of the data elements comprise a file component included in a file system;identifying, by the at least one processor, in response to the first request, a first subset of data elements, included in the first input set of data elements, that conform to a requested policy, wherein the requested policy is included in the at least one input policy;saving, by the at least one processor, in association with the requested policy, first policy output information descriptive of information nodes (i-nodes) associated with data elements included in the first subset of data elements;including, by the at least one processor, the requested policy in a saved policy set, wherein the at least one processor including the requested policy in the saved policy set is based, at least in part, on the requested policy being not previously included in the saved policy set and a setting configured to include the requested policy in the saved policy set until 2 consecutive requests are received that ...

Подробнее
Номер записи: 64
13-04-2017 дата публикации

Data deduplication using a small hash table

Номер: US20170103068A1
Автор: Hiroshi Araki, Tohru Hasegawa
Принадлежит: International Business Machines Corp

Embodiments of the present invention provide methods, systems, and computer program products for data deduplication. In one embodiment, for a data chunk, it is determined whether a hash value of the data chunk generated by a first hash function is present in a hash table. Once a threshold size of the hash table is reached, it is determined whether there is free space in a write data area, identified by a second hash function. When there is no free space in the write data area, a post-deduplication process is performed for each data chunk in the write data area. Once free space is cleared in the write data area, the data chunk is written to the write data area identified by the second hash function.

Подробнее
Номер записи: 65
02-06-2022 дата публикации

COPYING DATA FROM A LINEAR TAPE FILE SYSTEM (LTFS)-BASED STORAGE SYSTEM TO A RANDOM ACCESS NONVOLATILE MEMORY (RANVM) DRIVE IN UNITS OF BLOCKS OF THE DRIVE

Номер: US20220171531A1
Автор: Abe Atsushi, HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A computer-implemented method according to one approach includes copying data stored on a Linear Tape File System (LTFS)-based storage system to blocks of a Random Access Nonvolatile Memory (RANVM) drive. The data is copied in units of the blocks of the drive. The method further includes constructing file metadata so that the copied data on the drive is accessible as one or more files. A computer program product according to another approach includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a controller to cause the controller to perform the foregoing method. A system according to another approach includes a processor, and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to perform the foregoing method. 1. A computer-implemented method , comprising:copying data stored on a Linear Tape File System (LTFS)-based storage system to blocks of a Random Access Nonvolatile Memory (RANVM) drive, wherein the data is copied in units of the blocks of the drive; andconstructing file metadata so that the copied data on the drive is accessible as one or more files.2. The computer-implemented method of claim 1 , wherein the data is stored on the LTFS-based storage system in blocks claim 1 , wherein a size of each of the blocks in LTFS is an integer multiple of a size of one of the blocks of the drive claim 1 , wherein the blocks are of a file system of the drive claim 1 , wherein the file system of the drive is a destination for the data copied from the LTFS-based storage system.3. The computer-implemented method of claim 1 , wherein the data copied to the blocks of the drive includes all data stored between a first end of a magnetic recording tape of the LTFS-based storage system and a second end of the magnetic recording tape claim 1 , wherein no data seek operations are performed on the ...

Подробнее
Номер записи: 66
20-04-2017 дата публикации

File Management in a Storage System

Номер: US20170109364A1
Автор: HASEGAWA Tohru, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

In an approach to determining a storage to which to store a file in a storage system including at least one server and at least two storages which can communicate with the at least one server through a communication network, a computer obtains a file name of a file to be stored in a storage. The computer determines an effect of deduplication of data of the file based on the file name, and responsive to determining the effect of deduplication exists, selects a part of the file name. The computer then calculates a hash value using the part of the file name and determines a storage to which to store the file based on the hash value. 1. A method for determining a storage to which to store a file in a storage system , the storage system including at least one server and at least two storages which can communicate with the at least one server through a communication network comprising the steps of:obtaining, by one or more computer processors, a file name of a file to be stored in a storage;determining, by one or more computer processors, an effect of deduplication of data of the file based on the file name;responsive to determining the effect of deduplication exists, selecting, by one or more computer processors, a part of the file name;calculating, by one or more computer processors, a hash value using the part of the file name; anddetermining, by one or more computer processors, a storage to which to store the file based on the hash value.2. The method according to claim 1 , wherein the step of determining an effect of deduplication includes comparing claim 1 , by one or more computer processors claim 1 , the file name to information of a plurality of file names registered in a filter claim 1 , the information of the file names having a high possibility that duplication of data may take place.3. The method according to claim 2 , wherein the information of the file names includes an extension of a file claim 2 , one or more first several characters of a file name claim ...

Подробнее
Номер записи: 67
28-04-2016 дата публикации

STORAGE MANAGEMENT METHOD, STORAGE MANAGEMENT SYSTEM, COMPUTER SYSTEM, AND PROGRAM

Номер: US20160117259A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A storage management method and the like for managing a hierarchical storage are provided. A storage management method is provided for managing a hierarchical storage including a lower storage tier, and a higher storage tier having higher speed than the lower storage tier, on a computer system including at least one computer. This storage management method includes a step of causing the computer system to copy a target data item from the higher storage tier to the lower storage tier, and a step of causing the system to determine whether or not to delete the entity of the data item on the higher storage tier having been subjected to the copying based on a time required for reading the copy of the data item. 1. A storage management method for managing a hierarchical storage including a lower storage tier , and a higher storage tier having higher speed than the lower storage tier , on a computer system including at least one computer , the method comprising the steps , executed by the computer system , of:copying a target data item from the higher storage tier to the lower storage tier; anddetermining whether or not to delete an entity of the data item on the higher storage tier having been subjected to the copying, based on a time required for reading a copy of the data item.2. The storage management method according to claim 1 , wherein the lower storage tier includes at least one tape medium claim 1 , and the step of determining based on the required time is a step of determining whether or not to delete the entity of the data item having been subjected to the copying claim 1 , based on the time required for reading the copy of the data item according to a storage position on the tape medium as a copy destination on the lower storage tier.3. The storage management method according to claim 2 , further comprising a step of deleting the entity of the data item having been subjected to the copying and being determined to be deleted from the higher storage tier claim 2 ...

Подробнее
Номер записи: 68
05-05-2016 дата публикации

METHOD OF MOVING FILES IN HIERARCHICAL STORAGE SYSTEM

Номер: US20160124678A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A method for moving files in a hierarchical storage system having a primary storage and a secondary storage including a sequential storage device from the primary storage to the secondary storage includes obtaining a predetermined file size to be written to the secondary storage, extracting, from a plurality of files in the primary storage, a file not stored in the secondary storage and having the oldest last access time, estimating a file size of the file having the oldest last access time on the secondary storage if the file having the oldest last access time is written to the secondary storage, and selecting the file having the oldest last access time as a file to be moved to the secondary storage as long as the estimated file size does not exceed the predetermined file size to be written to the secondary storage. 1. A method for moving files in a hierarchical storage system having a primary storage and a secondary storage including a sequential storage device from the primary storage to the secondary storage , the method comprising the steps of:obtaining a predetermined file size to be written to the secondary storage;extracting, from a plurality of files in the primary storage, a file not stored in the secondary storage and having an oldest last access time;estimating a file size of the file having the oldest last access time on the secondary storage if the file having the oldest last access time is written to the secondary storage; andselecting the file having the oldest last access time as a file to be moved to the secondary storage as long as the estimated file size does not exceed the predetermined file size to be written to the secondary storage.2. The method according to claim 1 , further comprising the step of:repeating the extracting step to the selecting step until the predetermined file size is exceeded.3. The method according to claim 2 , further comprising the steps of:moving files selected as files to be moved to the secondary storage to the ...

Подробнее
Номер записи: 69
07-05-2015 дата публикации

Support for WORM Cartridges Realized by Linear Tape File System (LTFS)

Номер: US20150127616A1
Автор: HASEGAWA Tohru, Nagura Hironobu, Ozeki Kazuhiro
Принадлежит:

When a WORM cartridge is formatted for Tape File System (LTFS) in advance, such as prior to shipment, Linear Tape File System Library Edition (LTFS LE) is expanded by software to reduce consumption of the index partition and to support elimination of the appending of unnecessary data. More specifically, instead of recording metadata in the index partition during normal unmounting, the metadata is recorded in separate local storage such as on hard disk drive (HDD), and the index partition is updated only when the cartridge is ejected from the library. In this way, the present invention is able to significantly reduce the frequency of index partition updates. Because an update occurs only when the user intentionally ejects a cartridge, overflow of the index partition before overflow of the data partition can be prevented. 1. A method for eliminating the appending of unnecessary data created when a tape cartridge mounted in a tape drive used in a file system is accessed (to reduce consumption of capacity in a WORM index partition) , the method comprising the steps of:(a) preparing a tape cartridge by dividing the built-in tape into two WORM partitions, recording the history of a plurality of files and metadata (including the allocation of one or more recorded files) in the one WORM data partition, and metadata in the other WORM index partition;(b) reading metadata recorded in a WORM index partition in response to an access request for a file in a tape cartridge mounted in a tape drive;(c) writing the read metadata to an index area in local storage;(d) using the metadata written to the index area to respond to the access request for the file (without using the metadata recorded in the WORM index partition);(e) determining whether or not an access request to metadata written to the index area is accompanied by an update of the metadata; and(f) writing metadata written to the index area to the WORM index partition when it has been determined that the access request is ...

Подробнее
Номер записи: 70
25-08-2022 дата публикации

DYNAMIC TAPE STORAGE DEVICE DATA BUFFER

Номер: US20220269408A1
Автор: Abe Atsushi, HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

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. 1. A computer-implemented method for altering a position on a tape at which the tape transitions to a DATA_FULL state , comprising:determining, after a file is written to the Data Partition of the tape, a size of an Index representing metadata associated with the file; andaltering, 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.2. The computer-implemented method of claim 1 , wherein the DATA_FULL state is a state of the tape in which only metadata write operations are permitted.3. The computer-implemented method of claim 2 , wherein the DATA_FULL state occurs in response to a tape head reaching an end of a programmable early warning zone (PEWZ) in the Data Partition of the tape during a file operation.4. The computer-implemented method of claim 1 , wherein altering the position on the tape at which the tape transitions to the DATA_FULL state further includes altering a position of a PEWZ in the Data Partition of the tape.5. The computer-implemented method of claim 4 , wherein altering the position on the tape at which the tape transitions to the DATA_FULL state further includes altering a size of a buffer positioned subsequent to the PEWZ in the Data Partition of the tape claim 4 , wherein only metadata write operations are permitted in the buffer.61. The computer-implemented method of claim 4 , ...

Подробнее
Номер записи: 71
04-05-2017 дата публикации

METHOD OF MANAGING, WRITING, AND READING FILE ON TAPE

Номер: US20170125061A1
Автор: Ashida Takashi, HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue
Принадлежит:

Managing a file on a tape. In response to a request to write a first file to a tape, whether a second file including data identical to the first file already exists on the tape is detected. If the second file exists, a first index of the second file is updated. After completing the write of the first file, metadata, including data starting position and size of the first file, is added to the first index. In response to a request to read the first or second files, the metadata of the first and second indexes are read. Based on the metadata, which of the first or second files can be accessed faster from a current head position is determined. The first file or the second file that can be accessed faster is then read from the tape. 1. A file system including a tape drive , comprising:means for, when a file is to be written onto the tape, detecting, using software which has a detection function for duplicate data, whether another file including data identical to data of the file already exists on the tape;means for, when the other file exists on the tape, updating a first index of the other file;means for, after the file is written, adding meta-information including a data starting position and a size of the written file on the tape to the first index and writing in an index partition;means for creating or updating a second index including meta-information including a data starting position and a size of the written file on the tape; andmeans for writing the created or updated second index in an index partition on the tape.2. The file system according to claim 1 , further comprising:means for, writing the file onto the tape before the detecting.3. The file system according to claim 1 , further comprising:means for, when the file or the other file on the tape is to be read, acquiring the meta-information of the first index and the second index from an index partition on the tape;means for determining which of the file and the other file can be read faster based on the ...

Подробнее
Номер записи: 72
25-08-2022 дата публикации

Generating search results utilizing access control

Номер: US20220269683A1
Автор: Takahito Tashiro, Tohru Hasegawa
Принадлежит: International Business Machines Corp

Aspects of the present invention disclose a method, computer program product, and system for generating search results based on access control of a requesting user. The method includes one or more processors receiving a search query from a user. The method further includes generating a first candidate list of search results based on the received search query. The method further includes generating a second candidate list of search results based on the received search query. Generating the second candidate list of search results includes filtering out potential search results based on indexed access privilege data. The method further includes determining a subset of search result entries in the first candidate list by analyzing a defined number of search result entries in the first candidate list. Analyzing the defined number of search result entries includes attempting to access entries of the defined number utilizing access credentials of the user.

Подробнее
Номер записи: 73
27-05-2021 дата публикации

POSITIVE/NEGATIVE FACET IDENTIFICATION IN SIMILAR DOCUMENTS TO SEARCH CONTEXT

Номер: US20210157856A1
Автор: HASEGAWA Tohru, ISHIKAWA SHUNSUKE, KAJINAGA Yasumasa, Komedani Masaki, Nitta Keisuke, TSUZUKU Daiki
Принадлежит:

Facet-based search processing is provided which includes receiving a query search context for querying documents of a document set, and retrieving, by similar document search processing, a document subset from the document set. The document subset includes documents of the set most similar to a search document of the query search context. Facet analysis processing is used to generate M candidate facets most-related to the query search context, and facets of the M candidate facets associated with documents of the subset are identified, and classified into a positive facet set and a negative facet set based, at least in part, on extent of facet commonality across the documents. A listing is of the documents in the document subset is provided, with the listing highlighting facets of the positive facet set. 1. A computer-implemented method comprising:receiving a query search context for querying documents of a document set;retrieving, by similar document search processing, a document subset of the document set, the document subset comprising documents of the document set most similar to a search document of the query search context;generating, via facet analysis processing, M candidate facets most-related to the query search context;identifying facets of the M candidate facets associated with the documents of the document subset;classifying identified facets associated with the documents of the document subset into a positive facet set and a negative facet set based, at least in part, on extent of facet commonality across the documents of the document subset; andproviding, at least in part, a listing of the documents of the document subset, the listing highlighting facets of the positive facet set in the documents of the document subset.2. The computer-implemented method of claim 1 , wherein the providing further comprises providing claim 1 , at least in part claim 1 , the listing of the documents of the document subset with facets of the negative facet set in the ...

Подробнее
Номер записи: 74
12-05-2016 дата публикации

Average Response Time Improvement From a File System for a Tape Library

Номер: US20160132255A1
Автор: HASEGAWA Tohru, Hasegawa Yuhko
Принадлежит:

A mechanism is provided for improving the average response time of a tape library. Prior to receiving a next access request for data from one of a set of tape mediums, a determination is made as to whether a number of tape drives that are unoccupied is less than a predetermined minimum open tape drive threshold (N). Responsive to the number of tape drives that are unoccupied being less than the predetermined minimum open tape drive threshold (N), a least recently used idle tape medium is unmounted and unloaded from an associated tape drive. 1. A method , in a data processing system , for improving the average response time of a tape library , the method comprising:prior to receiving a next access request for data from one of a set of tape mediums, determining whether a number of tape drives that are unoccupied is less than a predetermined minimum open tape drive threshold (N);responsive to the number of tape drives that are unoccupied being less than the predetermined minimum open tape drive threshold (N) and no tape medium being idle, waiting for a tape medium to become idle; andresponsive to the tape medium becoming idle, unmounting and unloading a least recently used idle tape medium from its associated tape drive.3. (canceled)4. The method of claim 1 , further comprising:responsive to receiving the next access request for data from a tape medium in the set of tape mediums, determining whether a tape medium identified with the next access request is already mounted in one of the set of tape drives; andresponsive to the tape medium identified with the next access request already being mounted in one of the set of tape drives, performing the next access request.5. The method of claim 4 , further comprising:responsive to the tape medium identified with the next access request failing to already be mounted in one of the set of tape drives, determining whether there is an unoccupied tape drive in the set of tape drives;responsive to determining that there is no ...

Подробнее
Номер записи: 75
21-05-2015 дата публикации

Writing and Reading Data in Tape Media

Номер: US20150138665A1
Автор: HASEGAWA Tohru, OISHI Yutaka
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A mechanism is provided for determining storage device speed based on a ratio of data compression. A bandwidth (B) is identified between a storage device accessing storage medium and a host application requesting access to data on the storage medium. A host side transfer rate is identified, where the host side transfer rate (HSTR) is a rate of data transfer between the host application and the storage device. For each data set in a set of data sets of a record, a ratio of data compression (R) is identified for the data set; a compression considered host side transfer rate (CCHSTR) is determined; and the storage device speed is set to the compression considered host side transfer rate (CCHSTR) for transmitting the data set to the host application. 1. A computer program product comprising a computer readable storage medium having a computer readable program stored therein , wherein the computer readable program , when executed on a computing device , causes the computing device to:identify a bandwidth (B) between a storage device accessing storage medium and a host application requesting access to data on the storage medium;identify a host side transfer rate, wherein the host side transfer rate (HSTR) is a rate of data transferred between the host application and the storage device; and identify a ratio of data compression (R) for the data set;', 'determine a compression considered host side transfer rate (CCHSTR), wherein the compression considered host side transfer rate (CCHSTR) is determined utilizing: CCHSTR=max (B, HSTR/R); and', 'set a storage device speed to the compression considered host side transfer rate (CCHSTR) for transmitting the data set to the host application., 'for each data set in a set of data sets of a record2. (canceled)3. The computer program product of claim 1 , wherein the ratio of data compression (R) for the data set is determined by the computer readable program further causing the computing device to:compare a data length of the data set ...

Подробнее
Номер записи: 76
10-05-2018 дата публикации

Identifying partial update for tape file system

Номер: US20180129667A1
Автор: Atsushi Abe, Hiroshi Itagaki, Tohru Hasegawa
Принадлежит: International Business Machines Corp

A request to open a file from a plurality of files in a storage is received from an application. The storage is made up of an index partition, containing recordings of file system indexes, and a data partition, containing recordings of the indexes and the file system data body. A file descriptor is created with an update flag that references the file. A determination is made that the file is being updated by the application, and the update flag is set to a value representing that the file is being updated. A request to write an index of the file system is received. A determination is made whether a specific file from the plurality of files is being updated. The index is written to the storage with an extended attribute for the specific file indicating that the specific file was being updated at the time the index was written.

Подробнее
Номер записи: 77
11-05-2017 дата публикации

DATA WRITING IN A FILE SYSTEM

Номер: US20170131903A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue, YAMAMOTO NORIKO
Принадлежит:

In an approach for writing data on a tape using a file system, a processor receives a first write request of a first file. A processor obtains data of the first file. A processor writes the data of the first file on a tape. A processor receives a second write request of a second file prior to completion of writing the data of the first file on the tape. A processor adds information about the second file to a first list, wherein the first list includes files waiting to write. Subsequent to writing the data of the first file on the tape, a processor obtains data of the second file based on the first list. A processor writes the data of the second file after the first file on the tape. 1one or more computer processors, one or more computer readable storage media, and program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising:program instructions to receive a first write request of a first file;program instructions to obtain data of the first file; program instructions to write a first portion of the data of the first file in a first wrap of the tape, wherein the first portion of the data of the first file is of a first predetermined length; and', 'program instructions to write information on a write position of the first portion of the data of the first file in a second list, wherein the second list includes information about write interrupts;, 'program instructions to write the data of the first file on a tape, wherein program instructions to write the data of the first file on the tape compriseprogram instructions to receive a second write request of a second file prior to completion of writing the data of the first file on the tape;program instructions to add information about the second file to a first list, wherein the first list includes files waiting to write;subsequent to writing the data of the first file on the tape, program instructions to ...

Подробнее
Номер записи: 78
11-05-2017 дата публикации

DATA WRITING IN A FILE SYSTEM

Номер: US20170131935A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue, YAMAMOTO NORIKO
Принадлежит:

In an approach for writing data on a tape using a file system, a processor receives a first write request of a first file. A processor obtains data of the first file. A processor writes the data of the first file on a tape. A processor receives a second write request of a second file prior to completion of writing the data of the first file on the tape. A processor adds information about the second file to a first list, wherein the first list includes files waiting to write. Subsequent to writing the data of the first file on the tape, a processor obtains data of the second file based on the first list. A processor writes the data of the second file after the first file on the tape. 1. A method for writing data on a tape using a file system , the method comprising:receiving a first write request of a first file;obtaining, by one or more processors, data of the first file;writing, by one or more processors, the data of the first file on a tape;receiving a second write request of a second file prior to completion of writing the data of the first file on the tape;adding, by one or more processors, information about the second file to a first list, wherein the first list includes files waiting to write;subsequent to writing the data of the first file on the tape, obtaining, by one or more processors, data of the second file based on the first list; andwriting, by one or more processors, the data of the second file after the first file on the tape.2. The method of claim 1 , wherein writing the data of the first file on the tape comprises:writing, by one or more processors, a first portion of the data of the first file in a first wrap of the tape, wherein the first portion of the data of the first file is of a first predetermined length; andwriting, by one or more processors, information on a write position of the first portion of the data of the first file in a second list, wherein the second list includes information about write interrupts.3. The method of claim 2 , ...

Подробнее
Номер записи: 79
11-05-2017 дата публикации

MIGRATION OF DATA TO SEQUENTIAL ACCESS MEDIUM

Номер: US20170131940A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A method and system for migrating data in a storage system by a computer system. The storage system includes a first storage and a second storage with a sequential access medium. The computer system selects a plurality of data to migrate from the first storage to the second storage. The computer system then obtains metadata information of each data and orders the plurality of the data based on the metadata information. The order of the data follows an expectation of update of the data. The computer system transfers the plurality of the data to the second storage based on the order of the data. The computer system determines whether data written in a rear region of the sequential access medium is inactive. The computer system overwrites the data determined to be inactive on the sequential access medium by transferred data. 1. A method for migrating data in a storage system by a computer , the storage system including a first storage and a second storage having a sequential access medium , the method comprising:selecting a plurality of data to migrate from the first storage to the second storage;obtaining metadata associated with one or more subsets of data of the plurality of data;ordering the subsets of data based on the obtained metadata, the order of the subsets of data following an expectation of update value;transferring the subsets of data to the second storage based on the order of the subsets of data; andin response to determining the plurality of data written in a rear region of the sequential access medium being inactive, overwriting the data determined as inactive on the sequential access medium by transferred data.2. The method of claim 1 , wherein the subsets of data are ordered such that the order gets lower as the expectation value of the update increases claim 1 , wherein the expectation value of the update of the data is based on metadata information including one or more of: a timestamp claim 1 , a name claim 1 , an extension claim 1 , and data size ...

Подробнее
Номер записи: 80
11-05-2017 дата публикации

MIGRATION OF DATA TO SEQUENTIAL ACCESS MEDIUM

Номер: US20170131941A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A computer program product for migrating data in a computer storage system. Data is selected to migrate from a first storage to the second storage, wherein selected files are in a resident state. Metadata is obtaining and subsets of data are ordered based on the obtained metadata, the order of the subsets of data following an expectation of update value. The subsets of data are transferring to the second storage based on the order of the subsets of data based on a predetermined schedule. Data determined as inactive is overwritten on the sequential access medium by transferred data. End data to the sequential access medium is set after a last active data is written before the one or more sets of data are determined to be inactive. The one or more sets of data determined to be inactive are deleted from the second storage and a transfer is initiated. 1 in response to instructions to determine that the second storage comprises an index partition and a data partition, instructions to select a plurality of data to migrate from the first storage to the second storage, wherein selected files are in a resident state;', 'instructions to obtain metadata associated with one or more subsets of data of the plurality of data;', 'instructions to order the subsets of data based on the obtained metadata, the order of the subsets of data following an expectation of update value;', 'instructions to transfer the subsets of data to the second storage based on the order of the subsets of data based on a predetermined schedule;', 'in response to instructions to determine the plurality of data written in a rear region of the sequential access medium being inactive, instructions to overwrite the data determined as inactive on the sequential access medium by transferred data;', 'in response to instructions to determine that the one or more sets of data written in the rear region are inactive, instructions to set an end data to the sequential access medium after a last active data is written ...

Подробнее
Номер записи: 81
11-05-2017 дата публикации

MIGRATION OF DATA TO SEQUENTIAL ACCESS MEDIUM

Номер: US20170131942A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A computer system for migrating data in a computer storage system. Data is selected to migrate from a first storage to the second storage, wherein selected files are in a resident state. Metadata is obtaining and subsets of data are ordered based on the obtained metadata, the order of the subsets of data following an expectation of update value. The subsets of data are transferring to the second storage based on the order of the subsets of data based on a predetermined schedule. Data determined as inactive is overwritten on the sequential access medium by transferred data. End data to the sequential access medium is set after a last active data is written before the one or more sets of data are determined to be inactive. The one or more sets of data determined to be inactive are deleted from the second storage and a transfer is initiated. 1one or more computer processors;one or more computer-readable storage media; in response to instructions to determine that the second storage comprises an index partition and a data partition, instructions to select a plurality of data to migrate from the first storage to the second storage, wherein selected files are in a resident state;', 'instructions to obtain metadata associated with one or more subsets of data of the plurality of data;', 'instructions to order the subsets of data based on the obtained metadata, the order of the subsets of data following an expectation of update value;', 'instructions to transfer the subsets of data to the second storage based on the order of the subsets of data based on a predetermined schedule;', 'in response to instructions to determine the plurality of data written in a rear region of the sequential access medium being inactive, instructions to overwrite the data determined as inactive on the sequential access medium by transferred data;', 'in response to instructions to determine that the one or more sets of data written in the rear region are inactive, instructions to set an end data to ...

Подробнее
Номер записи: 82
11-05-2017 дата публикации

DATA WRITING IN A FILE SYSTEM

Номер: US20170131950A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue, YAMAMOTO NORIKO
Принадлежит:

In an approach for writing data on a tape using a file system, a processor receives a first write request of a first file. A processor obtains data of the first file. A processor writes the data of the first file on a tape. A processor receives a second write request of a second file prior to completion of writing the data of the first file on the tape. A processor adds information about the second file to a first list, wherein the first list includes files waiting to write. Subsequent to writing the data of the first file on the tape, a processor obtains data of the second file based on the first list. A processor writes the data of the second file after the first file on the tape. 1one 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 receive a first write request of a first file;program instructions to obtain data of the first file; program instructions to write a first portion of the data of the first file in a first wrap of the tape, wherein the first portion of the data of the first file is of a first predetermined length; and', 'program instructions to write information on a write position of the first portion of the data of the first file in a second list, wherein the second list includes information about write interrupts;, 'program instructions to write the data of the first file on a tape, wherein program instructions to write the data of the first file on the tape compriseprogram instructions to receive a second write request of a second file prior to completion of writing the data of the first file on the tape;program instructions to add information about the second file to a first list, wherein the first list includes files waiting to write;subsequent to writing the data of the first file on the tape, program instructions to obtain data of the second file based on the first list; program instructions to write a first ...

Подробнее
Номер записи: 83
11-05-2017 дата публикации

INFORMATION MANAGEMENT

Номер: US20170132221A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

Managing metadata added to a file, a directory, or a symbolic link is provided. One or more pieces of metadata of a movement target are obtained. The movement target is at least one of a file, a directory, and a symbolic link. The movement target is to be moved from one file system to another file system within a plurality of file systems. Whether the one or more pieces of metadata are migratable to the other file system is determined based, at least in part, on metadata stored in the other file system. The one or more pieces of metadata are processed by (i) migrating a first piece of metadata that is determined to be migratable to the other file system and (ii) leaving a second piece of metadata in the one file system, wherein the second piece of metadata is determined to be non-migratable. 1. A computer system for managing metadata added to a file , a directory , or a symbolic link , the computer system comprising:one or more computer processors;one or more computer readable storage media;program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising:program instructions to obtain one or more pieces of metadata of a movement target, wherein the movement target is at least one of a file, a directory, and a symbolic link, and wherein the movement target is to be moved from one file system to another file system within a plurality of file systems;program instructions to determine whether the one or more pieces of metadata are migratable to the other file system based, at least in part, on metadata stored in the other file system; andprogram instructions to process the one or more pieces of metadata by (i) migrating a first piece of metadata that is determined to be migratable to the other file system and (ii) leaving a second piece of metadata in the one file system, wherein the second piece of metadata is determined to be non-migratable.2. The computer ...

Подробнее
Номер записи: 84
11-05-2017 дата публикации

SUPPORT FOR WORM CARTRIDGES REALIZED BY LINEAR TAPE FILE SYSTEM (LTFS)

Номер: US20170132247A1
Автор: HASEGAWA Tohru, Nagura Hironobu, Ozeki Kazuhiro
Принадлежит:

When a WORM cartridge is formatted for Tape File System (LTFS) in advance, such as prior to shipment, Linear Tape File System Library Edition (LTFS LE) is expanded by software to reduce consumption of the index partition and to support elimination of the appending of unnecessary data. More specifically, instead of recording metadata in the index partition during normal unmounting, the metadata is recorded in separate local storage such as on hard disk drive (HDD), and the index partition is updated only when the cartridge is ejected from the library. In this way, the present invention is able to significantly reduce the frequency of index partition updates. Because an update occurs only when the user intentionally ejects a cartridge, overflow of the index partition before overflow of the data partition can be prevented. 1. A file system for eliminating the appending of unnecessary data created when a built-in tape in a tape cartridge mounted in a tape drive being used is accessed , to reduce consumption of capacity in a WORM index partition , the tape cartridge containing a built-in tape divided into two WORM partitions , the history of a plurality of files and metadata including the allocation of one or more recorded files being recorded in the one WORM data partition , and metadata being recorded in the other WORM index partition , wherein the file system , in response to an access request for a file on a tape cartridge mounted in a tape drive , enables:metadata recorded in a WORM index partition to be read;the read metadata to be written to an index area in local storage;metadata written to the index area to be used without using the metadata recorded in the WORM index partition in response to an access request to a file;determination of whether an access request for metadata written in the index area is accompanied by an update of the metadata; andwriting the metadata written to the index area to the WORM index partition when it has been determined that the ...

Подробнее
Номер записи: 85
19-05-2016 дата публикации

WRITING DATA SPANNING PLURALITY OF TAPE CARTRIDGES

Номер: US20160139818A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A method includes, in a tape apparatus system, receiving a request to write a file from a host, and, in response to the request, dividing sequentially received data of the file into two or more segments. Each of the two or more segments have a predetermined size. The method further includes sequentially writing a series of the two or more segments onto one or more tapes, and determining the predetermined size based on a capacity use efficiency of a plurality of other tapes and a time to copy when a spanning file, written by spanning on the one or more tapes, is copied to the plurality of other tapes. A corresponding computer program product and computer system are also disclosed. 1. A method comprising , in a tape apparatus system:receiving a request to write a file from a host;in response to the request, dividing sequentially received data of the file into two or more segments, each of the two or more segments having a predetermined size;sequentially writing a series of the two or more segments onto one or more tapes; anddetermining the predetermined size based on a capacity use efficiency of a plurality of other tapes and a time to copy when a spanning file written by spanning on the one or more tapes is copied to the plurality of other tapes.2. The method of claim 1 , wherein determining the predetermined size is based on an amount of free space on the one or more tapes.3. The method of claim 1 , wherein determining the predetermined size comprises determining the time to copy when the spanning file is copied to the plurality of other tapes based on a time to rewrite the segment and a time to write an index of the segment.4. The method of claim 2 , wherein the predetermined size is smaller than the amount of free space.5. The method of claim 3 , wherein determining the predetermined size is executed in a case where a value of an amount of free space on the one or more tapes is equal to or more than a given rate.6. The method of claim 3 , wherein the predetermined ...

Подробнее
Номер записи: 86
19-05-2016 дата публикации

TECHNIQUE FOR PROVIDING INFORMATION ON TIME TO READ A FILE

Номер: US20160139824A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue, YAMAMOTO NORIKO
Принадлежит:

An information providing system and method, including a computer, for providing time taken to read a file, which includes an acquisition unit. The acquisition unit obtains information on a recording position of a file when the file is recorded in a storage device. A recording unit writes information on the obtained recording position to an index referred to access the file. A calculation unit calculates time taken to read the file using the information on the recording position written to the index in response to a request to obtain the time taken to read the file, and providing the calculated time to a requester that requests the time. 1. An information providing system , including a computer , for providing time taken to read a file , comprising:an acquisition unit for obtaining information on a recording position of a file when the file is recorded in a storage device;a recording unit for writing information on the obtained recording position to an index referred to access the file; anda calculation unit for calculating time taken to read the file using the information on the recording position written to the index in response to a request to obtain the time taken to read the file and providing the calculated time to a requestor that requests the time.2. The information providing system according to claim 1 , whereinthe storage device is a magnetic tape medium; andthe acquisition unit obtains, information on a recording start position of the file and information on a recording end position of the file from a tape drive that records the file in the magnetic tape medium.3. The information providing system according to claim 2 , wherein the recording position of the file includes a recording start position and a recording end position of the file in a longitudinal direction of the magnetic tape medium and a recording start position and a recording end position of the file in a lateral direction perpendicular to the longitudinal direction of the magnetic tape medium. ...

Подробнее
Номер записи: 87
19-05-2016 дата публикации

INFORMATION MANAGEMENT

Номер: US20160140118A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

Managing metadata added to a file, a directory, or a symbolic link is provided. One or more pieces of metadata of a movement target are obtained. The movement target is at least one of a file, a directory, and a symbolic link. The movement target is to be moved from one file system to another file system within a plurality of file systems. Whether the one or more pieces of metadata are migratable to the other file system is determined based, at least in part, on metadata stored in the other file system. The one or more pieces of metadata are processed by (i) migrating a first piece of metadata that is determined to be migratable to the other file system and (ii) leaving a second piece of metadata in the one file system, wherein the second piece of metadata is determined to be non-migratable. 1. A method for managing metadata added to a file , a directory , or a symbolic link , the method comprising:obtaining, by one or more processors, one or more pieces of metadata of a movement target, wherein the movement target is at least one of a file, a directory, and a symbolic link, and wherein the movement target is to be moved from one file system to another file system within a plurality of file systems;determining whether the one or more pieces of metadata are migratable to the other file system based, at least in part, on metadata stored in the other file system; andprocessing the one or more pieces of metadata by (i) migrating a first piece of metadata that is determined to be migratable to the other file system and (ii) leaving a second piece of metadata in the one file system, wherein the second piece of metadata is determined to be non-migratable.2. The method according to claim 1 , wherein the plurality of file systems are arranged into a hierarchy claim 1 , the method further comprising:determining, when moving the movement target from a file system at a high level to a file system at a low level via one or more file systems at middle levels, for each piece of ...

Подробнее
Номер записи: 88
03-06-2021 дата публикации

Ordering archived search results

Номер: US20210165834A1
Автор: Asako Ono, Hiroaki Uetsuki, Kenta WATANABE, Shunsuke Ishikawa, Tohru Hasegawa, Yasuyuki Tominaga
Принадлежит: International Business Machines Corp

Embodiments are disclosed for a method for ordering search results. The method includes identifying a plurality of archived search results generated by a keyword search. The method also includes searching a plurality of indices of a plurality of corresponding tape libraries comprising a plurality of tapes storing the archived search results. The method additionally includes determining a plurality of estimated access times corresponding to the archived search results based on the indices. Further, the method includes sorting the archived search results based on the estimated access times to create a time-based order.

Подробнее
Номер записи: 89
18-05-2017 дата публикации

ALLOCATING NON-CONFLICTING INODE NUMBERS

Номер: US20170139932A1
Автор: HASEGAWA Tohru, MATSUI SOSUKE, Narita Izuru
Принадлежит:

A method for allocating non-conflicting inode numbers between files generated at a first location and files generated at another location is provided. The method includes providing an inode number allocation rule table indicating availability for assignment a plurality of inode number allocation rules associated with the first location and the another location, generating a fileset at the first location by assigning an available inode number allocation rule to the fileset, registering, in the inode number allocation rule table, information associated with the fileset, and generating a file at the first location by determining the fileset within which to generate the file; and allocating an inode number for the file based on the available inode number allocation rule assigned to the fileset. 1. A method for allocating non-conflicting inode numbers between files generated at a first location and files generated at another location , the method comprising:providing an inode number allocation rule table comprising a plurality of inode number allocation rules associated with the first location and the another location, wherein the inode number allocation rule table indicates availability of the plurality of inode number allocation rules for assignment; assigning an available inode number allocation rule to the fileset;', 'registering, in the inode number allocation rule table, information associated with the fileset comprising at least one of a fileset ID, a mount point, and an identification for the first location; and, 'generating a fileset at the first location comprising determining the fileset within which to generate the file; and', 'allocating an inode number for the file based on the available inode number allocation rule assigned to the fileset., 'generating a file at the first location comprising2. The method according to claim 1 , further comprising: assigning another available inode number allocation rule to the another fileset; and', 'registering, in the ...

Подробнее
Номер записи: 90
24-05-2018 дата публикации

MOVING A CAR WITHIN A SHUTTLE COMPLEX

Номер: US20180141750A1
Автор: HASEGAWA Tohru, Hasegawa Yuhko
Принадлежит:

The present description is directed to moving a car within a shuttle connection that connects a first library string and a second library string contained in a shuttle complex. The shuttle complex determines a first library string data chunk count of a first library string, determines a second library string data chunk count of a second library string, and moves the car within the shuttle connection to the first library string if the first library string data chunk count is greater than the second library string data chunk count. A library string data chunk count is generally the sum of respective cartridge data chunk counts of each cartridge located within the library string. The library string data chunk count may be updated after a data chunk write to a cartridge located within the library string, may be updated after a cartridge is moved from the library string, and may be updated after a cartridge is moved to the library string. 1. A method to move a car within a shuttle connection within a shuttle complex having a plurality of library strings , the method comprising:determining a first library string data chunk count of a first library string;determining a second library string data chunk count of a second library string, and;moving a car within a shuttle connection to the first library string if the first library string data chunk count is greater than the second library string data chunk count.2. The method of claim 1 , further comprising:identifying each cartridge comprised within the first library string, and;identifying each cartridge comprised within the second library string.3. The method of claim 1 , wherein the first library string data chunk count is the sum of the number of data chunks written to each cartridge comprised within the first library string and wherein the second library string data chunk count is the sum of the number of data chunks written to each cartridge comprised within the second library string.4. The method of claim 1 , further ...

Подробнее
Номер записи: 91
10-06-2021 дата публикации

ANAPHORA RESOLUTION

Номер: US20210174022A1
Автор: HASEGAWA Tohru, ISHIKAWA SHUNSUKE, ONO ASAKO, Tominaga Yasuyuki, UETSUKI HIROAKI, WATANABE Kenta
Принадлежит:

A method, a structure, and a computer system for resolving an anaphora. The exemplary embodiments may include extracting individual context data from an individual expression and determining whether the individual expression includes an anaphora representation based on the individual context data. The exemplary embodiments may further include, based on determining that the individual expression includes the anaphora representation, extracting anaphora context data and identifying an object of one or more objects to which the anaphora representation refers based on comparing the individual context data and the anaphora context data to data detailing the one or more objects. 1. A computer-implemented method for resolving an anaphora , the method comprising:extracting individual context data from an individual expression;determining whether the individual expression includes an anaphora representation based on the individual context data;based on determining that the individual expression includes the anaphora representation, extracting anaphora context data; andidentifying an object of one or more objects to which the anaphora representation refers based on comparing the individual context data and the anaphora context data to data detailing the one or more objects.2. The method of claim 1 , wherein identifying the object of the one or more objects to which the anaphora representation refers further comprises:extracting metadata corresponding to the one or more objects; andcomparing the metadata corresponding to the one or more objects to the individual context data and the anaphora context data.3. The method of claim 2 , further comprising:determining an object match score for each comparison of the metadata to the individual context data and the anaphora context data; anddetermining an overall object match score for each of the one or more objects as it relates to resolving the anaphora representation.4. The method of claim 3 , wherein determining the overall object ...

Подробнее
Номер записи: 92
24-05-2018 дата публикации

MOVING CARTRIDGES WITHIN A SHUTTLE COMPLEX

Номер: US20180144771A1
Автор: HASEGAWA Tohru, Hasegawa Yuhko
Принадлежит:

The present description is directed to moving a cartridge including a storage medium within a shuttle complex that includes numerous shuttle connections, and a plurality of library strings connected by at least one shuttle connection. Each shuttle connection has a car able to move within the shuttle connection and each library string has at least one cartridge including a storage medium. The shuttle complex identifies a library string that contains the access-cartridge (LSAC), identifies whether there is a drive within the LSAC that has a second cartridge mounted therein which comprises only inactive data chunks, removes the second cartridge from the drive within the LSAC if an elapsed time since the drive within the LSAC most recently accessed the second cartridge exceeds a predetermined time period threshold, and mounts the access-cartridge to the drive within the LSAC. 1. A method to move an access-cartridge including a storage medium within a shuttle complex having a plurality of library strings connected by a plurality of shuttle connections , the method comprising:identifying a library string comprising the access-cartridge (LSAC);determining whether there is a local drive amongst a plurality of local drives within the LSAC that has a second cartridge mounted therein which comprises only inactive data chunks;removing the second cartridge from the local drive within the LSAC and mounting the access-cartridge to the local drive within the LSAC, if an elapsed time since the local drive within the LSAC most recently accessed the second cartridge exceeds a predetermined time period threshold; and identifying a remote drive within a remote library string (LSR) connected to the LSAC by at least one shuttle connection;', 'moving the access-cartridge from the LSAC to the LSR with the at least one shuttle connection; and', 'mounting the access-cartridge to the remote drive within the LSR., 'if the elapsed time since the local drive within the LSAC most recently accessed ...

Подробнее
Номер записи: 93
04-06-2015 дата публикации

Efficiency of File Synchronization in a Linear Tape File System

Номер: US20150154222A1
Автор: Ashida Takashi, HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, Watanabe Terue
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A mechanism is provided for improved file synchronization of a magnetic tape. A destination device determines whether one or more file checksums exist in an extended file attribute associated with an identified file. Responsive to one or more file checksums existing in the extended file attribute associated with the identified file, the destination device reads the one or more file checksums out of the extended file attribute without accessing the magnetic tape. The destination device transmits the one or more file checksums to a source device. The source device segments the data of the new file into fixed-length blocks that do not overlap one another. The source device calculates one or more new file checksums for each of the fixed-length blocks. The source device transmits the one or more new file checksums to the destination device. 1. A method , in a data processing system , for improved file synchronization of a magnetic tape , the method comprising:determining, by a destination device, whether one or more file checksums exist in an extended file attribute associated with an identified file, wherein the extended file attribute of the identified file in an index associated with the magnetic tape and wherein the index is in a local data structure associated with the destination device;responsive to one or more file checksums existing in the extended file attribute associated with the identified file, reading, by the destination device, the one or more file checksums out of the extended file attribute without accessing the magnetic tape;transmitting, by the destination device, the one or more file checksums to a source device;segmenting, by the source device, the data of the new file into fixed-length blocks that do not overlap one another;calculating, by the source device, one or more new file checksums for each of the fixed-length blocks; andtransmitting, by the source device, the one or more new file checksums to the destination device.2. The method of claim 1 ...

Подробнее
Номер записи: 94
02-06-2016 дата публикации

WRITING FILES TO A STORAGE MEDIUM

Номер: US20160154604A1
Автор: HASEGAWA Tohru, Iwanaga Masayuki, OISHI Yutaka
Принадлежит:

A method for writing a plurality of files that reduces average seek time includes receiving data of the plurality of files requested to be written to a tape from an application of a host, dividing a group of the received plurality of files into segments with specified sizes, and writing a series of the plurality of respective segments of the group of the plurality of files in sequence in a specified order, the respective segments having the specified sizes, wherein when writing the segments in the specified order, a left end portion of the tape is positioned and respective top segments of the files are first collectively written thereto. A tape drive system in which the method for writing is implemented can reduce an average time required for seek of a plurality of image files. 1. A method for writing a plurality of image files capable of reducing an average time for seek of the plurality of files stored on a tape , comprising:receiving data of the plurality of files from an application of a host;dividing a group of the received plurality of files into segments having specified sizes; andwriting a series of the plurality of respective segments of the group of the plurality of files in sequence in a specified order, the respective segments having the specified sizes, wherein writing the segments in the specified order comprises collectively writing respective top segments of the files to a left end portion of the tape.2. The method of claim 1 , wherein writing the series of the plurality of respective segments of the group of the plurality of files in sequence in a specified order comprises starting to collectively write respective top segments of the files to a left end portion of an even wrap of the tape.3. The method of claim 1 , wherein writing a series of the plurality of respective segments of the group of the plurality of files in sequence in a specified order further comprises starting to collectively write respective last segments of the files to a left end ...

Подробнее
Номер записи: 95
15-09-2022 дата публикации

RECLASSIFICATION OF FILES IN A HIERARCHICAL STORAGE MANAGEMENT SYSTEM

Номер: US20220291855A1
Автор: Abe Atsushi, HASEGAWA Tohru, Itagaki Hiroshi, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

In an approach to automatically reclassifying files in an HSM system, responsive to occurrence of a recall to move a file on a hierarchical storage system from a secondary storage to a primary storage, whether stub metadata exists for the file is determined. Responsive to determining that stub metadata exists for the file, whether reclassification of the file is necessary is determined based on the stub metadata. Responsive to determining that the reclassification of the file is necessary, the file is reclassified, where the reclassification uses a latest classification model, and further where the stub metadata is updated with results of the reclassification. The file is migrated from the primary storage to the secondary storage based on the stub metadata. 1. A computer-implemented method comprising:responsive to occurrence of a recall to move a file on a hierarchical storage system from a secondary storage to a primary storage, determining, by one or more computer processors, whether stub metadata exists for the file, wherein the stub metadata comprises an identifier identifying a model version;responsive to determining that stub metadata exists for the file, determining, by the one or more computer processors, whether reclassification of the file is necessary based on a check of the stub metadata against a database of classification models;responsive to determining that the reclassification of the file is necessary, reclassifying, by the one or more computer processors, the file, wherein the reclassification uses a latest classification model, and further wherein the stub metadata is updated with results of the reclassification; andmigrating, by the one or more computer processors, the file from the primary storage to the secondary storage, wherein the file is migrated to the secondary storage based on the stub metadata.2. The computer-implemented method of claim 1 , wherein responsive to determining that the reclassification of the file is necessary claim 1 , ...

Подробнее
Номер записи: 96
07-05-2020 дата публикации

WRITING FILE INFORMATION FOR TAPE FILE SYSTEMS

Номер: US20200142593A1
Автор: Abe Atsushi, HASEGAWA Tohru
Принадлежит:

A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a processor to cause the processor to: receive a first portion of data, and divide the first portion of data into a plurality of blocks. An identification segment having identification information therein is appended to each of the blocks, each block and the corresponding identification information appended thereto forming a record. Each record is written in a data partition of the magnetic tape, and an index may be written in the data partition of the magnetic tape. The magnetic tape is rewound to a beginning of tape in response to a final one of the records being written in the magnetic tape, and the index is written in an index partition of the magnetic tape. 1. A computer program product comprising a computer readable storage medium having program instructions embodied therewith , the program instructions readable and/or executable by a processor to cause the processor to:receive, by the processor, a first portion of data to be written in a magnetic tape;divide, by the processor, the first portion of data into a plurality of blocks;append, by the processor, an identification segment having identification information therein to each of the blocks, wherein each block and the corresponding identification information appended thereto forms a record;write, by the processor, each record in a data partition of the magnetic tape;write, by the processor, an index in the data partition of the magnetic tape in response to a predetermined condition being met, wherein the index is associated with all data on the magnetic tape;rewind, by the processor, the magnetic tape to a beginning of tape in response to a final one of the records being written in the magnetic tape; andwrite, by the processor, the index in an index partition of the magnetic tape,wherein the index is ...

Подробнее
Номер записи: 97
07-05-2020 дата публикации

METHOD TO WRITE DATA AHEAD TO SNAPSHOT AREA TO AVOID COPY-ON-WRITE

Номер: US20200142971A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A method includes setting a maximum total size of data saved in a snapshot area, creating a snapshot of a file system, including reference to a plurality of logical volumes, saving at least a part of the plurality of logical volumes in the snapshot area on condition that it does not exceed the maximum total size of data saved in the snapshot area, and executing copy-on-write processing in response to a writing request for data in the file system, the data not being saved in the snapshot area. 1. A method comprising:setting a maximum total size of data saved in a snapshot area;creating a snapshot of a file system, including reference to a plurality of logical volumes;saving at least a part of the plurality of logical volumes in the snapshot area on condition that it does not exceed the maximum total size of data saved in the snapshot area; andexecuting copy-on-write processing in response to a writing request for data in the file system, the data not being saved in the snapshot area.2. The method of claim 1 , wherein the saving is executed asynchronously with the copy-on-write processing.3. The method of claim 1 , wherein the saving is executed in units of logical volumes.4. The method of claim 3 , wherein the saving is performed by saving the logical volumes in ascending order of size in the snapshot area.5. The method of claim 3 , wherein the copy-on-write processing is executed in units of data blocks.6. The method of claim 5 , wherein the copy-on-write processing is executed to one or more data blocks corresponding to target data of the writing request.7. The method of claim 1 , wherein the plurality of logical volumes include one or more virtual tapes that belong to a private category and one or more virtual tapes that belong to a scratch category.8. The method of claim 7 , wherein the saving includes saving only one or more logical volumes that belong to the scratch category in the snapshot area.9. The method of claim 7 , wherein a first data is appended to the ...

Подробнее
Номер записи: 98
11-06-2015 дата публикации

Average Response Time Improvement From a File System for a Tape Library

Номер: US20150160865A1
Автор: HASEGAWA Tohru, Hasegawa Yuhko
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A mechanism is provided for improving the average response time of a tape library. Prior to receiving a next access request for data from one of a set of tape mediums, a determination is made as to whether a number of tape drives that are unoccupied is less than a predetermined minimum open tape drive threshold (N). Responsive to the number of tape drives that are unoccupied being less than the predetermined minimum open tape drive threshold (N), a least recently used idle tape medium is unmounted and unloaded from an associated tape drive. 1. A method , in a data processing system , for improving the average response time of a tape library , the method comprising:prior to receiving a next access request for data from one of a set of tape mediums, determining whether a number of tape drives that are unoccupied is less than a predetermined minimum open tape drive threshold (N); andresponsive to the number of tape drives that are unoccupied being less than the predetermined minimum open tape drive threshold (N), unmounting and unloading a least recently used idle tape medium from an associated tape drive.2. The method of claim 1 , wherein the predetermined minimum open tape drive threshold (N) is determined by satisfying the following equation:{'br': None, 'i': M−D', 'TU+TD', 'N', 'TL+TM, '()()>×().'}where M is the number of tape mediums in the tape library, D is a number of tape drives in the tape library, TL is an average loading time of a tape medium in the set of tape mediums, TU is an average unloading time of a tape medium in the set of tape mediums, TM is an average mounting time of a tape medium in the set of tape mediums, TD is an average unmounting time of a tape medium in the set of tape mediums, and N is the predetermined minimum open tape drive threshold.3. The method of claim 1 , further comprising:responsive to the number of tape drives that are unoccupied being less than the predetermined minimum open tape drive threshold (N) and no tape medium being ...

Подробнее
Номер записи: 99
01-06-2017 дата публикации

COPY FROM SOURCE MEDIUM TO TARGET MEDIUM

Номер: US20170153820A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A computer-implemented method for copying data from a source medium to a target medium in a storage system by a computer system, the storage system including a storage device, a first drive configured to access the source medium, and a second drive configured to access the target medium, the method comprising: estimating a waiting time for copy target data to be transferred from the source medium, selecting migration target data of the storage device based on whether migration of data to the target medium is expected to be finished within the waiting time or not, migrating the migration target data from the storage device to the target medium by the second drive while locating and/or reading the copy target data on the source medium by the first drive, and writing the copy target data to the target medium by the second drive. 1. A computer-implemented method for copying data from a source medium to a target medium in a storage system by a computer system , the storage system including a storage device , a first drive configured to access the source medium , and a second drive configured to access the target medium , the method comprising:estimating, by the computer system, a waiting time for copy target data to be transferred from the source medium;selecting, by the computer system, migration target data of the storage device based on whether migration of data to the target medium is expected to be finished within the waiting time or not;migrating, by the computer system, the migration target data from the storage device to the target medium by the second drive while locating and/or reading the copy target data on the source medium by the first drive; andwriting, by the computer system, the copy target data to the target medium by the second drive.2. The method of claim 1 , wherein the copy target data is a target of reclamation claim 1 , wherein the waiting time includes a time required for locating and/or reading the copy target data by the first drive based on a ...

Подробнее
Номер записи: 100
01-06-2017 дата публикации

Provision of Information About Fragmentation of File on Sequential Access Medium

Номер: US20170153823A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A mechanism is provided for providing information about fragmentation of a file on a sequential access medium by a computer system is disclosed. An actual time for reading the file recorded on the sequential access medium is estimated based on a physical position of the file. A total length of the file on the sequential access medium is calculated based on a physical length of each data piece constituting the file. An expected time for reading the file by assuming that the file is rewritten continuously is estimated based on the total length of the file. Information about the fragmentation of the file is then provided based on the actual time and the expected time. 1. A method for providing information about fragmentation of a file on a sequential access medium by a computer system , the method comprising:estimating an actual time for reading the file recorded on the sequential access medium based on a physical position of the file;calculating a total length of the file on the sequential access medium based on a physical length of each data piece constituting the file;estimating an expected time for reading the file by assuming that the file is rewritten continuously, based on the total length of the file; andproviding information about the fragmentation of the file based on the actual time and the expected time.2. The method of claim 1 , wherein the estimating the expected time comprises:obtaining a physical position of EOD (end of data) on a target sequential access medium, the target sequential access medium being a same as or different from the sequential access medium to which the file recorded;estimating an expected physical position of virtual data having the total length of the file by assuming that the virtual data is arranged after the EOD on the target sequential access medium based on the total length and the physical position of the EOD; andcalculating the expected time based on the expected physical position of the virtual data having the total length ...

Подробнее
Номер записи: 101
01-06-2017 дата публикации

Data Updating in a File System

Номер: US20170153840A1
Автор: HASEGAWA Tohru, Itagaki Hiroshi, MATSUI SOSUKE, MITSUMA SHINSUKE, MIYAMURA TSUYOSHI, YAMAMOTO NORIKO
Принадлежит:

A mechanism is provided for updating data of a file on a tape in a file system using a tape drive. Data of a file which received a write request is read out from a tape drive and stored in a memory. At least a part of the data of the file is edited and the edited data part of the file is stored in the memory. Combination data with a non-edited data part and the edited data part of the file is written on the tape in the tape drive as a continuous data of the file to have an extent. The extent of the written continuous data of the file is then written on the tape. 1. A method , in a data processing system , of updating data of a file on a tape in a file system using a tape drive , comprising the steps of:responsive to receiving a update request for the file on the tape, reading data of the file from the tape on the tape drive and storing the data in a memory;editing at least a part of the data of the file and storing the edited data part of the file in the memory;writing combination data with a non-edited data part and the edited data part of the file on the tape in the tape drive as a continuous data of the file to have an extent; andwriting the extent of the written continuous data of the file on the tape.2. The method according to claim 1 , wherein writing the combination data of the file on the tape further comprises:obtaining an excessive capacity Cx from the tape drive;calculating a delta lost capacity ΔCl in the case of writing the combination data on the tape; andresponsive to the excessive capacity Cx being larger than the delta lost capacity ΔCl, writing the combination data of the file on the tape.3. The method according to claim 2 , wherein calculating the delta lost capacity ΔCl further comprises:{'b': 2', '1', '1', '2, 'calculating ΔCl=C−C, where C means a consumption tape capacity in the case of writing only the edited data part of the file on the tape, and C means a consumption tape capacity in the case of writing the combination data of the file on ...

Подробнее
Номер записи: 102
09-06-2016 дата публикации

METHOD AND SYSTEM FOR FILE RELOCATION

Номер: US20160162498A1
Автор: HASEGAWA Tohru, KAMIYA Masanori
Принадлежит:

A method and system for file relocation is provided. A file relocation system is connected to multiple storage devices. The system obtains a number of times that each of a number of files stored on the multiple storage devices is requested simultaneously with a concerned file. The relocation system then classifies multiple files into multiple groups, such that groups of files simultaneously are put together into one group. Multiple files classified in to the same group are then relocated to a single storage device. The relocation system then switches a storage device not accessed for a certain period of time into a power-saving mode. 113.-. (canceled)14. A computer-implemented method , comprising:reading history information on access requests for each file of a plurality of files from a memory;obtaining an access request frequency for each file of the plurality of files;defining a plurality of time periods;associating each file of the plurality of files with only one of the plurality of defined time periods in which the respective file was access requested the largest number of times, thereby defining a unique set of files associated with each of the defined time periods, wherein each file appears only once in all of the sets of files associated with the defined time periods;classifying the set of files associated with each of the defined time periods into a plurality of groups of files, each group of files comprising a plurality of files with similar access request frequencies; andrelocating each group of files, each group being relocated to one of the storage devices.15. The method of claim 14 , comprising: monitoring access requests of the plurality of storage devices; and invoking a power-saving mode on a storage device of the plurality of storage devices when the storage device is not accessed for a fixed time.16. The method of claim 14 , wherein the access request history information includes a list of access requests containing identification information of ...

Подробнее
Номер записи: 103
07-06-2018 дата публикации

WRITING FILE INFORMATION FOR TAPE FILE SYSTEMS

Номер: US20180157420A1
Автор: Abe Atsushi, HASEGAWA Tohru
Принадлежит:

A computer-implemented method, according to one embodiment, includes: receiving a first portion of data to be written in a magnetic medium, dividing the first portion of data into a plurality of blocks, appending an identification segment having identification information therein to each of the blocks, wherein each block and the corresponding identification information appended thereto forms a record, writing each record in a data partition of the magnetic medium, and writing an index in the data partition of the magnetic medium in response to a predetermined condition being met, wherein the index is associated with all data on the magnetic medium. Other systems, methods, and computer program products are described in additional embodiments. 1. A computer-implemented method , comprising:receiving a first portion of data to be written in a magnetic medium;dividing the first portion of data into a plurality of blocks;appending an identification segment having identification information therein to each of the blocks, wherein each block and the corresponding identification information appended thereto forms a record;writing each record in a data partition of the magnetic medium; andwriting an index in the data partition of the magnetic medium in response to a predetermined condition being met, wherein the index is associated with all data on the magnetic medium.2. The computer-implemented method as recited in claim 1 , wherein the identification information is selected from a group consisting of: a path name of the first portion of data claim 1 , an offset in the first portion of data corresponding to a location of a respective one of the blocks claim 1 , and a length of a respective one of the blocks.3. The computer-implemented method as recited in claim 1 , wherein each of the blocks has a fixed size.4. The computer-implemented method as recited in claim 1 , wherein the identification segment appended to each of the blocks has a fixed size.5. The computer-implemented ...

Подробнее
Номер записи: 104