Patents by Inventor Takahiro TSUDA
Takahiro TSUDA has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20180157413Abstract: A computer-implemented method, according to one embodiment, includes assigning one or more first-type tape cartridges to an upper tape layer of a hierarchical storage management system, assigning one or more second-type tape cartridges to a lower tape layer of the hierarchical storage management system, and moving, to the lower tape layer, data having lower access frequency and recorded in the first-type tape cartridge assigned to the upper tape layer. A length of a tape included in the second-type tape cartridge is longer than a length of a tape included in the first-type tape cartridge.Type: ApplicationFiled: December 6, 2016Publication date: June 7, 2018Inventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Jun Tanaka, Takahiro Tsuda
-
Publication number: 20180143768Abstract: A computer-implemented method for providing access to plural virtual sequential access volumes by using random access media, includes: accepting an operation for writing first data to a specific virtual sequential access volume of the plural virtual sequential access volumes; and storing a first file including the first data in the random access media, the first file being separate from a second file including second data stored in the random access media in response to an operation for writing the second data to the specific virtual sequential access volume.Type: ApplicationFiled: January 22, 2018Publication date: May 24, 2018Inventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Publication number: 20180113619Abstract: A method for balancing performance of heterogeneous tape drives and/or tape cartridges includes identifying multiple tape cartridges to which data is to be written, and identifying multiple tape drives to write the data to the tape cartridges. The method divides the data into multiple blocks, where each block is configured to be written to one of the multiple tape cartridges by one of the multiple tape drives. The method further sizes each block in accordance with an amount of time required to write the block to the corresponding tape cartridge by the corresponding tape drive. In certain embodiments, the blocks are sized so that they take substantially the same amount of time to be written to their corresponding tape cartridges. Once the blocks are sized appropriately, the method writes the blocks to their corresponding tape cartridges. A corresponding system and computer program product are also disclosed.Type: ApplicationFiled: October 25, 2016Publication date: April 26, 2018Applicant: International Business Machines CorporationInventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Jun Tanaka, Takahiro Tsuda
-
Patent number: 9952780Abstract: An input to read two or more data records stored to a tape medium on a tape drive is received. A starting point is determined. The starting point is a closest data record, of the two or more data records, to a current position of a tape head of the tape drive. A read order of the two or more data records is determined. The read order is determined using an algorithm and the determined starting point. The determined read order is sent to a host device. A first data record is determined. A first locate operation within the tape drive is performed. The first data record, of the two or more data records stored on the tape medium, based on the determined read order is read. The first data record, of the two or more data records stored on the tape medium, is sent to the host device.Type: GrantFiled: June 28, 2016Date of Patent: April 24, 2018Assignee: International Business Machines CorporationInventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Patent number: 9916115Abstract: A computer-implemented method for providing access to plural virtual sequential access volumes by using random access media, includes: accepting an operation for writing first data to a specific virtual sequential access volume of the plural virtual sequential access volumes; and storing a first file including the first data in the random access media, the first file being separate from a second file including second data stored in the random access media in response to an operation for writing the second data to the specific virtual sequential access volume.Type: GrantFiled: March 29, 2016Date of Patent: March 13, 2018Assignee: International Business Machines CorporationInventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Publication number: 20180046400Abstract: A method for writing data from a table to a tape includes setting a number of partitions on the tape, where the number of partitions is greater than or equal to a number of columns of the table to be written to the tape, and writing data from each column of the table to at least one partition of the tape, the at least one partition including two or more wraps, the data is written from a top of the two or more wraps towards a bottom of the two or more wraps in a direction of a width of the at least one partition. The written data is reciprocated from a beginning of the tape to an end of the tape in a longitudinal direction of the tape such that writing of a last data entry of one column ends at a beginning of the two or more wraps.Type: ApplicationFiled: October 25, 2017Publication date: February 15, 2018Inventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Publication number: 20170371563Abstract: An input to read two or more data records stored to a tape medium on a tape drive is received. A starting point is determined. The starting point is a closest data record, of the two or more data records, to a current position of a tape head of the tape drive. A read order of the two or more data records is determined. The read order is determined using an algorithm and the determined starting point. The determined read order is sent to a host device. A first data record is determined. A first locate operation within the tape drive is performed. The first data record, of the two or more data records stored on the tape medium, based on the determined read order is read. The first data record, of the two or more data records stored on the tape medium, is sent to the host device.Type: ApplicationFiled: June 28, 2016Publication date: December 28, 2017Inventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Patent number: 9830104Abstract: A method for writing data from a table to a tape includes setting a number of partitions on the tape, where the number of partitions is greater than or equal to a number of columns of the table to be written to the tape, and writing data from each column of the table to at least one partition of the tape, the at least one partition including two or more wraps, the data is written from a top of the two or more wraps towards a bottom of the two or more wraps in a direction of a width of the at least one partition. The written data is reciprocated from a beginning of the tape to an end of the tape in a longitudinal direction of the tape such that writing of a last data entry of one column ends at a beginning of the two or more wraps.Type: GrantFiled: February 1, 2017Date of Patent: November 28, 2017Assignee: International Business Machines CorporationInventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Publication number: 20170315751Abstract: A method for writing data from a table to a tape includes setting a number of partitions on the tape, where the number of partitions is greater than or equal to a number of columns of the table to be written to the tape, and writing data from each column of the table to at least one partition of the tape, the at least one partition including two or more wraps, the data is written from a top of the two or more wraps towards a bottom of the two or more wraps in a direction of a width of the at least one partition. The written data is reciprocated from a beginning of the tape to an end of the tape in a longitudinal direction of the tape such that writing of a last data entry of one column ends at a beginning of the two or more wraps.Type: ApplicationFiled: February 1, 2017Publication date: November 2, 2017Inventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Publication number: 20170285958Abstract: A computer-implemented method for providing access to plural virtual sequential access volumes by using random access media, includes: accepting an operation for writing first data to a specific virtual sequential access volume of the plural virtual sequential access volumes; and storing a first file including the first data in the random access media, the first file being separate from a second file including second data stored in the random access media in response to an operation for writing the second data to the specific virtual sequential access volume.Type: ApplicationFiled: March 29, 2016Publication date: October 5, 2017Inventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Publication number: 20170249100Abstract: The present invention provides a method of partitioning a tape medium dynamically by using a new method of writing data. It enables users to change size of the partitions later and to use all capacity of a tape efficiently. When a tape is divided into partitions, data is written in such a manner that the wraps are written in the partitions of the data band alternately in the forward direction and in the backward direction on the data band from the different sides of the data band toward the inside of the data band (W1, W2, W3 . . . ) and the location (C) at which the wrap (Wm) of the one partition collides with the wrap (Wn) of the other partition is defined as the demarcation (PB) of these partitions (P0,P1).Type: ApplicationFiled: February 29, 2016Publication date: August 31, 2017Inventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Patent number: 9747056Abstract: The present invention provides a method of partitioning a tape medium dynamically by using a new method of writing data. It enables users to change size of the partitions later and to use all capacity of a tape efficiently. When a tape is divided into partitions, data is written in such a manner that the wraps are written in the partitions of the data band alternately in the forward direction and in the backward direction on the data band from the different sides of the data band toward the inside of the data band (W1,W2,W3 . . . ) and the location (C) at which the wrap (Wm) of the one partition collides with the wrap (Wn) of the other partition is defined as the demarcation (PB) of these partitions (P0,P1).Type: GrantFiled: February 29, 2016Date of Patent: August 29, 2017Assignee: International Business Machines CorporationInventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Publication number: 20170179978Abstract: A storage system receives one or more records from a host system. The records are compressed in a first compression format that is native to the host system. The storage system identifies an incompatibility between the first compression format and a first operation of the storage system. In response to the identified incompatibility, the storage system decompresses the received records. The decompression is based on the first compression format. The storage system compresses the decompressed records in a second compression format. The storage system stores the secondarily compressed records onto a storage medium.Type: ApplicationFiled: December 16, 2015Publication date: June 22, 2017Inventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Patent number: 9684664Abstract: Accessing a file on a sequentially accessed storage device such as a magnetic tape often involves bypassing valid files and gaps between valid files. Presently taught is a method of copying valid files being bypassed to a second sequentially accessed storage device while not copying the gaps. When a read target file is reached, the read target file is read. During a write to a file writing position, valid files are copied to the second sequentially accessed storage device until the file writing position is reached and the file is written at the end of the valid files on the second sequentially accessed storage device.Type: GrantFiled: September 9, 2014Date of Patent: June 20, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Takahiro Tsuda
-
Publication number: 20170147253Abstract: A method for operating a tape drive may include receiving a command to read a record stored on a tape by a tape drive having a capability to compress and decompress data. The tape drive compresses a record prior to writing the record to tape when a command to write the record to tape specifies that the record is to be compressed, and when a compressed size of the record is smaller than an uncompressed size of the record. The method further include reading the record from the tape by the tape drive, where the tape includes a plurality of compressed records and a plurality of uncompressed records. The method further includes determining by the tape drive whether the record is not compressed. The method may additionally include generating a compressed record by compressing the record by the tape drive when it is determined that the record is not compressed.Type: ApplicationFiled: November 24, 2015Publication date: May 25, 2017Inventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Publication number: 20170139946Abstract: As disclosed herein, a computer implemented method for reading a record on a storage device includes reading, by a processor, the record from the storage device, and generating, by a processor, a header corresponding to the record. The method further includes adding, by a processor, header information corresponding to the metadata to the header, and providing, by a processor, the header and the record to a host. Also disclosed herein, a computer implemented method for writing a record on a storage device includes receiving, by a processor, a header and the record from a host to be written to the storage device, and determining, by a processor, metadata included in header information corresponding to the header. The method further includes determining, by a processor, a write behavior specified by the metadata, and writing, by a processor, the metadata and the record to the storage device according to the write behavior.Type: ApplicationFiled: November 12, 2015Publication date: May 18, 2017Inventors: Kousei Kawamura, Kohichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Publication number: 20170075771Abstract: A method for restoring a target file system in a storage system by a computer system, the computer system being connected to a network, the storage system including a tier of sequential access media, the method includes receiving a backup image including metadata of a file of the target file system, from a remote computer system via the network, the metadata indicating a sequential access medium, and restoring the metadata of the target file system using the backup image, the target file system being restored on the computer system by sharing a resource with a native file system operating on the computer system.Type: ApplicationFiled: September 10, 2015Publication date: March 16, 2017Inventors: Sosuke Matsui, Tsuyoshi Miyamura, Yutaka Oishi, Takahiro Tsuda, Noriko Yamamoto
-
Patent number: 9595291Abstract: A method for writing data from a table to a tape includes setting a number of partitions on the tape, where the number of partitions is greater than or equal to a number of columns of the table to be written to the tape, and writing data from each column of the table to at least one partition of the tape, the at least one partition including two or more wraps, the data is written from a top of the two or more wraps towards a bottom of the two or more wraps in a direction of a width of the at least one partition. The written data is reciprocated from a beginning of the tape to an end of the tape in a longitudinal direction of the tape such that writing of a last data entry of one column ends at a beginning of the two or more wraps.Type: GrantFiled: April 27, 2016Date of Patent: March 14, 2017Assignee: International Business Machines CorporationInventors: Kousei Kawamura, Koichi Masuda, Sosuke Matsui, Yutaka Oishi, Takahiro Tsuda
-
Patent number: 9547452Abstract: Various embodiments are provided for saving a log data in a hierarchical storage management system using a disk system as a primary cache with a tape library as a secondary cache. The user data is stored in the primary cache and written into the secondary cache at a subsequent period of time. Blank tapes in the secondary cache are prepared for storing the user data and the log data, based on priorities. At least one of the blank tapes is selected for copying the log data and the user data from the primary cache to the secondary cache based on priorities.Type: GrantFiled: February 4, 2016Date of Patent: January 17, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Norie Iwasaki, Koichi Masuda, Tadaaki Minoura, Tomokazu Nakamura, Takeshi Sohda, Takahiro Tsuda
-
Publication number: 20160154599Abstract: Various embodiments are provided for saving a log data in a hierarchical storage management system using a disk system as a primary cache with a tape library as a secondary cache. The user data is stored in the primary cache and written into the secondary cache at a subsequent period of time. Blank tapes in the secondary cache are prepared for storing the user data and the log data, based on priorities. At least one of the blank tapes is selected for copying the log data and the user data from the primary cache to the secondary cache based on priorities.Type: ApplicationFiled: February 4, 2016Publication date: June 2, 2016Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Norie IWASAKI, Koichi MASUDA, Tadaaki MINOURA, Tomokazu NAKAMURA, Takeshi SOHDA, Takahiro TSUDA