JPS58159156A - Program executing system - Google Patents

Abstract

PURPOSE:To eliminate a tag conversion memory and to improve the performance for a data processor of data driving type, by replacing the tag of a program added to the operand of data only by an instruction. CONSTITUTION:An arithmetic part 101 receives a data 1 from a control part 102. The data 1 includes a return tag and address (tag and address of destination of arithmetic result), an instruction code, a destination and an operand in addition to a tag and address. The part 101 decodes the instruction code in the data 1 and performs an operation with use of the operand in the data 1. A data 2 of the result of operation is fed to a control part 2. The instruction code designates an output and feeds the data 2 to a host computer 103. The part 102 reads memories 104-107 by the data 2 given from the part 101 or a processing request supplied from the computer 103 and feeds the data 1 to the part 101.

Description

DETAILED DESCRIPTION OF THE INVENTION (1) Technical Field of the Invention The present invention uses a data processor's data processing flAill device, adds the tag of the called program and the address to which the result should be sent to the data operand, This invention relates to a program execution method that performs program execution in parallel.

(2) Conventional technology and problems Conventionally, data escape devices for data driving have a +lAl11 that sends a new tag and result to the data operand every time a program is called. However, a method that allows parallel escape is used. One example is Oki Electric Co.'s DIP (Toj), which is an information center*
*, Computational Architecture Research * 42-1 (198
1,7) ry' −/ 7 R-ttg4111D"
"PO Bari System" K 弗 is expressed.

In eO Obu, the same program is called from multiple stations at the same time, and SOOL! - It is possible to share the code of the issued program and execute it at the same time using a line, but it has the following problems.

0) Since one program is assigned to one output, the next IC4
m1K missing.

(→Methodically speaking, when a program is executed, a tag (identification code) is attached to the data used in that program, but there are many accesses to the memory that applies the electric field to the tag, 〇G field is complex.

If multiple programs simultaneously access the memo □ that applies the electric field to the tag using term C → (b), there is a possibility that the program category will not end even if lIIM is requested.
Parallel processing area t! It impairs one's ability.

(3) Invention O1i's misfire 11oii is by using a data processing device with a data processor and providing a program execution method that calls the same program from multiple programs at the same time. Almost clear configuration vII + 1! Rounding that couples the purpose, the grogtum execution method of the present invention uses a data escape device of data drive*ai, and adds the meg of the called glogram and the address to send the result to the data operand. However, in a program execution method with parallel escape consumption of program programs, p
Rounding to make a program call, the 1 command that creates a new round tag every time the program is called, the i tag attached to the data to the new round tag, 19 calls, 9 glogram O tags, and the result The address to send is 2O
It is equipped with a means for executing an instruction, an *S instruction that determines the destination of O data from the program and changes the tag, and an 1140 instruction that changes the tag and address of the own program that returns the result corresponding to the data. There is a feature 'C.

(Is) The example embodiment eliminates the drawbacks seen in the conventional example and realizes a desirable system. 0) The program allows output of arbitrary illumination. There is no performance deterioration by accessing the 9φ memory of the Sitag electric field by the tl(1-) term without preparing a memory for .

It is structured based on this idea.

$l11- is an explanatory diagram showing the configuration of the unexploded @0
h, JII2-■, @ indicate the data format used in the example of IFm.

At 111, operation 11101 receives data ■ from control $102. Data ■ is as shown in J12ii1, tag and address (Kjllj) tag and address (
The destination tag and address of the operation result), instruction code, destination 1.2, and operands 1 and 2 are met. The arithmetic unit 101 decodes the instruction code in the data (2) and performs an operation using operand 1/operand 2 in the data (2). and 11
Data (2) in the format shown in FIG. 2 is sent to the control unit 2. however,
When the instruction code specifies output, data ■ is sent to the host):zy pieta 105. Command ■.

Details of (2) will be described later.

The control unit +02 receives data ψ from the calculation unit 101.
1 or host combination Aime 105r,,of6st
), instruction memory 104. :ff control memo 105, electric switch memory 106 #operand memo change 107
If it is possible to execute the plan, send the data ① to the operator 101.

Recommendation 3 IA (a) to C) are the above four O memory contents structure and function 11! @Figure.

Command message (IM) 104 stores the instructions constituting the program, its format is shown in 1m (a), and its contents are as follows.

Instruction code: Instruction opcode D = Specifies the reconnaissance of the next command that uses the result value of that command.

0: 1 Pass to instruction 1: 2 Instruction KfIl Destination 11 Destination 2: O Instruction address that uses the result value of the instruction. “vL: SoO instruction 01iif result value is operand 1 of next instruction
or as operand 2 i! ! Indicates whether it is used.

O: Used as operand 1 1: Used as operand 2 Control memo'j (CM) 1os expansion Used to determine whether or not each instruction is executable.

The Os expression is shown in the same tm (6), and the contents are as follows.
It is.

C: Indicates whether the corresponding instruction is activated.

1.:Activation state- 〇: Unf'II state Only the activation status determines feasibility.

INO: Indicates the number of operand values used in the ζO instruction minus the number of constants used.

CVI, CV2: e O instruction o, t-”cyy de 1
(2) shows that constants are commonly used.

0: Not worth it 1: l! UC0N5T1, C0N8T2: CVl (2)
#112) is valid and indicates the address to constant memory.

Constant memory CCBM) 104 is a control memory S0CONB when an instruction uses a constant as an operand.
The address is derived from the T part and the value of the O constant is held there.

The format is shown in the figure (O).

Operand memory (OM) 107 is a memory that holds operand values corresponding to each instruction, and a chain structure is formed for waiting operands.

The format is shown in the figure (a), and the content is as follows.
oru.

Tag: intermittent otp executed while keeping vhh value
Indicates whether it corresponds to the o command.

If the tag value is the same as the control unit 20 data value, the corresponding command is treated as executable.

Value: numeric data, -ring data.

81T instruction data (tag + member) tag + member p address)
.

R118jCT instruction data ICl0 tag + shoulder (address) next address For the 2M instruction, the address in 0M is used for rounding to hold a plurality of different operand values.

In other words, chained data consisting of only intermittent commands may occur.

When the data ψ is received from the arithmetic unit 101, the address in the data Φ is used to write 0M1 to l1111all.
Find the OS-like data O earlier application in 07. Using the address in the data■, find the nine-chain data, and
If there is an operand value of the same tag as the tag in, it is executable], otherwise it is impossible. Oku, 0M105
It is possible to execute the commands that p1 data ■ is able to execute by one person. If it is possible to execute with the above judgment,
IM1o4.0M105, C3M104.0M107
The data is sent to the arithmetic unit 101 using . If it's Jikyoufumachi, I'll put a new value on the chained data I found in 0M107 and wait for the next O to escape.

Next, the instructions executed by the calculation unit 101 will be explained in detail i1!
-do.

First, to mention something common to all instructions, the type of instruction is determined by the instruction code.

0) Use the operand line required for the instruction, operand 1/operand 2 of data (2).

(b) The calculation result is r- for destination 1 and 9 for destination 219.
It will be sent in the format of ta.

C→However, some instructions do not create result data.

The command in this example is the following 019 Haji. i.e. ADI), 8UB, MUL, DIM, ILT
, IL&IIQ IGGT, DCP, CC
P, BY, GATji, INPUT, 0UTP
UT, TAQ 1ilT.

RIT, RI8jCT eA), among these, the commands related to tags are 411 TAG, BtobiT, RffT at the end.
(RjCTU), numbered 8 times 1jCT. These four instructions will be described in detail later, so the other 15 instructions will be briefly explained. In other words, is sent to destination 11 and destination 2.

result.

DCPe COP: (Datacopy, Con
trol Copy ) Operand 1 is the result.

SW: Operand 1 is the value, and the destination is changed depending on the 4dII field value given to operand 2.

Operand 2 is tr so; Send to destination 1 Operand 2 is fal-・: GATj passed to line gh2
C: Operand 1 is set to 1, and when any data is given to operand 2, operand 1 is set as the result.

INPUT, 0UTPUT: handles input/output, INPUT
UT is worth receiving input data from host combiator S, 0UTPUT is worth receiving input data from host computer S
Send operand 1 to head.

The above 15 instructions are the same as in the conventional system.

Next, the 4 instructions that will be the original @01lfl mold, TAG, S
ET, RJCT.

■Let's talk about SET. First, the ζ04 instruction
The table below shows how many ovs (bits) are to be changed.

table Note that in the table above, the data 10 rows ahead has the following differences.

O: Destination 11 of input data (format ■) is other than destination 2 or higher.

×: Send according to destination 11 and destination 2 of input data (format ■).

Below, JI41ill will be explained in detail using 4 instructions. In addition, the 9 data #I draft used in the figure is shown in the format of the backing example (Raku b II (a)) described later.

The TMG command is triggered by a trigger. The tag counter value, operand 2 (constant value), and input data tag are combined to create data to be sent to destination 1. This data is 8j
Prepare for the ninth CT command.

In addition, in preparation for the Rj81T command, the input data O member p tag and the 14 address are combined to create data to be sent to destination 2.

@4 II (&) ■~■ show examples of TAG commands. lie II (a) With ■, the input data is complete and execution is possible, operand 1 is a trigger,
Operand 2 is the member p address. In any case, Meg Tsumu 1
0°IN) tag is 5. jjlj) Assume that the address is 20.

At this point, the same 1m (a)
The output data of the instruction is the tag counter (12) for value 1, the input data tag (10) and operand 2 (100), the value 2 line human data O return p tag (5),
The tag, return tag, and 14 sea address are the same as the input data. Then, the tag counter is incremented by 1 in (A) (2) in the same figure and the next input is waited for.

The RET command requires two people and one output. When calling a program, a data O tag is added as a special feature. First, it is used in the RET command in the called program, so it is a data osp tag.

Ml) Change the address so that the gramgram result data is returned to the correct tag and address.

78411i! 3(b)(1), @Ha5jlT Instruction O夷fM-'Ch! , fillllg(b)■ is assumed to have nine input data. Operand 1 is a step (t5) that leads to the glogram, and operand 2 is the tag (12) and IN) tag (10) given to the glogram to be called.
) and member) address (100). And lllll
lgl(b) Create output data as shown in ■. That is, the value is operand I Oll (t5), the tag is operand 20 value (12), the ME) tag is operand 20 value (10), and the J[j) address is operand 2.
The value is 0 (100).

The RET command requires two people and one output. When the program calls the resulting address and returns it to the original program, Kim!
! cormorant. ζO Hatokin, #<5y)”1: <1lllkf-/> tag,
Member training 1. Genus p address ""y'do 2: <m force honor> tag. 9 days ago, igt address output data: details data > ynpy, yup〆, the address and the like,
The output data is the address Ka determined from the 14) address of the input data and the output number of the 1st operand 2. The output number specifies which eFAos of the program it is.

114 m (@) ■, ■ show examples of R Tobi T commands.

In the same figure (el) (2) indicates that the input data is complete), the operand 1 is the one-piece data (t5), and the operand 2 line data (t5) is the data of the output number 1.

Then, as shown in (@) ■ in the same figure, output data is sent. The O value is the operand 10 value (L5), the tag is the return tag (1G), the R'l) tag, the N4D address is the same as the input data, the destination address is the X) address and the output cost number as shown below. create.

Output number XI) Address Destination address 1
100 100(6)2
100 101)s
100 102 (Rioboku T command is 2
It is one man power and one mold power. Call the program, and as soon as the result is available, prepare a rounding function that replaces the 70 data's back tag and x address. If ζO#, opera/do1: (Jt next data>If, If, A Fl/
The X and PlCoO instructions align the 149 tag and 14 address to the rounding of the RET instruction of the program contained in the ζO instruction O1.

Figure 1114 (d) ■ and ■ indicate the remaining Rj:SIT command, and the input data is complete in the same figure (from ■. Operand 1 is line system data (4, 5), member p tag, address is call 9 S)-g in the glogram, the address is Shitamataka.

Operand 2 is (5, 20), 66, an tag.

The member address is X in the program specified by this command)
Make it a tag and return address. Then, the output data is sent in @)■ in the same figure. Its value is operand 10 (45),
The tag is the data tag (10), the jij) tag is the operand 20 value (5), and the l&6 address is the value of operand 2 (
20).

Below is an example of nine tails using the four instructions of the present invention.llll5! Have sex.

As an example, consider a program that calculates the following equation to find X.

X gourd (A0B) * (Mu-B) Two functions are prepared to perform this calculation.

v4M (Glogram) 1 funation addsub (person, B-+C,
D) C: Song A+B; I) Knee wA-B
(t) 曵; Seki*<Grogzum) 2 funetlon mult (A, B −
+

Figures 5(a) and 5(b) each show a graphical representation of @number 1.2. In the same figure -) is called -'s @a
FIG. 1 ('b) shows the program of A2 to be called, and the subcutaneous ``-'' is placed on the left shoulder of each command in each program, and the ``9'' character indicates an address. The relationship between these two is input from 1nput 7.8 in the same figure (b), and TA
Create a tag for the mother that calls the glogram in G9, and set this to the data from 1nPlt 7.8 10.
11, change the tag and program O1np in the same figure (&)
ut 1.

Send p1 adjustment order to ward, b soil to pu F! 4 After performing the calculation of number 1, in RET 5.6, decide the destination of the program in (b) of the same figure, change Meg, and write RESIj:, Tyu, and T.
After the p tag is replaced by AG 9, the function a2 is calculated by the multiplication Jl instruction 14, and the output
Outputs 15.

Figures 46 (&) to (•) show examples of execution in which Mathematical formula 1 is applied to the function examples in Figures 5 (a) and 5).

Figure (a) shows the data expression format, where the values of arguments, etc. are placed in <>, and the subscripts are tags and return υ tags.

Write down the sb address.

First, start function 1 in the same figure (b) and write 1nput 7
, input data <1>1#0 as mu-1, B-2
．． (1t (2> put x, e, *, 1nput 7
The O output is branched, and one side uses the TAG instruction 9 to write the tag (12), the tag (1) of the input data, and the operand 2 (
5) as data <5.1112)1. Create OJ and send it to 5ET10.11 as SET data.

The other is RE, SET data (00>s, tho
Create and send to RESET 12.15 described below. SET
10.11 In the method shown in s4 diagram (b), each <
:1>s, bu, <2>mtse*s are output.

Next, the function dL2 shown in the figure (@) is activated. In this case the tag is 5. R Ya tag is 1. The return address is 12.

Each output of said SET 10.11 (1>811
Input 11m + <2>5ybu into 1nput 1, 2, ■ Perform the addition/subtraction operation shown in p formula <1) with soil and 84, ■ 3yoj) <5>s, t, u, O soil Yo'II
Output <-1>s small 1s.

Put these two outputs into RET5.6, calculate the destination, and set the function 2 program address 12.13 Km button data <5> 1. *, u and (-1>l, l+11 are sent.

The result data returned to RKSET 12.15 of @IIL2 in the same figure (d) < 5 > ltl+1m and (-1>t
, bu is the aforementioned TAG? 1L2o data from (0
, 0 > b By inputting it together with desire, ru, broom 4 figure (d
) The tags are replaced by the method shown in (). and R.E.
Output from SET 12.15 (j>l, o, o l
<-1> Data of the result of multiplying xro, o by @14 using equation (2) <-! 5>t, o, o t-0utpu
t15 to the p host computer 105.

(6) Effect of @Ming As explained above, according to the present invention, data drive lIb
Using another data processing device, add the tag of the called program and the address to which the message should be sent to the data operand, and perform the above-mentioned TAG, SET, and RET.

It is very easy to call the necessary program with the four RjcSET instructions, perform the calculation, and return to the original program.
It is hand-knitted at a high rate of RJ, and parallel stone torture is easily performed in such a handiwork. This has the advantage that since tagging is performed only by an instruction and there is no tag changing memory, there is no performance deterioration due to complicated procedures for this access.

[Brief explanation of drawings]

Figure s1 is an explanatory diagram of the configuration of the IjliO embodiment of the present invention, and Figure 2■
, ■ and g 51! ii1 (&) to (a) are the data and memory formats of the present invention, JII4 figure (a) to (phrase are the line drawings of the main instructions of the present invention 11! Ming figure, Houki 5 figure (Xun, (
b) is an example of a function program, Figures 6(a) to (d)
Figures 45 (a) and (b) are execution examples in which K'' values are entered.
U host computer, 1o4 is an instruction memory, 1o5 is a control memory, 1o6 is a running memory, and 107 is an operand memory. Threat issuer Fujitsu Ltd. Kinsha Fukudai Hanito Patent attorney 1) Saka sauce 1 Figure 1 Figure 2 D Tag Atsushi Return So Tag Return Y Drain 't
p order code D hakama Destination 2 - Oran 11 - 1,000; Re tag address Return tag Acceptance At 1st destination Out of destination Result Figure 3 (a) a order memory Kaire] - Do D Destination 1 H
Destination 2 /(b) :l>g. -z C
INOCVl coNs Ding I Cv2 CQNS
T2 memory Figure 4 (d) ■ ■ Figure 6 (-p-jri (C) 269-

Claims (1)

[Claims] In a program execution method that uses a data-driven data processing device and adds a call program tag and a result sending address to the data operand, and performs parallel escape of the program, the data is used as a program execution method. Round the call and create a new tag every time the program is called! 111 command, change the tag attached to the data to the given tag, change the tag of the called program and the address to which the result should be sent, the j12 command, decide the destination of the data from the program, and change the tag. Change the stripe 5 command and change the address of the four grams to block the results attached to the data. 40 commands:
A program execution method that relies on having a means to execute it.