JP2594140B2 - Data driven data processor - Google Patents

Description

The present invention relates to a data-driven data processing device, and more particularly, to data having a function of preventing a queue memory in a data processing device from overflowing. The present invention relates to a driving type data processing device.

(B) Conventional technology Generally, a data-driven data processing device executes, as a program, a data flow graph in which various instructions are connected by arcs indicating a data flow, and includes a data value and control information. While data is transferred through various processing elements, control information is exchanged, data is copied, and instructions are executed along the data flow graph. Each processing element is configured to perform predetermined processing on the data in response to the arrival of the data, and the timing at which the data arrives at each processing element is not defined in advance. That is, the timing at which various processes such as input from the outside, output to the outside, and data duplication cannot be specified in advance.

Therefore, when a special process such as a data duplication process that requires a longer time than the normal process time occurs, the data that subsequently arrives at the processing element terminates the special process. I need to wait. Generally, in a data driven type data processing device, such data is temporarily stored in a queue memory and kept waiting. However, since the capacity of the queue memory is naturally limited, the queue memory may overflow. When such an overflow occurs, execution of the program becomes impossible, and execution must be stopped. In addition, even if the same program is re-executed, an overflow also occurs in the same manner. Therefore, it is necessary to change and correct the program (connection information of the data flow graph) and repeat the operation of re-executing the program. Such an operation generally requires a great deal of time, and therefore, a function of preventing overflow of a queue memory by hardware is required.

Conventionally, for example, a data driven type data processing apparatus disclosed on page 181 to page 218 of Nikkei Electronics published on April 9, 1984,
In the data driven type data processing device shown in “103037“ Queue memory device ”, a data queue (DQ) for waiting for data without data duplication and a generator queue for waiting for data with data duplication processing (GQ) to prevent overflow of the data queue (DQ) by stopping reading data from the generator queue (GQ) when the amount of data stored in the data queue (DQ) exceeds a certain level. ing.

(C) Problems to be solved by the invention However, in the above-mentioned conventional data processing device,
To prevent overflow of the data queue (DQ), another queue memory, the generator queue (GQ)
The problem is that the amount of hardware for the queue memory is increased, and as a result, the amount of hardware of the entire data processing device is increased.

Further, the above-mentioned conventional data processing apparatus has a problem that it does not have a function of preventing an overflow of a generator queue (GQ) for waiting for data accompanied by data duplication processing.

Therefore, an object of the present invention is to provide a queue memory of a single queue memory without a special queue memory of a special system, and to mix and wait data with data replication processing and data without data replication processing in a single queue memory. An object of the present invention is to provide a data-driven data processing device capable of comprehensively preventing overflow of a queue memory without requiring a large increase in the amount.

(D) Means for Solving the Problems The data-driven data processing device of the present invention has a queue memory that is centrally held at one location, and furthermore, a data amount monitor that monitors the amount of data in the queue memory. Means and a data duplicating means for duplicating data according to the amount of data staying in the queue memory.

(E) Operation In the data driven data processing apparatus of the present invention, the program storage means stores control information to be added to the arrived data in a table format in association with the node identifier (node number) of the data flow graph. Is stored in When data is replicated inside the processing apparatus according to the data flow graph, this table is continuously accessed by the data replication means, and various control information is added to the same data and continuously output from the program storage means. You. During this time, the output from the queue memory is prohibited, and the input data to the queue memory stays inside the queue memory. The data amount monitoring means monitors the amount of data staying in the queue memory and notifies the data duplication means. When the data staying amount is smaller than a predetermined value,
In response to the arrival of one piece of data, a number of pieces of data are continuously output according to a program (data flow graph). That is, at this time, in principle, the number of data to be copied according to the arrival of one data is unlimited.

On the other hand, when the data staying amount becomes equal to or more than the predetermined value, the upper limit value of the number of data to be copied is limited to a small value (for example, 2) according to arrival of one data. As a result, the output time of the queue memory can be suppressed to a short time, and the amount of data in the processing device and the amount of data input to the queue memory can be suppressed from increasing. It can be prevented beforehand.

(F) Embodiment FIG. 1 shows an outline of a data flow computer system as an example of a system using a data driven type data processing device of the present invention. The system shown in FIG. 1 is connected to a ring network (RN) which is a ring-shaped transfer path for transferring a data packet (a combination of original data values and control information) which is a basic unit of data in the system. Is part of the ring network (RN) and controls the input and output of data packets by using a network interface (NIF) (NI
F) (NIF1)... (NIFn) via the host interface (HI), data storage device (DM), data flow calculation device 1 (DFC1),.
(DFCn), and a host computer (HC) is further connected to the host interface (HI).

The combination of the data flow calculator n (DFCn) and the network interface (NIFn) of the system
It operates as a ring-shaped data driven type data processing device, and executes a data driven type (data flow type) program described by a data flow graph.
Specifically, first, from the host computer (HC), the host interface (HI) and the network interface (NI
F), a data flow calculation device n (DF) via a ring network (RN) and a network interface (NIFn).
Cn), the program is downloaded, and then, when a start packet, which is a data packet for starting the execution of the program, is input to the data flow calculation device n (DFCn) on the same path, the execution of the program is started, and the execution of the program is started. Is completed, an end packet, which is a data packet indicating the end of execution, is sent to the data flow calculation device n (DFCn).
To network interface (NIFn), ring network (RN), network interface (NI
F), and output to the host computer (HC) via the host interface (HI).

FIG. 2 shows a schematic configuration of a data driven type data processing device of the present invention. In the apparatus shown in the figure, (Q) is a queue memory, (PM) is a program storage means, (NIF) is a network interface, (FC) is an ignition control means, and (EXE).
Is an instruction execution means, and each processing element is connected in a ring shape. (1) to (30), (40) and (50) are data lines.

The outline of the operation of the data processing apparatus will be described with reference to FIG. The program (data flow graph) loaded from the host computer (HC) is stored in the program storage unit (PM).
Is stored in The start packet consists of the above elements (NIF), (F
C), (EXE) and program storage means (P
Upon arrival at M), execution of the program is started. During the execution of the program, the control information of the packet inputted to the storage means (PM) is replaced according to the data flow graph, and the data packet is copied according to the data flow graph. The packet output from the program storage means (PM) is selected to be output to the outside at the network interface (NIF) or transferred to the ignition control means (FC). The firing control means (FC) mainly performs a firing control process of detecting a left operand and a right operand such as a binary operation instruction as a data pair and outputting the two operands as a pair. The left operand is output on output line (5) and the right operand is output on output line (50). The instruction execution means (EXE) applies an instruction specified by the control information of the arriving packet to the arriving packet and outputs it. In the firing control means (FC) command execution means (EXE), there is no packet delay, but when a packet is input from the outside at the network interface (NIF) and when it is attempted to output and cannot be output, and the program storage means (PM) In the case where the data replication process is performed in step (1), the data packet is in a busy state, and the subsequent data packet must be stopped to wait for the release of the busy state. In such a case, the queue memory (Q) performs a buffering function for temporarily storing data and making it wait. The queue memory (Q) includes data monitoring means for monitoring the amount of data staying in the internal queue memory. When a data duplication process is required in the program storage means (PM), if the data staying amount of the queue memory (Q) is smaller than a predetermined value, the number of data according to the program stored in the program storage means (PM) is reduced. Duplicate data is continuously output. If the data staying amount of the queue memory (Q) is equal to or more than a predetermined value, the number of duplicate data to be output at one time is limited to two or less, and the busy period is minimized. To the limit. As a result, it is possible to suppress an increase in the amount of data staying in the queue memory (Q) and prevent overflow of the queue memory (Q).

The program is executed by the data packet circulating while the processing described above is performed in each processing element. Further, when a plurality of data packets exist in the data processing device, a pipeline-type process in which different processing elements simultaneously perform different processes on each data packet can be performed. Therefore, it can be said that the present data processing apparatus is a ring-shaped pipeline type data processing apparatus.

FIG. 3 shows a more detailed configuration diagram of the queue memory (Q), and FIG. 4 shows a more detailed configuration diagram of the program storage means (PM). FIGS. 5 to 8 show the configuration of a data packet applied to the data processing apparatus. FIG. 5 is a load packet for downloading data to a predetermined memory inside the data processing device, and FIG. 6 is dumping (reading) data from a predetermined memory inside the data processing device.
7 and 8 are execution packets that are processed during execution of the program. The ignition control means (FC) detects the pair of left and right operands and forms two operands as a set. When it is output as shown in FIG. All data packets have a two-word structure, and the first and second words are identified by a header identifier [H]. Each data packet consists of a data value and other information (control information). [F ₁ , f ₀ ] of the control information is a packet identifier and is defined as shown in FIG. The module numbers are stored in the host interface (H1), data storage device (DM), and each data flow calculation device (DFC
1), (DFC2),... (DFCn) are numbers that identify each processing module. Each module has its own number and inputs only data packets with its own module number. Has become. The target memory number [S ₂ S ₁ S ₀ ] is a number for specifying a target memory when loading or dumping. Selection code [S ₂ S ₁
S ₀ ] defines a path through which a data packet is processed inside the data processing device, and each code value has a meaning as shown in FIG. That is, for example, the start packet is
[S ₂ S ₁ S _0] = [000] that program storage means (PM)
It holds a selection code addressed, which was held when is replaced in [S ₂ S ₁ S _0] = [101] in the storage means (PM), the [S ₂ S ₁ S _0] = [101] Packet Is processed in the firing control means (FC), and when the processing is completed, the means (FC) sets the selection code to [S ₂ S ₁ S ₀ ] = [001]
Output the changed packet. The packet is then processed by the instruction execution means (EXE), and when the processing (EXE) completes the processing, the selection code is changed to [S ₂ S ₁ S
By outputting the packet changed to ₀ ] = [000], the packet is processed again in the program storage means (PM). In this way, each processing element processes only the packet holding the predetermined selection code shown in FIG. 11 and passes the other packets without performing any processing. Updates the selection code toward the next processing element, whereby the program execution process proceeds. In addition, the node number is a number for identifying each node of the data flow graph, and the environment number is, for example, when a plurality of users of the data processing apparatus execute the same program loaded on the data processing apparatus at the same time. This is a number for identifying each user. The sequence number is a number that identifies the sequence relationship of each data packet when performing a process described by the same program on a plurality of data packets having the same node number and the same environment number and having the same order relationship with each other. Yes, [E] is a tail flag that is set to 1 only when the data packet is the last data packet among a plurality of data packets having an order relationship. A combination of [node number], [environment number], and [order number] is called a tag, and two packets that match the tag are detected as left and right operands of a binary operation. [L / R] is a flag for distinguishing between left and right operands, and is set to 1 for a left operand. [CY] and [OV] are operation flags stored as a result of the operation, [CY] is a carry (carry) flag, and [OV] is an overflow (overflow) flag. [TF] is a true / false flag stored by execution of the condition determination instruction. The determination result is 1 when true and 0 when false. FIG. 9 shows a storage format in the program storage means.

Hereinafter, the operation of the data processing apparatus will be described in more detail with reference to FIGS. 3, 4, and 9.

I. Operation of Queue Memory (Q) The queue memory (Q) includes a FIFO memory (103), a FIFO control circuit (102), and a data amount monitoring and viewing means (MONIT). The data amount monitoring means (MONIT) includes a counter (109) and a decoder (111).

The output of the counter (109) is the queue memory stay data count (110), which is initialized to zero by an external counter reset signal (108).

When the first word of the data packet arrives at the data line (1), the header identification signal (101) becomes high level, and in response, the FIFO control circuit (102) outputs the write signal (105) and arrives at the data line. Packets in the order of the first and second words
Write to FIFO memory (103). At this time, the counter (109) is incremented by the increment signal (107).

The FIFO control circuit (102) outputs the read signal (104) if the queue memory stay data number (110) is not zero and the wait is not requested by the wait request signal (204).
Is output, and the data packet written first among the data packets written in the FIFO memory (103) is read out in the order of the first word and the second word and output to the data line 2.

Number of data packets staying in the FIFO memory (103) (11
When (0) is zero, or when a wait is requested by the wait request signal (204), the read signal (104) is prohibited and reading from the FIFO memory (103) is prohibited.
Only writing to the IFO memory (103) is permitted.

Also, the decoder (11) in the data amount monitoring means (MONIT)
In 1), when the number of data staying in the queue memory (110) is equal to or more than a predetermined value (for example, 15/16 of the maximum amount of the FIFO memory), a data replication processing suppression signal (112) is output.

II. Operation of the program storage means (PM) The program storage means (PM)
3), data duplication means (201), header register (R1) having an increment function, and address register (21)
0) and a tail register (R2).

When a data packet arrives at the data line (2), the control information (202) is input to the pro-data duplication means (201), and the address is loaded into the address register (210) in the case of a load (dump) packet and in the case of an execution packet. The node number is latched via the address information line (211) and the first word of the packet is latched in the register (R1). The output of the address register (210) is an address to the program memory (203). Control information is stored in the program memory (20
If the loading to 3) is indicated, the data value of the second word of the packet is output from the register (R2) at the next timing, and the program signal (208) is output via the data line (212) by the write signal (208). ) Is written. If the control information indicates a dump from the program memory (203), the data value is read from the program memory (203) via the data line (212) by the read signal (207) and the second word of the packet is read. Is stored.

The connection structure of the data flow graph (program) and constant data values used during the execution of the program are loaded into the program memory (203) in the format shown in FIG. 9 by the load packet. The module number, selection code, L / R, and node number in the figure are control information for newly adding to a packet arriving at the program control means (PM). In addition, a constant flag indicating that a constant data value is stored and a copy flag indicating that a data packet copy process is to be performed are stored.

Referring back to FIG. 3, if the packet arriving at the program control means (PM) is an execution packet (selection code [S ₂ S ₁ S ₀ ] = [000]) processed by the means (PM), the address register The program memory (PM) is read using the node number held in (210) as an address, and the fields of the module number, selection code, L / R, and node number in the first word of the packet are shown in FIG. The new data is replaced with new control information, and the data value of the second word of the packet is output as it is. At this time, if the copy flag of the flag information (206) (constant flag, copy flag) read from the program memory (203) and input to the data copying means (201) is "0", the packet arrives. The processing for is ended.

If the copy flag is “1”, the wait request signal (20
4) A wait is requested to the queue memory (Q). Further, at this time, the data copy means (201) determines whether or not the data copy processing suppression signal (112) has been output.

If the suppression signal (112) has not been output, the address register (210) is incremented, the next address of the program memory (203) is read out, replaced with the read new control information, and the first word of the packet is output. At the same time, new flag information is input to the data ram memory control circuit (201), and if the newly read constant flag is "0", the input packet is held as the data value of the second word of the output packet. If the newly read constant flag is "1", the address register (210) is further incremented and the constant data value stored in the program memory (203) is read out.
This constant data value is output as the data value of the second word of the packet to be output. Such an operation is repeated with the queue memory kept in a waiting state until the newly read copy flag becomes “0”. (Packet copy processing with unlimited number of copies) On the other hand, if the suppression signal (112) is output, the node number of the control information of the arriving data packet held in the header register (R1) is incremented by one. The control information is output to the data line (3) as data of the first word, and thereafter, the data value of the second word of the arriving data packet is output to the data line (3) via the tail register (R2). Then, the processing for one arriving data packet is completed. Therefore, for example, when a program is stored in a format as shown in FIG.
When the data packet holding the packet arrives, the suppression signal (11
When 2) is not output, program memory (203)
, Three data packets using the contents of addresses m, m + 1, and m + 2 as control information are continuously output, and while the two packets are being output, the queue memory is in an output prohibited state. On the other hand, if the suppression signal (112) is output, m
Two data packets, a data packet holding the control information of the address and a data packet holding the node number m + 1 obtained by incrementing the node number of the arriving data packet by 1, are output, and the queue memory (Q ) Is prohibited. The data packet holding the (m + 1) node number output here circulates on the pipeline ring, and arrives at the program storage means (PS) again after an appropriate time. Also at this time, processing is similarly selectively performed according to the presence or absence of the suppression signal (112). In other words, usually, by taking advantage of the data-driven processing method, parallel processing for copying a large number of data at a time is advanced, and when the amount of data in the queue memory exceeds a predetermined value, the processing is changed to sequential processing. become. With such a processing method, overflow of the queue memory is prevented.

(G) Effects of the Invention As described above, the data-driven data processing apparatus of the present invention can prevent the overflow of the queue memory caused by the data duplication processing without requiring a large increase in hardware. it can. As a result, an efficient data-driven program can be executed in accordance with the maximum capacity of the queue memory.

In addition, this allows the overflow to occur,
There is no need to change, modify, and re-execute the program, and the program can be created without being aware of the limitations of the hardware. This greatly improves program development efficiency.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a data flow computer system in which a data driven data processing device using the present invention is used.
FIG. 3 is a block diagram of a data-driven data processing apparatus using the present invention, FIG. 3 is a block diagram of a queue memory, FIG. 4 is a block diagram of a program storage means, FIG. 5, FIG. 6, FIG. FIG. 8 is a configuration diagram of each data packet used in the data driven type data processing apparatus using the present invention.
FIG. 10 is a memory diagram showing an example of a storage format of a program storage means of a data driven data processing device using the present invention.
FIG. 11 and FIG. 11 are code comparison tables. (DFCn) Data flow calculator, (PM) Program storage means, (Q) Queue memory, (MONIT) Data amount monitoring means.

Claims (1)

(57) [Claims] 1. A data duplication means for performing data duplication processing for generating a plurality of data upon arrival of one data in a data driven type data processing apparatus which processes data including a data value and control information in accordance with a program. And a queue memory for storing waiting data for waiting for the end of the data duplication processing; and a data amount monitoring unit for monitoring the amount of data stored in the queue memory, the data stored in the queue memory. Depending on the quantity,
A data-driven data processing apparatus, wherein the data copying means changes an upper limit value of the number of pieces of copied data generated by arrival of one piece of data.