Hitachi, Ltd.

Takayoshi Iitsuka

Takahiro Nakano

Junichi Hara

Koji Sonoda

Yutaka Takata

Sumio Kikuchi

Hiroshi Ohta

Takashi Hirooka

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.

Storage system

Storage system with improved de-duplication arrangement

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.

Snapshot creating method and apparatus

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.

Storage system, data migration managing system, and data migration managing method

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.

Parallel program generating method

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.

Method for analyzing array summary for loop including loop exit statement

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.

Compile method for reducing cache conflict

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 optimization process in accordance with the result of the last-mentioned interprocedural dataflow analysis.

Method of producing object program based on interprocedural dataflow

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. In a mode for carrying out the invention, not only the interim results of optimization but also the contents of optimization executed are recorded. Upon recompilation, those of the optimization processings executed in the preceding compilation which are to be executed again can be performed rapidly by making use of the contents stored. The time taken for the execution of optimization processing to be re-executed can be reduced significantly.

Growing community of inventors

Sagamihara, Japan

Takayoshi Iitsuka