JPS6282431A - Program control system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed description of the invention] [Table of contents] Overview Industrial field of application Prior art (Fig. 6) Problems to be solved by the invention Means for solving the problems (Fig. 1) Working examples + 11 implementations Configuration of Example (Figure 2) (Operation of 21st Embodiment (Figures 31, 1 to 5) Effects of the Invention Outline) The system has a plurality of main storage devices (each is called a unit) and stores programs to be executed. This unit is relocated to the middle position of unit 71, and processing is performed based on the program relocated to this unit fl!! position.

[Industrial application field]

The present invention relates to a program control method, and in particular, when there are execution requests for the same program from multiple terminal devices, the present invention provides a re-entrant (iJ) function that allows the next request to be executed even if the previous execution is not completed. This invention relates to a program control method that does not require consideration of data confusion even in programs.

Technology from C1jL] For example, like the payment program, one blue l-1
Reentrant Pr.grams can be used from multiple devices.

gran (hereinafter referred to as RP program).

Now, in Figure 1, when terminal devices A and B execute this RP program, the CPJ (central processing unit) 20 writes this RP program on the main memory 2I and executes it. However, at this time, in order to prevent data from terminal devices A and H from being mixed up, it is necessary to separately secure a data section for terminal device 1A and 1g of data for terminal device B.

[Problem that the invention attempts to solve] For this reason, when developing an RP program, data on each terminal may be mixed up when the program is jointly used as described above.
A special function is required to distinguish between these items and maintain them in 6' mode, so this is realized by software. Tatei l2.

The purpose of the present invention is to store data such as 1) in the program itself even if it is 1 gram.
l A block that can be controlled without adding any functions.
'1g control force formula is provided, and two.

[First Step to Solve the Problems] In order to achieve the above-mentioned objective F, the present invention uses a plurality of single-lens memories 1, such as Unino 1-■,
■-ω) is established. and from the terminal device to CI) [J
When requesting 2 to execute a program, CP
tJ 2 beams + f! ++ From the storage device 3, the program 1. J
The program reads out the program, searches for a free uniso (・) that can be placed, relocates it to, for example, -L2]tO, and thereafter processes the data using the program placed in this uniso. At this time, even if the task W executes the same program θ), the same program θ) will be rearranged in different units. These tasks are processed periodically.

[Effect]

When executing a program, the data area is also secured on the same unit, so when executing the same program in a different task, the program can be transferred to another unit. will be rearranged, and the results will be guaranteed even if they are executed at the same time. Therefore, ■n[)pu(
Even if it is 1 gram, there is no need for complicated rules in the program itself, such as a 1 m data function.

〔Example] fil Example configuration The configuration of an embodiment of the present invention will be explained based on FIG.

In the figure, the same reference numerals as the others indicate the same parts, 4 is the external storage control device, 6 is the sky unit/moxibustion unit, 7 is the relocation unit, and 8
．． 9 are terminal devices, respectively.

The main memory 1, as shown in FIG. These units (2) and (2)-- (2) are assigned to the middle of the task that is to execute the program, and each UNISO 1- (1-) is initialized to an empty state at (1) PL. Unit ■～■G
J, as illustrated for unit ■ in Fig. 2 fbl, unit in use display section ■-0, processing number section ■-1, instruction 1, instruction 2- are stored in section ■-2.
, ■-3-, data divisions (not shown), etc. are provided.

The CPU 2 reads from the external storage device 3 a program that has been requested to start from the terminal device w8, the terminal device 9-, etc., searches for an empty unit, and relocates the program read from the external storage device 3 to an empty unit. It also includes an empty unit detection section 6, a relocation section 7, etc. The empty unit detecting section 6 performs processing for sequentially searching each unit usage display and detecting an empty unit in which a program should be relocated. The relocation unit 7 transfers the empty unit detected by the empty unit to the empty unit detected by the detection unit 6,
It performs processing for relocating programs read from the external storage device 3.

The external storage control bag W4 stores a program in the column storage device 3 such as a DASD, and performs control such as reading out of the stored program in order to rearrange it on the units ① to ＠.

The terminal device 8 and the terminal device 9- are used to input the name of a program to be activated necessary for data processing.

(2) Operation of one embodiment First, program relocation and operation of the rearranged program will be explained with reference to FIGS. 2 to 4.

a. When a command to "execute program A" is input from the terminal device 8, the empty unit detection unit 6 of the CPU 2 searches the unit in use display of each unit and finds a relocatable empty unit for this program A. (2) is detected and reported to the relocation unit 7. The CPU 2 also instructs the external storage control device W4 to read the necessary program, and the program read out from the external storage device 3 is thereby relocated by the relocation unit 7 to the vacant Uniso i.■. . Then, a display indicating that the unit is in use is displayed on the unit (1) as shown in FIG. 2 (11).

b. The CPU 2 determines from the unit usage display that the UNISO] ■ is in use, and retrieves the instruction (instruction I in the example of FIG. 2 (tl)) at the position written in the processing number section ■-1. Then, as shown in Figure 3, the processing number area ■-1 is
The position is changed to the next instruction (in this example, instruction 2), and the instruction 1 is executed.

c. CPU 2 checks the unit usage display to confirm that units ■ to ■ are unused, and executes the next instruction (instruction 2 in this example) to the program on unit ■ in the same manner as above. do.

d. From then on, the instruction portion of program A on unit (2) will be executed in the same manner.

e, now, when the i-th instruction i of program A in unit ■- is an instruction to [execute program B], the empty unit detection unit 6 of the CPU 2 detects an empty unit in which program B can be relocated, For example, detect unit ■,
As a result, program B is relocated to unit (2) in the same way as in a.

f. The CPU 2 determines from the unit usage display that the unit ■ is in use, takes out the instruction at the position written in the processing number section ■-1 (instruction 1' in the example in Figure 4), and then processes it. Instruction 2 whose address area ■-1 is the next instruction
' and execute instruction 1'.

g, cIIJ2 checks the unit usage display to confirm that units ■ to ■ are unused, and executes the i-th next instruction (not shown) of program A on unit ■ in the same manner as above. .

h, from then on, program A on unit ■ is created using f and g.
and program B on unit ■ are executed simultaneously.

i.Furthermore, if there is an instruction to "execute program B" in program A on unit ■ or program B on unit ■, the program on unit ■ is transferred to the next free unit (unit ■ in this case). Program B is rearranged in the same way as B, and is executed simultaneously with the two programs of Haku, that is, program A on unit (2) and program B on unit (2). Here, since the data areas of program B on unit 2 and program B on unit 2 are located in these units, they do not affect each other.

j, and when the execution of the program on each unit is completed, the table and the unit in use display on the unit are cleared, and that unit becomes an empty unit, waiting for the next program to be relocated.

In the present invention, the operation of the CPU can be shown as a flowchart as shown in FIG.

a. When the CPU 2 is activated, it executes all programs of each unit.

b. During the execution of each of these programs, if there is no program execution (startup) request, CP tJ executes the program on each unit until the execution of all programs is completed.75
．． When these are completed, the process ends EN■].

C0 By the way, in the above section, program execution (startup)
If requested, program relocation processing will be performed.

When the requested program does not exist in the external storage device where it is supposed to be stored in the program relocation process of d,,l:,, CP tJ notifies the requester as an error. and will end with an error.

e. If the program exists, the CPU searches for a relocatable empty unit of the program as described above, and if no empty unit is found, this also sends an error message to the requester. As a result, ill-know U7 error ends.

If there is an empty unit f, L, CP r-J will copy the requested program to the empty unit and it will be executed.

In the present invention, one unit of memory is allocated to each task that is to be executed, and a unit number of the memory is added to the number of the program to be executed, so that one gram of memory is divided into 1:,). It will be executed every time after relocation.

Therefore, when trying to execute the same program in different tasks, the program is relocated to each memory unit l-, so that even if the program is executed at the same time, the result will be different (V). At the same time, all control information for each task is processed in the corresponding iE memory.These processes are periodically processed by the CPtJ (Central Processing Unit) and the unitized main memory. Ru.

〔Effect of the invention〕

In the present invention, the main memory is installed in units, the programs are relocated to the middle of this UniSoT, and the programs of each UniSoT are processed periodically by 0I)U, so the same Button 2 grams can be processed at the same time. Even when executed, the processing results are guaranteed.

In this way, the program can be controlled as a repopulation program, so there is no need to be conscious of the fact that the conventional FIF program is reentrant. , can be developed efficiently.

[Brief explanation of drawings]

Fig. 1 is a diagram of the principle of the present invention, Fig. 2 is a configuration diagram of an embodiment of the present invention, Fig. 3 is an explanatory diagram of the operation of the present invention, Fig. 4 is a detailed explanatory diagram of the present invention, and Fig. 5 is a diagram illustrating the operation of the present invention. A flowchart explaining the operation of C P [J in the present invention, FIG. 6 shows a conventional method. 1-Main memory 2--CPU (Central Processing Unit) 3-External storage device 4-External storage control device 6-Empty unit detection section 7 Relocation section 8.9-Terminal device base -1F writing method) % formula % 2. Name of the invention Program control method 3. Relationship with supplementary person case Patent applicant address 1015 Kamiodanaka, Nakahara-ku, Yozaki City, Kanagawa Prefecture Name (522) Fuji i11 Co., Ltd. Representative: Yamamoto Kurama 4, Agent address: 1-19-8 Kanda Awajicho, Chiyoda-ku, Tokyo (
Shipping date: January 28, 1985) 6. Drawings subject to amendment

Claims (1)

[Claims] A data processing device comprising an external storage device (3) in which a program is stored, a main memory (1) in which the program is relocated, and a central processing unit (2), comprising: Empty unit detection means (6) detects whether or not each unit formed in the main memory is free; and an external storage device (6);
A program characterized in that the program comprises a relocation means (7) for relocating the program read from 3) to an empty unit, relocating the program to each unit unit by unit, and thereby performing data processing. control method.