Abstract:
PROBLEM TO BE SOLVED: To fast run a compiled object program by extracting correctly the reduction, i.e., a loop pattern that frequently appears in a source program out of this source program. SOLUTION: The reduction is detected out of a loop (Step 21) and then converted into a loop that can be carried out effectively and in parallel (Step 22). Finally, the reduction communication is generated based on the converted loop and optimized (Step 23). The detection of reduction consists of three sub- steps. That is, a model is first produced in regard to the mask expression masking every substitute sentence in the loop. In other words, an expression tree concerning the execution condition of every substitute sentence is generated. Then it's decided whether the reduction consists of an expression tree of merged substitute sentences based on the expression tree of a prescribed conditional expression and also the data dependence relation.
Abstract:
PROBLEM TO BE SOLVED: To streamline the execution of a program by pre-fetching data necessary to execute it. SOLUTION: A system is provided for causing a computer to execute a recursive access instruction prior to a program subject to pre-fetching. In the system, query instructions to select records satisfying selection conditions from target tables and generate result tables are detected from iterative processing in the program. An initial query instruction to generate an initial table including variable values to be set prior to the start of the iterative processing in the program is generated. A recursive query instruction to generate, by each recursive query corresponding to the sequentially executed iterative processings, the next intermediate table to be referred to in the subsequent iterative processing from the target tables and an intermediate table including the result tables generated by the preceding target query instructions of the iterative processing is next generated. A final query instruction to generate a final table from the intermediate tables sequentially generated by the recursive queries is then generated. COPYRIGHT: (C)2007,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a compiler system which eliminates the trouble of requiring a long collection processing time even though the number of times for performing an execution path is appropriately collected, a compiler program, a recording medium, a compiling method, an execution time information generating device and an execution time information generation program. SOLUTION: This compiler system 10 for optimizing a program on the basis of the frequency at which each processing in a program of an optimization object is carried out is provided with a loop processing detecting part 110 for detecting the repeatedly executed loop processing in the program, a loop processing frequency collecting part 140 for collecting a loop processing frequency at which the loop processing is carried out in the program, an intra-loop processings frequency collecting part 150 for collecting an intra-loop processing frequency being a frequency at which a plurality of intra-loop processings included in the loop processing are respectively carried out with respect to the number of times when the loop processing is carried out, an intra-loop execution information generating part 160 for generating intra-loop execution information showing a frequency at which the plurality of intra-loop processings are respectively carried out when the program is performed on the basis of the loop processing frequency and the intra-loop processing frequency, and an optimizing part for optimizing the program on the basis of the intra-loop exectuion information. A frequency in which each processing of the program is carried out can be collected at a high speed. COPYRIGHT: (C)2004,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To maximize performance in distributed parallel computing using a plurality of accelerator devices.SOLUTION: A host computer comprises a profiler unit which performs performance analysis for data transmission speed and calculation speed for a range of a data size, a size optimization unit which determines a chunk size optimal for data transmission through a network on the basis of the data transmission speed and the calculation speed to which the performance analysis has been performed, an encapsulation unit which encapsulates data into a chunk with the optimal chunk size by dividing or aggregating the data of a certain size stored in memory of the host computer, and a dispatcher unit which distributes the encapsulated data to accelerator devices and gives the accelerator devices an instruction to perform pipeline calculation for the encapsulated data received.
Abstract:
PROBLEM TO BE SOLVED: To provide a mechanism for stopping only a thread in which a fault is caused or a fault may be caused from another thread without stopping the whole system having a locked thread. SOLUTION: A computer system stores a program including a code for a critical section, wherein the critical section includes an instruction for writing or reading a value to/from a shared data area in a memory. The instruction acquires lock for the critical section before the start of an initial instruction in the critical section, writes a value in a thread local area in the memory instead of writing the value in the shared data area in response to a writing instruction to the shared data area, writes the value written in the thread local area in the shared data area in response to the end of a final instruction in the critical section, and unlocks the critical section. COPYRIGHT: (C)2010,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a cache system effective even in an insert only type application wherein a record of data imparted with the same identification information is added to a database every time creation, update, or deletion of the data is performed. SOLUTION: A data holding part for caching the data read from the database includes: a hash table 410 registered with the identification information of the data; and a map 420 for storing a map entry showing the record individually associated to the identification information registered in the hash table 410, having the identification information in the database. The cached data are associated to the map entry by the identification information and timestamp information that is information for specifying the record, and are held. COPYRIGHT: (C)2010,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To avoid the waste of overhead and analytic processing by efficiently performing the precision assurance of a single precision operation and a double precision operation in a floating-point operation. SOLUTION: In a compiler 100 mounted on a computer, an object code of a method is generated in a double precision mode in the floating-point operation and a second code of the method is generated in a single precision mode when the method is frequently called in the single precision mode and processing costs can be reduced by implementing the method in the single precision mode. Otherwise, the object code is generated by setting operation precision according to a kind of an operation in a target method to be compiled irrespective of which of the double precision mode and the single precision mode in the floating-point operation is called, a code for matching the precision modes is generated and added based on a relation between the target code and other code for calling the target code or other code called by the target code. COPYRIGHT: (C)2004,JPO
Abstract:
PROBLEM TO BE SOLVED: To provide a data structure for satisfying specifications of JAVA code, executing the JAVA code with high speed and efficiency; and to provide an execution method of the JAVA code using the data structure, since there is a great difference in language specifications between a COBOL language and a JAVA (R) language, and when converting a COBOL code into a JAVA code, how the JAVA code efficiently achieves processing described on the COBOL code greatly depends on the design of the data structure. SOLUTION: A computer system executing a program including a JAVA code converted from a COBOL code includes a storage unit storing a program including a JAVA code having at least one declaration of an object of which the data type is a wrapper class that is declaration converted from each declaration of data items included in the COBOL code; and a CPU reading out the program from the storage unit to execute the program. COPYRIGHT: (C)2010,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To furthermore improve the efficiency of access to a database. SOLUTION: A system for controlling access to the database is provided with: an acquisition part for acquiring an access program including a plurality of access instructions to the database; a detection part for detecting a plurality of mutually different tables to be accessed by the plurality of access instructions; a combination control part for executing a combination instruction for acquiring a result table obtained by combining the plurality of detected tables from the database prior to the execution of the plurality of access instructions; and a conversion control part for executing a conversion instruction for extracting records accessed by the plurality of access instructions from the result table and converting the extracted records into structure allowed to be accessed by the plurality of access instructions prior to the execution of the plurality of access instructions. COPYRIGHT: (C)2007,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To accelerate transaction processing to a data base from before. SOLUTION: The information processing system which performs the transaction processing to the data base includes a processing program acquiring section for acquiring a processing program which is program transaction processing to the data base being described to be, an object data selecting section which selects at least one object data used as an object accessed by transaction processing of the transaction program of the data base, and a rewriting processing insertion section which inserts object data rewriting processing which rejects the object data updated by the transaction processing among the object data to the data base into the section performed after the accessing object data finally before committing processing result in the processing program. COPYRIGHT: (C)2006,JPO&NCIPI