Abstract: An arithmetic processing apparatus includes a memory; and a processor coupled to the memory and configured to: acquire input data and output data in each of a plurality of operations using predetermined data for an information processing including the plurality of operations of a floating-point format to, extract a specific operation represented by a complicated function including at least a transcendental function among the plurality of operations, obtain an alternative function having a smaller computation amount than the complicated function in the extracted specific operation based on the input data, and substitute the specific operation in the information processing with the alternative function.

Abstract: A data conversion apparatus for converting circuit description related to a dynamically-reconfigurable circuit to circuit configuration information, the data conversion apparatus includes a first generation section that generates a data flow graph from the circuit description; a segment count determining section that determines a number of segments for segmenting the data flow graph generated by the first generation section; a virtual circuit creating section that creates a virtual circuit that has as many resources of the dynamically-reconfigurable circuit as the number of the resources multiplied by the number of segments determined by the segment count determining section; a second generation section that generates, from the circuit description, a data flow graph corresponding to the virtual circuit created by the virtual circuit creating section; and a conversion section that allocates and adjusts the resources of the virtual circuit in accordance with the data flow graph.

Abstract: A dynamic reconfiguration supporting method that generates a driver function to cause a dynamic reconfiguration circuit to execute a program of an application described in a predetermined language, includes acquiring a configuration defining file representing a configuration of a cluster of the dynamic reconfiguration circuit in execution of the process of the application, generating an address map representing an address of a processing element (to be referred to as “PE” hereinafter) in the cluster on the basis of the configuration defining file acquired by the acquiring operation, generating a driver function that associates the function and an address of the PE which executes the function with reference to the address map, when a PE which executes a function described in the application is allocated from the PE, and creating a driver function file that stores the driver function.

Abstract: A data conversion apparatus for converting circuit description related to a dynamically-reconfigurable circuit to circuit configuration information, the data conversion apparatus includes a first generation section that generates a data flow graph from the circuit description; a segment count determining section that determines a number of segments for segmenting the data flow graph generated by the first generation section; a virtual circuit creating section that creates a virtual circuit that has as many resources of the dynamically-reconfigurable circuit as the number of the resources multiplied by the number of segments determined by the segment count determining section; a second generation section that generates, from the circuit description, a data flow graph corresponding to the virtual circuit created by the virtual circuit creating section; and a conversion section that allocates and adjusts the resources of the virtual circuit in accordance with the data flow graph.

Abstract: A dynamic reconfiguration supporting method that generates a driver function to cause a dynamic reconfiguration circuit to execute a program of an application described in a predetermined language, includes acquiring a configuration defining file representing a configuration of a cluster of the dynamic reconfiguration circuit in execution of the process of the application, generating an address map representing an address of a processing element (to be referred to as “PE” hereinafter) in the cluster on the basis of the configuration defining file acquired by the acquiring operation, generating a driver function that associates the function and an address of the PE which executes the function with reference to the address map, when a PE which executes a function described in the application is allocated from the PE, and creating a driver function file that stores the driver function.

Abstract: The apparatus according to the present invention adds a sequence of instructions for recording a maximum of two sets of values assigned to variables in the procedure under the first execution and whose appearance frequencies can reach 50% or more and their appearance frequencies to the intermediate data of a source program to obtain primary profile information after the end of a first execution. Further it adds another sequence of instructions for recording the appearance frequencies of the values of the primary profile information and the execution frequency of the procedure to the intermediate data to obtain final profile information after the end of a second execution. Then, it calculates a value whose appearance frequency with respect to a variable is 50% or more on the basis of the final profile information to optimize the procedure regarding this value and thereby generate an object program.

Abstract: The apparatus according to the present invention adds a sequence of instructions for recording a maximum of two sets of values assigned to variables in the procedure under the first execution and whose appearance frequencies can reach 50% or more and their appearance frequencies to the intermediate data of a source program to obtain primary profile information after the end of a first execution. Further it adds another sequence of instructions for recording the appearance frequencies of the values of the primary profile information and the execution frequency of the procedure to the intermediate data to obtain final profile information after the end of a second execution. Then, it calculates a value whose appearance frequency with respect to a variable is 50% or more on the basis of the final profile information to optimize the procedure regarding this value and thereby generate an object program.

Abstract: According to the present invention, the compiler inputs a plurality of pieces of source data composing a large-scale program on basis of an user-designated information, subjects the source data to syntax analysis, and analyzes attributes of a relation between caller (parent procedure) and callee (child procedure) in the source data from the result of the syntax analysis and registers the attribute in a data table. Then, if the the callee is not registered in the data table, the compiler marks the attributes of the caller procedure with “optimization unnecessary” and then optimizes other procedures excluding the parent procedure marked with “optimization unnecessary”.

Abstract: A compiling system includes a first unit for converting a source program into an intermediate text formed of intermediate codes, each of the intermediate codes having a portion used to explicitly indicate information regarding a state of computer hardware, the computer hardware being operated in accordance with a machine language program, and a second unit for generating a machine language program using the intermediate codes of the intermediate text. In addition, a compiling system includes a first unit for converting a source program into an intermediate text formed of intermediate codes, each of the intermediate codes having a portion used to define a plurality of values, and a second unit for generating a machine language program using the intermediate codes of the intermediate text.

Abstract: When a flow graph is created for a program including a complex if statement, the respective branch conditions in the complex if statement are separated and the flow graph designating the control flow corresponding to the logical value of respective branch conditions are created. Next, to perform the branch probability determining/allocating process, in the above flow graph, the value corresponding to the number of executions of respective paths is calculated so that the whole branch probability of the complex if statement designated by the optimization designating statement and the branch probability of respective branch conditions is assigned to the path corresponding to respective branch conditions.