JPS5856152A - Program converting device - Google Patents

Abstract

PURPOSE:To effectively utilize the performance of a computer system which have plural arithmetic units capable of performing parallel operation by converting instructions of a developed program, etc., which can not be executed in parallel into instructions which can be executed in parallel. CONSTITUTION:A prescribed number of sentences of a program to be converted are inputted to an input buffer 1 at every time. Once a D0 sentence detecting means 2 detects a D0 sentence, the sentence and a succeeding execution sentence are transferred to a working register 4. Then, a redefinition detecting means 5 detects whether a variable is redefined or not. When not, a selector 6 is controlled to output the sentence to an output buffer 10. When the variable is redefined, the index value of a step for the redefinition is calculated by an index value detecting means 7 and on the basis of the value, a D0 loop deviding means 8 generates plural D0 loops newly and outputs them to the output buffer 10.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a program conversion device, and is particularly effective when used in a computer that is equipped with a plurality of arithmetic processing units that can operate in parallel and aims for high throughput. In order to increase this, the program is converted to include as many parts that can be processed in parallel as possible.

For example, o-loops as shown below commonly appear. N Mu (J) - Mu (J) 10 B (J) * Mu (1) 10 0
ONT Engineering When executing on a computer with such a program conversion device arithmetic unit, if the variable A in the inner DO loop is
(1) If t can be regarded as a constant number, J-
Parallel processing can be performed by fully sharing half of the N steps from 1 to N. However, in the above example, when J becomes equal to engineering, the value of A(1) changes (redefines). The value of A (1) differs between the range where vJ is larger than ku and the range where J is smaller than ku. Therefore, it is not possible to simply divide the work between two arithmetic units, and in the past, such loops had to be processed in series.

The purpose of the present invention is to solve such conventional problems, and Figure 0, which will be explained below with reference to the drawings, is a block diagram of one embodiment of the present invention, and for the sake of simplicity, only the parts directly related to the present invention will be shown. Although this is shown, further compiler functions etc. may be added to this.

In the figure, the program to be converted is input to the input buffer in units of a predetermined number of sentences. The DO sentence detection means 2 detects the presence or absence of all DO sentences from among the command sentences of human sentences. If there is no DO statement, the selector 3 is controlled and the output is sent to the it output buffer l via the OR gate 9.

When a DO statement is detected, that sentence and the following executable statement (such as an equation) are moved to the work register number. Set it ^
The definition detection means 5 detects whether or not a variable has been redefined. The presence or absence of redefinition can be determined by, for example, whether or not the same variable name exists on both sides of the equal sign (-) in the above example, and if so, whether the variable name is the same or not.
It is sufficient to check whether there is a possibility that the i/dex values are the same even though the indexes are different.

Same, here "f number" refers to AOLB in the above example)
, the "index" is , J, and the "index value J is the value obtained by substituting a specific numerical value. Also, when we simply say "variable", we mean the variable name specified by the specific index value. Also, even if redefinition may occur, there is no problem as long as the variable after the redefinition is not used again in the same -DO loop, so
In that case, it will not be considered a redefinition.

In this way, if there is no redefinition, the selector 6 is controlled to output to the output buffer 10.

When a redefinition occurs, the index value detection means calculates the index value of the step that causes the redefinition, and based on that value, the DO loose division means 8 generates a plurality of new DO loops. , output buffer 1
Output to 0. That is, in the above example, Do from J-1 to Engineering
Divide into a loop and a DO loop with J-work + 1-M1, and paste the original.

Replace with loop. An example of the results is shown below.

DOIOI-1,N DO20J-λ Engineering A (J) -A (J) 10 B (, T) * A (1) 20
C0NT Engineering NUI DOIOJ- Engineering +1. N A(J) −A(J)+ B(J)* A(1)10
C0NT Engineering NUI In this way, there is no redefinition in the first DO loop (DO20), so multiple computing units can share the task and perform parallel processing. The same applies to the second Do loop (DOlo). However, D.

20 and Do10 cannot be processed in parallel.

This is because the variable A(1) in Dolo cannot be determined until D020 is completed.

Also, if there are two or more variables to be redefined, DO
The number of loop divisions may also be three or more.

As described above, according to the present invention, instructions that cannot be executed in parallel in an already developed program are converted into instructions that can be executed in parallel, and the ability of a computer system having multiple arithmetic units that can operate in parallel is effectively utilized. becomes possible.

[Brief explanation of drawings]

The figure is a block diagram of an embodiment of the present invention, in which 1 is an input buffer, 2 is a DO statement detection means, 5 is a redefinition detection means, 7 is an index value detection means, 8 is a DO loop division means, 10
is the output buffer. Agent Patent Attorney Hiroshi Matsuoka

Claims (1)

[Claims] means for detecting the presence or absence of a DO loop in an input program; means for detecting the presence or absence of a redefinition of a variable in the armpit DO loop; means for determining an index value that causes the redefinition; A program conversion device that uses a 1-% image of a means for dividing a DO loop up to a value and a DO loop starting from the next value of the index value.