Patents by Inventor Takamasa Hirata
Takamasa Hirata 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).
-
Patent number: 9218130Abstract: A mechanism is provided for tape writing of small transactions. A first file is written as a plurality of fixed-length data sets (DS), the DS number of the final DS in the plurality of DS is stored in memory as #N(DS#N) and the WP number as #M(WP#M), and the final first file and the second file in the DS following the final DS(DS#N, WP#M) containing the first file are packed and written in sequential DS units, and are stored as DS#N, DS#N+1, etc. and WP#M+1 in sequential order in DS containing the second file. The remaining first, second, or third file is packed and DS#N with WP#M is overwritten as DS#N with WP#M+2, and the remaining #N in the DS numbers of the second file and the third file in the subsequent DS are written as DS#N+1, N+2, etc. with WP#M+2, and the DS#N, #N+1, #N+2, etc. with WP#M+2 are stored.Type: GrantFiled: December 9, 2014Date of Patent: December 22, 2015Assignee: International Business Machines CorporationInventors: Takamasa Hirata, Setsuko Masuda, Yuhko Mori, Yutaka Oishi, Terue Watanabe
-
Publication number: 20150169618Abstract: 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.Type: ApplicationFiled: February 20, 2015Publication date: June 18, 2015Inventors: Tohru Hasegawa, Takamasa Hirata, Naoki Imai, Masanori Kamiya, Yutaka Oishi
-
Publication number: 20150100724Abstract: A mechanism is provided for tape writing of small transactions. A first file is written as a plurality of fixed-length data sets (DS), the DS number of the final DS in the plurality of DS is stored in memory as #IN(DS#N) and the WP number as #M(WP#M), and the final first file and the second file in the DS following the final DS(DS#N, WP#M) containing the first file are packed and written in sequential DS units, and are stored as DS#N, DS#N+1, etc. and WP#M+1 in sequential order in DS containing the second file. The remaining first, second, or third file is packed and DS#N with WP#M is overwritten as DS#N with WP#M+2, and the remaining #N in the DS numbers of the second file and the third file in the subsequent DS are written as DS#N+1, N+2, etc. with WP#M+2, and the DS#N, #N+2, etc. with WP#M+2 are stored.Type: ApplicationFiled: December 9, 2014Publication date: April 9, 2015Inventors: Takamasa Hirata, Setsuko Masuda, Yuhko Mori, Yutaka Oishi, Terue Watanabe
-
Patent number: 9002807Abstract: 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.Type: GrantFiled: October 10, 2012Date of Patent: April 7, 2015Assignee: International Business Machines CorporationInventors: Tohru Hasegawa, Takamasa Hirata, Naoki Imai, Masanori Kamiya, Yutaka Oishi
-
Patent number: 8972654Abstract: A mechanism is provided for tape writing of small transactions. A first file is written as a plurality of fixed-length data sets (DS), the DS number of the final DS in the plurality of DS is stored in memory as #N(DS#N) and the WP number as #M(WP#M), and the final first file and the second file in the DS following the final DS(DS#N, WP#M) containing the first file are packed and written in sequential DS units, and are stored as DS#N, DS#N+1, etc, and WP#M+1 in sequential order in DS containing the second file. The remaining first, second, or third file is packed and DS#N with WP#M is overwritten as DS#N with WP#M+2, and the remaining #N in the DS numbers of the second file and the third file in the subsequent DS are written as DS#N+1, N+2, etc. with WP#M+2, and the DS#N, #N+1, #N+2, etc. with WP+M+2 are stored.Type: GrantFiled: March 23, 2011Date of Patent: March 3, 2015Assignee: International Business Machines CorporationInventors: Takamasa Hirata, Setsuko Masuda, Yuhko Mori, Yutaka Oishi, Terue Watanabe
-
Publication number: 20150032251Abstract: 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.Type: ApplicationFiled: October 14, 2014Publication date: January 29, 2015Inventors: Tohru Hasegawa, Takamasa Hirata, Naoki Imai, Masanori Kamiya, Yutaka Oishi
-
Patent number: 8914145Abstract: 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.Type: GrantFiled: February 15, 2013Date of Patent: December 16, 2014Assignee: International Business Machines CorporationInventors: Tohru Hasegawa, Takamasa Hirata, Naoki Imai, Masanori Kamiya, Yutaka Oishi
-
Patent number: 8903539Abstract: 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.Type: GrantFiled: November 21, 2012Date of Patent: December 2, 2014Assignee: International Business Machines CorporationInventors: Tohru Hasegawa, Takamasa Hirata, Naoki Imai, Masanori Kamiya, Yutaka Oishi
-
Patent number: 8903538Abstract: 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.Type: GrantFiled: November 21, 2012Date of Patent: December 2, 2014Assignee: International Business Machines CorporationInventors: Tohru Hasegawa, Takamasa Hirata, Naoki Imai, Masanori Kamiya, Yutaka Oishi
-
Patent number: 8897911Abstract: 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.Type: GrantFiled: February 14, 2013Date of Patent: November 25, 2014Assignee: International Business Machines CorporationInventors: Tohru Hasegawa, Takamasa Hirata, Naoki Imai, Masanori Kamiya, Yutaka Oishi
-
Patent number: 8780474Abstract: In a controller of a tape drive, a CM input-output unit recognizes a tape format; a tape variable acquisition unit acquires tape variables; a setting variable acquisition unit acquires setting variables; and a minimum number calculator calculates a minimum number m of sub datasets, which are to be written to a tape to secure resistance to burst error, by using the tape variables and setting variables. When a command processor receives a synchronization command, the buffer manager generates n sub datasets for storing data in the buffer. If n is smaller than m, m sub datasets are padded out and set as write data. If n is m or more, the n sub datasets are set as write data. Then, the channel input-output unit writes the write data to the tape.Type: GrantFiled: June 24, 2011Date of Patent: July 15, 2014Assignee: International Business Machines CorporationInventors: Takamasa Hirata, Setsuko Masuda, Yuhko Mori, Yutaka Oishi, Tomoko Taketomi, Terue Watanabe
-
Patent number: 8781621Abstract: The present description is directed to moving a cartridge including a storage medium between library strings (LS) using a car able to move within a shuttle connection in a shuffle complex system in which, in one embodiment, a first cartridge is to be moved from a first LS to a second LS, a car located in the LS nearest to the first LS due to movement of a second cartridge is used to move the second cartridge to the first LS , and the empty car is used to move the first cartridge from the first LS to the second LS. In one aspect, movement of empty cars may be reduced, and cartridges may be moved between library strings more efficiently in less time. Other features and aspects are described.Type: GrantFiled: July 19, 2013Date of Patent: July 15, 2014Assignee: International Business Machines CorporationInventors: Takamasa Hirata, Naoki Imai, Norie Iwasaki, Masanori Kamiya
-
Publication number: 20140142743Abstract: 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.Type: ApplicationFiled: February 14, 2013Publication date: May 22, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Tohru Hasegawa, Takamasa Hirata, Naoki Imai, Masanori Kamiya, Yutaka Oishi
-
Publication number: 20140142741Abstract: 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.Type: ApplicationFiled: November 21, 2012Publication date: May 22, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Tohru Hasegawa, Takamasa Hirata, Naoki Imai, Masanori Kamiya, Yutaka Oishi
-
Publication number: 20140140803Abstract: 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.Type: ApplicationFiled: February 15, 2013Publication date: May 22, 2014Applicant: International Business Machines CorporationInventors: Tohru Hasegawa, Takamasa Hirata, Naoki Imai, Masanori Kamiya, Yutaka Oishi
-
Publication number: 20140030049Abstract: A library manager to determine a relay-point library string when a particular cartridge (specific cartridge) is moved to an empty drive (target drive) for mounting. A method for determining a relay-point library string includes: receiving a command to mount a cartridge in a library string located on one side of the relay-point library string; searching for the target drive among library strings, and finding the target drive in a library string on the other side of an interposed relay-point library string relative to the library string in which the specific cartridge is located; selecting a relay-point library string based on predetermined conditions to move the specific cartridge using shuttle connections to the found target drive; and searching to determine whether or there is a newly available drive in a relay-point library string other than the selected relay-point library string before the selected cartridge reaches the selected relay-point library string.Type: ApplicationFiled: July 21, 2013Publication date: January 30, 2014Applicant: International Business Machines CorporationInventors: Naoki Imai, Takamasa Hirata, Masanori Kamiya, Norie Iwasaki
-
Publication number: 20140031973Abstract: The present description is directed to moving a cartridge including a storage medium between library strings (LS) using a car able to move within a shuttle connection in a shuffle complex system in which, in one embodiment, a first cartridge is to be moved from a first LS to a second LS, a car located in the LS nearest to the first LS due to movement of a second cartridge is used to move the second cartridge to the first LS , and the empty car is used to move the first cartridge from the first LS to the second LS. In one aspect, movement of empty cars may be reduced, and cartridges may be moved between library strings more efficiently in less time. Other features and aspects are described.Type: ApplicationFiled: July 19, 2013Publication date: January 30, 2014Applicant: International Business Machines CorporationInventors: Takamasa Hirata, Naoki Imai, Norie Iwasaki, Masanori Kamiya
-
Publication number: 20130067158Abstract: A mechanism is provided for tape writing of small transactions. A first file is written as a plurality of fixed-length data sets (DS), the DS number of the final DS in the plurality of DS is stored in memory as #N(DS#N) and the WP number as #M(WP#M), and the final first file and the second file in the DS following the final DS(DS#N, WP#M) containing the first file are packed and written in sequential DS units, and are stored as DS#N, DS#N+1, etc, and WP#M+1 in sequential order in DS containing the second file. The remaining first, second, or third file is packed and DS#N with WP#M is overwritten as DS#N with WP#M+2, and the remaining #N in the DS numbers of the second file and the third file in the subsequent DS are written as DS#N+1, N+2, etc. with WP#M+2, and the DS#N, #N+1, #N+2, etc. with WP+M+2 are stored.Type: ApplicationFiled: March 23, 2011Publication date: March 14, 2013Applicant: International Business Machines CorporationInventors: Takamasa Hirata, Setsuko Masuda, Yuhko Mori, Yutaka Oishi, Terue Watanabe
-
Publication number: 20120002317Abstract: In a controller of a tape drive, a CM input-output unit recognizes a tape format; a tape variable acquisition unit acquires tape variables; a setting variable acquisition unit acquires setting variables; and a minimum number calculator calculates a minimum number m of sub datasets, which are to be written to a tape to secure resistance to burst error, by using the tape variables and setting variables. When a command processor receives a synchronization command, the buffer manager generates n sub datasets for storing data in the buffer. If n is smaller than m, m sub datasets are padded out and set as write data. If n is m or more, the n sub datasets are set as write data. Then, the channel input-output unit writes the write data to the tape.Type: ApplicationFiled: June 24, 2011Publication date: January 5, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Takamasa HIRATA, Setsuko MASUDA, Yuhko MORI, Yutaka OISHI, Tomoko TAKETOMI, Terue WATANABE
-
Patent number: 7865892Abstract: At the time of installing an installation-targeted OS in a computer, a supporting tool in a supporting medium carries out the following operations on the supporting tool OS. The operations include: storing information in a response file; copying a unique device driver and a DOS system file from the supporting medium to a hard disk; copying an installation file from the installation medium to the hard disk; and updating the installation file with a security patch file downloaded from the download server through a network. Thereafter, an installer is booted up from the DOS system file to install an OS by use of the response file, the unique device driver, and the installation file.Type: GrantFiled: October 30, 2006Date of Patent: January 4, 2011Assignee: International Business Machines CorporationInventors: Toshiyasu Motoki, Takamasa Hirata