JP2540605B2 - Data flow computer execution detection method - Google Patents

Description

The present invention relates to an execution detection method of a non-Neumann type data flow computer that translates a program written in a high-level language into a target language by a compiler and executes the program.

<Prior art> With the recent rapid development of information processing technology, the demand for high-speed processing of a large amount of data such as image information has increased.
Research and development of a non-Neumann-type data flow computer with a hardware configuration that replaces the conventional sequential control type Neumann-type computer with a hardware configuration that allows parallel execution of any multiple instructions in a program when the input data is ready. It is being put to practical use. This data flow computer translates a program written in a high-level language into an instruction cell consisting of a target language, that is, an instruction, a node number of the next process, and an operand by a compiler, and then, when all the operands of the instruction cell are complete, the instruction cell Is sent to a plurality of arithmetic units connected by a network and instructions are executed in parallel to speed up arithmetic processing.

<Problems to be Solved by the Invention> However, in the conventional data flow computer, since the execution order of each instruction cell is not constant because the above-described parallel operation is performed, each step of each step is not performed on a program written in a high-level language. It is difficult to find the end, that is, the breakpoint, and it is not possible to confirm the execution of one step of high-level language,
It has the drawback that it cannot be debugged. However, since this data flow computer itself has just recently been put into practical use, a system for detecting the execution of one step of a high-level language has not yet been established or even proposed.

Therefore, an object of the present invention is, in a non-Neumann type data flow computer that translates and executes a high-level language into a target language, a data flow computer that detects execution of one step of a high-level language and enables processing such as debugging. It is to provide a method of detecting execution of.

<Means for Solving the Problem> In order to achieve the above object, the execution detection method of the data flow computer according to the present invention is sequentially added by the compiler to the target language included in each step of the program written in the high-level language. Of the node numbers, a table storing the start node number and the end node number in association with the step number of the step, and the node number of the next process included in the target language being executed are the start node number of the given step. The determination means for determining whether or not the number is equal to or less than the end node number by referring to the above table, and a flag for interrupting the process being executed and generating an interrupt when the determination means determines that the result is affirmative Equipped with a stand-up detection display unit, the process can be interrupted immediately before any step of a program written in a high-level language. It is characterized by having been made possible.

<Operation> In the table of the data flow computer, the step number of each step of the program written in the high-level language, the node number of the first target language and the node number of the last target language of the step when translated by the compiler And are stored in association with each other. When executing the program, the discriminating means uses the above table to determine whether the node number of the next process included in the target language of the step being executed is equal to or greater than the start node number of the given step and equal to or less than the end node number. Determine by referring to it. Then, the detection display means sets a flag for interrupting the process being executed and causing an interrupt when the determination means determines affirmative. The data flow computer interrupts the processing immediately before the previously given step requiring the interrupt processing such as debugging by the flag.

<Examples> Hereinafter, the present invention will be described in detail with reference to illustrated examples.

FIG. 1 shows a table used in the execution detection method of the data flow computer of the present invention. The program to be executed by the data flow computer is described in a high-level language in the order of steps (see sentences 1 to n in FIG. 1), and the high-level language of each step is translated into a plurality of target languages subdivided by a compiler. . Now, the program (statement n) of the nth step is f = (a + b) as shown in FIG.
When representing xc + dxe, the compiler sub-translates this program into a plurality of target languages and adds a node number, which is a serial number, indicating the processing order to each target language. That is, the processing content of each node (target language) is #
1 is d × e, # 2 is a + b, # 3 is (result of # 2) × c, # 4
Is (result of # 3) + (result of # 1). The compiler uses the start node number # 1 at the beginning of the nth step above.
The end node number # 4 at the end and the end node number # 4 are stored in the table as shown in FIG. 1 in association with the step number n, and the other steps are stored in the same manner as in sentence 1 → # p, #q.

FIG. 3 is a diagram schematically showing the hardware structure of a data flow computer adopting the execution detection method of the present invention. In the figure, 1 is a program storage unit for storing a program in a target language translated by a compiler, 2 is a calculation unit including a plurality of calculation units such as adders and multipliers, and 3 is an external unit for storing data to be processed. Memory 4 is a communication network that connects these parts in a loop,
A data waiting unit 5 is provided in the communication network 4a between the program storage unit 1 and the arithmetic unit 2, and waits until the operands of the target language (command cell) sent from the program storage unit 1 are complete, 6 is the arithmetic unit 2
Is provided in the communication network 4b for sending the calculation result of the instruction cell to the program storage unit 1, and the interrupt flag is set based on the determination result of the determination means for checking the node number of the next process included in the instruction cell. It is a data detection unit provided with an upright detection display means.

The discriminating means determines whether or not the node number of the next process included in the command cell being executed on the communication network 4b is greater than or equal to the start node number of the given step and less than or equal to the end node number. Refer to the table to determine. And when this determination means determines affirmative,
The detection display means is configured to set a flag for interrupting the process being executed and causing an interrupt,
These discriminating means and detection display means are specifically configured by the CPU of the data flow computer.

The execution detection method of the data flow computer having the above configuration will be described below with reference to the flowchart of FIG.

First, in step S1, the compiler translates a program written in a high-level language into target languages in order of steps, adds a node number to each target language, and starts,
The end node number is taken out and the reference table of FIG. 1 is created. Next, in step S2, the debugger is activated to download the table of FIG. 1 to the data detection unit 6, and in step S3, when the operator specifies the program step (statement number) to be detected, the debugger Sets the start and end node numbers in the data detector 6 and sets a breakpoint. When the detection is started in step S4, the discriminating means of the data detection unit 6 is set to
Then, it is determined whether or not the node number of the next process included in the instruction cell (target language) sent to the communication network 4b is within the set start and end node numbers. Then, when it is determined to be no, the determination for the next instruction cell is repeated, and when it is determined to be affirmative, the program step to which the node number of the next process is assigned is recognized as the affirmative program step, and step S6 is performed. In step S6, the detection display means sets an interrupt flag for debugging in step S6. When the interrupt flag is set, the operator determines in step S7 whether debugging is necessary,
If unnecessary, the process returns to step S5, while if necessary, the process proceeds to step S8 to print or display the variable at the breakpoint, and referring to this, the error of the program or system is detected, diagnosed and corrected.

As described above, in the data flow computer of the above embodiment, the node numbers of the start and end in each step of the high-level language program and their step numbers are used by using the node numbers sequentially added to the target language translated by the compiler. While creating a table that associates
The data detection unit 6 determines whether or not the node number of the next process included in the processed instruction cell (target language) sent via the communication network 4b is within the start and end node numbers of the detection target step. The determination is made by referring to the table by the means, and when it is determined that it is present, the detection and display means sets an interrupt flag, so that the execution can be interrupted immediately before an arbitrary step of the program and the processing such as debugging can be surely performed.

Needless to say, the execution detection method of the data flow computer of the present invention is not limited to the illustrated embodiment.

<Effects of the Invention> As is clear from the above description, the execution detection method of the data flow computer according to the present invention uses the node numbers sequentially added to the target language translated by the compiler to execute each step of the high-level language program. While creating a table associating the node numbers of the target language of start and end in the inside with the step numbers, the node number of the next process included in the target language being executed is the start and end node numbers of the detection target step. It is written in a high-level language because the determination means determines whether or not it is in the table, and when the determination means determines that it is affirmative, the detection display means sets an interrupt flag. Execution is interrupted immediately before an arbitrary step of the program, and processing such as debugging in a dataflow computer, which was previously impossible, Can be reliably performed.

[Brief description of drawings]

FIG. 1 is a diagram showing a table used in an execution detection system of a data flow computer of the present invention, FIG. 2 is a diagram showing an example of a data flow of one step of a high-level language program, and FIG.
FIG. 4 is a schematic diagram showing the hardware structure of a data flow computer adopting the execution detection method of the present invention, and FIG. 4 is a flow chart showing the flow of processing of the execution detection method. 1 ... Program storage section, 2 ... Calculation section, 4 ... Communication network, 6 ... Data detection section (discrimination means, detection display means).

Continuation of the front page (56) References JP 61-213936 (JP, A) Hiraki et al. "Maintenance architecture of SIGMA-1, a data driven computer for scientific and technological calculation" IPSJ 31st Annual Conference Lecture Proceedings Vol. I, No. 6D-3 (1985-9-11) PP. 159-160 Kondo et al. "Development of data flow graph / programming system" Proceedings of the 34th National Congress of IPSJ Vol. ▲ II, No. 7S-7 (1987-3-18-20) PP. 1073-1074 Maejima et al. "Supporting Environment in Data Driven Logic (DDL) Programming" Technical Report of IEICE Vol. 87, No. 304 (SE87-144) (1981) PP. 79-84

Claims (1)

(57) [Claims] 1. A data flow computer having a compiler for translating a program written in a high-level language into a target language, the start node among node numbers sequentially added by the compiler to the target language included in each step of the program. Table that stores the number and end node number in association with the step number of that step, and the node number of the next process included in the target language being executed is greater than or equal to the start node number of the given step and the end node number It is provided with a discriminating means for discriminating whether or not it is the following, by referring to the table, and a detection display means for setting a flag for interrupting the process being executed when the discriminating means judges affirmative and generating an interrupt. Process can be interrupted just before any step of a program written in a high-level language. A method for detecting execution of a data flow computer, which is characterized in that it is enabled.