Patents by Inventor Takayoshi Iitsuka
Takayoshi Iitsuka 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: 8244690Abstract: The present invention relates to a storage system including a de-duplicate function and a full-text search function or the like, and reduces an amount of index information about full-test search to save storage resource. In this system, a storage apparatus includes a processing unit for de-duplicating a plurality of files having the same content regarding a file group of data inputted/outputted through a host apparatus. A full-text search processing server performs a full-text search processing to the file group and includes a processing unit for causing the full-text search processing to correspond to de-duplicate. An index information creation processing performed to a plurality of target files having the same content by the full-text search processing unit is inhibited according to a status of de-duplicate to the file group by the processing unit. Thereby, the amount of index information can be reduced.Type: GrantFiled: June 13, 2011Date of Patent: August 14, 2012Assignee: Hitachi, Ltd.Inventor: Takayoshi Iitsuka
-
Publication number: 20110246431Abstract: The present invention relates to a storage system including a de-duplicate function and a full-text search function or the like, and reduces an amount of index information about full-test search to save storage resource. In this system, a storage apparatus includes a processing unit for de-duplicating a plurality of files having the same content regarding a file group of data inputted/outputted through a host apparatus. A full-text search processing server performs a full-text search processing to the file group and includes a processing unit for causing the full-text search processing to correspond to de-duplicate. An index information creation processing performed to a plurality of target files having the same content by the full-text search processing unit is inhibited according to a status of de-duplicate to the file group by the processing unit. Thereby, the amount of index information can be reduced.Type: ApplicationFiled: June 13, 2011Publication date: October 6, 2011Inventor: Takayoshi IITSUKA
-
Patent number: 7984026Abstract: The present invention relates to a storage system including a de-duplicate function and a full-text search function or the like, and reduces an amount of index information about full-test search to save storage resource. In this system, a storage apparatus includes a processing unit for de-duplicating a plurality of files having the same content regarding a file group of data inputted/outputted through a host apparatus. A full-text search processing server performs a full-text search processing to the file group and includes a processing unit for causing the full-text search processing to correspond to de-duplicate. An index information creation processing performed to a plurality of target files having the same content by the full-text search processing unit is inhibited according to a status of de-duplicate to the file group by the processing unit. Thereby, the amount of index information can be reduced.Type: GrantFiled: March 6, 2007Date of Patent: July 19, 2011Assignee: Hitachi, Ltd.Inventor: Takayoshi Iitsuka
-
Patent number: 7412578Abstract: In the storage-based snapshot creation, a block-selection specifying unit provided on a NAS processing unit specifies a block, which becomes necessary for the generation of snapshot data, to a specified-block analyzing unit within a disk apparatus. Moreover, a disk controller generates the snapshot data on the block specified as the snapshot target, while making an inquiry to the specified-block analyzing unit. This makes it possible to create the snapshot in a storage-capacity reduced manner, and to specify the snapshot creation in a partition, file, or directory unit.Type: GrantFiled: September 13, 2006Date of Patent: August 12, 2008Assignee: Hitachi, Ltd.Inventors: Junichi Hara, Takahiro Nakano, Koji Sonoda, Takayoshi Iitsuka, Yutaka Takata
-
Publication number: 20080155192Abstract: The present invention relates to a storage system including a de-duplicate function and a full-text search function or the like, and reduces an amount of index information about full-test search to save storage resource. In this system, a storage apparatus includes a processing unit for de-duplicating a plurality of files having the same content regarding a file group of data inputted/outputted through a host apparatus. A full-text search processing server performs a full-text search processing to the file group and includes a processing unit for causing the full-text search processing to correspond to de-duplicate. An index information creation processing performed to a plurality of target files having the same content by the full-text search processing unit is inhibited according to a status of de-duplicate to the file group by the processing unit. Thereby, the amount of index information can be reduced.Type: ApplicationFiled: March 6, 2007Publication date: June 26, 2008Inventor: Takayoshi Iitsuka
-
Patent number: 7281107Abstract: A data migration management system for preventing alteration such as rewriting or deletion, and migrating data between storage systems during an alteration prevention term. This data migration management system copies data from a logical device of a source storage system to a logical device of a destination storage system, and sets an alteration prevention setting for the destination logical device. Once the data migration management system acquires an alteration prevention status report from the destination storage system and confirms that the data has been migrated without alteration, it cancels the alteration prevention setting of the source storage system.Type: GrantFiled: June 10, 2005Date of Patent: October 9, 2007Assignee: Hitachi, Ltd.Inventor: Takayoshi Iitsuka
-
Publication number: 20070011418Abstract: In the storage-based snapshot creation, a block-selection specifying unit provided on a NAS processing unit specifies a block, which becomes necessary for the generation of snapshot data, to a specified-block analyzing unit within a disk apparatus. Moreover, a disk controller generates the snapshot data on the block specified as the snapshot target, while making an inquiry to the specified-block analyzing unit. This makes it possible to create the snapshot in a storage-capacity reduced manner, and to specify the snapshot creation in a partition, file, or directory unit.Type: ApplicationFiled: September 13, 2006Publication date: January 11, 2007Inventors: Junichi Hara, Takahiro Nakano, Koji Sonoda, Takayoshi Iitsuka, Yutaka Takata
-
Publication number: 20060236055Abstract: A data migration management system for preventing alteration such as rewriting or deletion, and migrating data between storage systems during an alteration prevention term. This data migration management system copies data from a logical device of a source storage system to a logical device of a destination storage system, and sets an alteration prevention setting for the destination logical device. Once the data migration management system acquires an alteration prevention status report from the destination storage system and confirms that the data has been migrated without alteration, it cancels the alteration prevention setting of the source storage system.Type: ApplicationFiled: June 10, 2005Publication date: October 19, 2006Applicant: Hitachi, Ltd.Inventor: Takayoshi Iitsuka
-
Patent number: 7120767Abstract: In the storage-based snapshot creation, a block-selection specifying unit provided on a NAS processing unit specifies a block, which becomes necessary for the generation of snapshot data, to a specified-block analyzing unit within a disk apparatus. Moreover, a disk controller generates the snapshot data on the block specified as the snapshot target, while making an inquiry to the specified-block analyzing unit. This makes it possible to create the snapshot in a storage-capacity reduced manner, and to specify the snapshot creation in a partition, file, or directory unit.Type: GrantFiled: February 21, 2003Date of Patent: October 10, 2006Assignee: Hitachi, Ltd.Inventors: Junichi Hara, Takahiro Nakano, Koji Sonoda, Takayoshi Iitsuka, Yutaka Takata
-
Publication number: 20040158764Abstract: A file server has plural NAS nodes having three processors dispersed in function, a shared cache memory shared between the plural NAS nodes and backed up by a battery, and plural storage devices. A log area for storing data with respect to an access request received by each NAS node is arranged in the shared cache memory. A network processor stores the data with respect to the access request to the log area, and transfers the data of the memory by a DMA at a reading time. Even when a failure is happened in a certain NAS node, another NAS node restores a file system using the log and continues processing to store the data with respect to the access request to the shared cache memory.Type: ApplicationFiled: March 21, 2003Publication date: August 12, 2004Inventors: Koji Sonoda, Takahiro Nakano, Naoto Matsunami, Takayoshi IItsuka, Yutaka Takata
-
Publication number: 20040103104Abstract: In the storage-based snapshot creation, a block-selection specifying unit provided on a NAS processing unit specifies a block, which becomes necessary for the generation of snapshot data, to a specified-block analyzing unit within a disk apparatus. Moreover, a disk controller generates the snapshot data on the block specified as the snapshot target, while making an inquiry to the specified-block analyzing unit. This makes it possible to create the snapshot in a storage-capacity reduced manner, and to specify the snapshot creation in a partition, file, or directory unit.Type: ApplicationFiled: February 21, 2003Publication date: May 27, 2004Inventors: Junichi Hara, Takahiro Nakano, Koji Sonoda, Takayoshi Iitsuka, Yutaka Takata
-
Patent number: 6622301Abstract: When converting a sequential execution source program into a parallel program to be executed by respective processors (nodes) of a distributed shared memory parallel computer, a compiler computer transforms the source program to increase a processing speed of the parallel program. First, a kernel loop having a longest sequential execution time is detected in the source program. Next, a data access pattern equal to that of the kernel loop is reproduced to generate a control code to control first touch data distribution. The first touch control code generated is inserted in the parallel program.Type: GrantFiled: February 8, 2000Date of Patent: September 16, 2003Assignee: Hitachi, Ltd.Inventors: Takashi Hirooka, Hiroshi Ohta, Takayoshi Iitsuka, Sumio Kikuchi
-
Publication number: 20030110481Abstract: A plurality of compiler directives are applied one by one to each program portion of a computer program including the program portions to be converted by the compiler directive to execute each program portion. An execution time of each program portion for each compiler directive is measured as a result of the execution. A compiler directive having a shortest execution time for each program portion is detected on the basis of the measured results. Each of the detected compiler directives is inserted into just before a relevant program portion to produce a program.Type: ApplicationFiled: July 17, 2002Publication date: June 12, 2003Inventors: Kiyomi Wada, Makoto Satoh, Takayoshi Iitsuka
-
Patent number: 6282704Abstract: A method for analyzing an array summary to improve the accuracy of an array summary analysis of a loop containing a loop exit statement, thereby to improve applicability of array privatization. If a loop exit statement and a statement that sets the value of a loop control variable at loop exit to a scalar variable are contained within a loop, the upper bound of the loop control variable of the loop is replaced by the scalar variable in the array summary of the loop body and the result of eliminating the loop control variable by a variable elimination method is defined as the array summary of the loop, whereby the array summary is computed without approximation.Type: GrantFiled: December 1, 1998Date of Patent: August 28, 2001Assignee: Hitachi, Ltd.Inventor: Takayoshi Iitsuka
-
Patent number: 5862385Abstract: A compiling method, for use with programs to be executed on a computer with cache memory, which programs would otherwise generate decreased performance due to cache conflicts arising from conflicting cache access(es), for reducing the generation of such cache conflict(s) by reordering the order of memory reference code in the program such that conflicting memory references do not start before the completion of memory accesses to a memory block.Type: GrantFiled: May 21, 1997Date of Patent: January 19, 1999Assignee: Hitachi, Ltd.Inventor: Takayoshi Iitsuka
-
Patent number: 5396627Abstract: A method of producing an object program from an inputted source program with a compiler using a computer, includes the steps of: performing an interprocedural dataflow analysis of a variable associated with a procedure such as a subroutine, function, and initialization subprogram; analyzing and summarizing a procedure call effect into a variable region having a possibility of modifying the value of a variable upon a procedure call, a variable region having a possibility of using the value of a variable, and a variable region having a necessity of defining the value of a variable, in accordance with the interprocedural dataflow analysis; and representing data reference at the procedure call by using the summary information, in the dataflow analysis of a procedure part including the procedure call, performing an interprocedural dataflow analysis while discriminating between a case where there is a possibility of data reference and a case where there is a necessity of data reference, and performing an optimizatiType: GrantFiled: September 1, 1992Date of Patent: March 7, 1995Assignee: Hitachi, Ltd.Inventor: Takayoshi Iitsuka
-
Patent number: 5230050Abstract: A program compiling method in which a procedure being compiled is split into a plurality of units referred to as segments, whereon optimization is carried out for each of the segments. Upon recompilation of the procedure, optimization of the procedure is redone not for the whole of the procedure but executed only on the segments which are affected by modification, while for the segments insusceptible to the influence of modification, object program obtained by the compilation or the intermediate codes available in the course of the optimization are reused. At several stages of optimization, intermediate results of the optimization are recorded, wherein upon recompilation, the intermediate results of optimization obtained in the preceding compilation are made use of up to the stage where no influence of modification makes appearance. The amount of processing involved in the optimization can thus be reduced even when the object program can not be utilized.Type: GrantFiled: February 5, 1990Date of Patent: July 20, 1993Assignee: Hitachi, Ltd.Inventors: Takayoshi Iitsuka, Sumio Kikuchi
-
Patent number: 5146594Abstract: A method of producing an object program from an inputted source program with a compiler using a computer, includes the steps of: performing an interprocedural dataflow analysis of a variable associated with a procedure such as a subroutine, function, and initialization subprogram; analyzing and summarizing a procedure call effect into a variable region having a possibility of modifying the value of a variable upon a procedure call, a variable region having a possibility of using the value of a variable, and a variable region having a necessity of defining the value of a variable, in accordance with the interprocedural dataflow analysis; and representing data reference at the procedure call by using the summary information, in the dataflow analysis of a procedure part including the procedure call, performing an interprocedural dataflow analysis while discriminating between a case where there is a possibility of data reference and a case where there is a necessity of data reference, and performing an optimizatiType: GrantFiled: November 2, 1988Date of Patent: September 8, 1992Assignee: Hitachi, Ltd.Inventor: Takayoshi Iitsuka