JPH027180A - Instruction simultaneous ignition system - Google Patents

Abstract

PURPOSE:To ignite two or more tokens having different colors with each other at the same time by simultaneously igniting some tokens having the same operation node address out of plural tokens under a queuing state in a operand memory regardless of their colors. CONSTITUTION:A simultaneous ignition token occurs in any of an instruction memory, an operand memory 1, an operation part, and a link memory when one of serious faults including power source disconnection occurs, when a request from software occurs, or when a timer overflows in every constant cycle. Further, when it is decided that the token is the token related to simultaneous ignition when the token reaches the operand memory 1, other tokens having the same operation node address 6 as that of the reaches token are to be retrieved from the plural tokens under the queuing state as operand pairs. Since the tokens are retrieved regardless of colors 7, if only the tokens have the same operation node address 6, they can be ignited at the same time even when their colors 7 are different.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a method for simultaneously firing instructions in a data-driven data flow control device. The present invention relates to an instruction simultaneous firing method in which all tokens having an address and waiting in an operand memory are fired at the same time.

[Conventional technology]

Regarding data-driven data flow control devices, for example, the paper ``Data Flow Computer "Hardware configuration" is known. In this case, the token that arrives at the operand memory is identified using the color (environment identifier) as identification information and the operation node address (address in the instruction memory where the instruction is stored) as a key, and the token that is paired with that token and the operand. is searched from multiple tokens in the waiting state. When tokens to be paired are searched for, an instruction is executed, that is, fired, for the first time using the operands contained in these two tokens as data. If the search fails, the arrived token is stored in operand memory,
The token is placed in a waiting state until the paired token arrives.

[Problem to be solved by the invention]

However, until now, when a subprogram is shared by multiple users, each user is treated as a token with a different color, and the token is executed as soon as the paired token arrives in the operand memory. Therefore, no consideration is given to having the subprogram run for all events at the same time.For example, suppose 10 users run one billing subprogram at regular intervals. For example, tokens with colors corresponding to each user will run on the billing subprogram, but it is necessary to generate 10 tokens and fire a command depending on the billing timing, which takes a lot of time for processing. Not only is this necessary, but it is also inevitable that the software configuration will become more complex.

In addition, even if you want all users to run an information backup program when a major failure such as a power outage occurs, it is necessary to generate a token for each user, which takes a lot of time. It becomes.

An object of the present invention is to queue in operand memory. The purpose is to provide an instruction simultaneous firing power formula in which two or more tokens with different colors can be fired at the same time.

[Means to solve the problem]

The above purpose is to
This is achieved by firing all the tokens that have the same operation node address at the same time, regardless of the color, among the plurality of tokens that are queued in the operand memory.

[For production]

Simultaneous firing tokens are used when a major failure occurs such as a power outage, due to a request from software, or when a timer overflows at regular intervals.
Operand memory, calculation section.

It is generated in any link memory, but if it is determined that it is a token related to simultaneous firing when it arrives at the operand memory, a token with the same operation node address as that token is used as an operand pair, and the token is queued. It is designed to be searched from multiple tokens placed in the state. By searching regardless of color, tokens with the same operating node address will be fired at the same time even if the colors are different.

〔Example〕

The present invention will be explained below with reference to FIGS. 1 to 4.

First, the operand memory according to the present invention will be explained. FIG. 1 shows a schematic configuration of the main parts of an example thereof. In this case, a quasi-instruction packet is input from the instruction memory (not shown) to the operand memory 1.
Each time the quasi-command packet arrives, it is temporarily stored in the input buffer 4. As shown in the figure, the quasi-instruction packet has an operation node address (0ρn) which is the address of the instruction memory where the program is written.
6. Color for user identification 7. Operation code (OPC) indicating the type of instruction 8. Address (link node address) of link memory (not shown) that stores address information of the next instruction to be processed
(1mad) 9. Operand data (V) 10 and simultaneous firing bit (stab) as processed data
Of these, the simultaneous firing bit 11 is directly related to the present invention.

In other words, in a normal quasi-instruction packet, the simultaneous firing bit is "0".
Under the control of the control circuit 2, the token storage memory cell 3 is searched for a token whose operation node address 6 and color 7 are the same as those of the quasi-command packet. If a token that becomes an operand pair is searched for, the control circuit 2 creates an instruction packet as an output token in the output buffer 5 from the token and the quasi-instruction packet, and sends it to an arithmetic unit (not shown). By the way, this is true. The instruction packet is colored (colo) as shown.
r) + operating code (opc) v link node address (1mad) and operand data (V
++Vz), but among the operand data, the first operand data v is from the searched token, and the second operand data v2 is from the quasi-instruction packet. ing. Once the instruction packet has been created, the searched token contents in the token storage memory cell 3 are no longer needed and are therefore erased when the instruction packet creation is completed.

In addition, if the search for a token that becomes an operand pair fails, the quasi-instruction packet stored in the input buffer 4 is written to an empty address in the token storage memory cell 3, excluding the simultaneous firing bit 11, and This is in preparation for the paired tokens that will arrive.

Now, to explain the simultaneous firing token according to the present invention, it can be generated autonomously by hardware that detects a power outage, generated when a timer reaches a certain value, or included in software. It is now generated by a simultaneous firing token generation command. FIG. 2 shows an example of a simultaneous firing token. When this token arrives at the input buffer 4 in the operand memory 1, the control circuit 2 determines that the simultaneous firing token is different from a normal token based on the state "1" of the simultaneous firing bit 11. Depending on the situation, the operation will be controlled as follows.

That is, the simultaneous firing tokens shown in FIG.
It is assumed that upon arrival at , a plurality of tokens are stored in the token storage memory cell 3 as shown in FIG. As described above, these tokens were written from the input buffer 4 as a result of the search being performed as normal token processing, but the search failed. When the control circuit 2 identifies that what is stored in the input buffer 4 is a simultaneous firing token,
First, it is searched to see if there is an operation node address in the token storage memory cell 3 that has the same operation node address as the simultaneous firing token (100 in this example). There are at least two tokens with the same operation node address, and the first one (colo
r=1, ape=12.1mad=200.
An instruction packet shown in FIG. 4(a) is created from V=68) and the contents of the input buffer 4, and is sent to the arithmetic unit.
Then the second one (color=9, opc=
12.1+mad=200. An instruction packet shown in FIG. 4(b) is created from V=46) and the contents of the input buffer 4 and sent to the arithmetic unit. After this, the same process is performed every time a token with the same operation node address is searched until the search fails.

By the way, there are two possible methods for processing when the search fails due to the arrival of simultaneous firing tokens. The first is a method in which tokens with the same operation node address that subsequently arrive at the operand memory 1 are not fired. For example, more specifically, if a simultaneous firing token is erased after the simultaneous firing process is completed, if a paired token arrives after the simultaneous firing token arrives, that token becomes a ghost token, so these The ghost token is garbage collected by a control circuit.
on) processing. Another idea is to prepare a simultaneous firing bit in the token storage memory cell 3 to store simultaneous firing tokens. If the stored simultaneous firing tokens are not deleted even if the search is successful, then the pair of tokens that arrive thereafter will be sent to the calculation unit as an instruction packet at the timing of their arrival. Therefore, if there is a possibility that a pair of tokens will arrive after the simultaneous firing token arrives, the latter is appropriate, and if there is no such possibility, the former is appropriate.

As described above, when a program shared by multiple users is run at the same time, the simultaneous firing token can be used as a synchronization timing. therefore,
For example, when a process such as billing processing is performed at regular intervals, if a simultaneous firing token is generated every unit time, the billing program can be run for all users. In addition, when a failure occurs, it is possible to notify multiple users currently processing the occurrence of the failure and have them execute corresponding processing by generating a simultaneous firing token from the failure detection location. Become.

〔Effect of the invention〕

As explained above, in the case of the present invention, when a simultaneous firing token arrives at the operand memory.

The effect is that tokens that are in the waiting state and have the same operation node address can be fired all at once, even if their colors are different.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing a schematic configuration of essential parts of an example of an operand memory according to the present invention, FIG. 2 is a diagram showing a specific example of simultaneous firing tokens according to the present invention, and FIG. A diagram showing an example of tokens stored in a token storage memory cell when a firing token arrives, FIG. 4(a),
(b) is a diagram showing command packets created from the simultaneous firing token and the token in the token storage memory cell, respectively. 1... Operand memory, 2... Control circuit, 3...
・Token storage memory cell, 4...input buffer, 5
. . . Output sofa, 6. Operation node address, 7. Color, 11. Simultaneous firing bit. Representative Patent Attorney Tadashi Akimoto Actual Figure 2 Figure 1-m-Operant Memory 2...Japanese Printing System 3--7)--7Resel 4-9X Cover)7 A 5--Cover Sofa 6--Obelenk 7 Gide 7H Less 7---Color 20. −Sparrow；も≦Fire bit

Claims (1)

[Scope of Claims] 1. An instruction simultaneous firing method in a data-driven data flow control device that is configured to include an instruction memory, an operand memory, an arithmetic unit, and a link memory, and uses a tagged token method using colors. Then, when the all-once firing token arrives at the operand memory, among the multiple tokens waiting in the memory, the one with the same operation node address as that of the all-once firing token is , a simultaneous command firing method that is characterized by firing all commands all at once, regardless of the color. 2. Simultaneous firing tokens are generated in instruction memory, operand memory, arithmetic unit, or link memory when a serious failure occurs, due to a request from software, or when a timer overflows at regular intervals. The simultaneous instruction firing method according to claim 1.