JPS5816546B2 - Page control data processing system control method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention provides a control method for a page control data processing system, in particular, a method for controlling a page control data processing system, in particular, in which resources such as programs required by a plurality of tasks in which multiple processing is performed are currently used by one task. A page control data processing system that efficiently utilizes the storage area existing on the main memory by securing space on the main memory for the page size of the resource to be used and controlling the space to be held. It is related to the control method.

Conventionally, when performing multiple processing using online processing,
A map is provided corresponding to each task (corresponding to an application program), and the contents of the map indicate the page address location on the main memory of the data and program required for the processing that the task is trying to execute. It is made to be.

Assuming that the program resources to be executed by the task are resources ■, ■, ■, ■, ■, the page size corresponding to the longest resource among the resources is to be occupied at the time of startup of the task. was.

That is, a method is adopted in which the program resources used by the tasks are divided into segments such as the above resources ■, ■, ■, ■, ■, and only one of the resources used by the task for the time being is stored in the main memory. Ru.

However, in the case of the conventional method, since a method is adopted in which a predetermined space is occupied on the main memory when a task is started, even if the segment division method is adopted as described above, the Problems such as these remain.

That is, in order to occupy a predetermined space at the time of startup, resources ■, ■, ■, ■, ■ that have the maximum page size among the resources that will be adopted and used, for example, a resource corresponding to the page size of resource ■. It becomes necessary to secure the above space.

For this reason, for example, even though resources with the minimum page size are being used for the time being, an extra page position on the main memory is occupied, and the storage area of the main memory is is not necessarily used efficiently enough.

Furthermore, if the resources are divided into smaller pieces in order to save the storage area, the process of managing which resources are being used becomes extremely complicated.

An object of the present invention is to solve the above-mentioned problems, and to improve the utilization efficiency of the storage area of the main storage device by placing the minimum component of the resources that are currently used by the task in the storage area of the main storage device. It is an object.

When one task in a call attempts to secure a resource that will be used for the time being, if that resource is placed on the main memory by another task, the same resource must be placed on the main memory in duplicate. The aim is to further improve the above-mentioned utilization efficiency by making the resources available for common use without having to do so.

Therefore, the page control data processing system control method of the present invention corresponds to the task so that the data and program necessary for processing a given task store page address information stored on the main storage device. a map that can be created, a page control table that is created corresponding to each page position on the main memory, and an empty page matrix table that manages empty page control tables in the page control table in the form of a queue, In a page control data processing system that progresses processing while managing page information on the main memory, a resource control word is used for each resource, which is a data call or a program, used by each of the plurality of tasks. After the task starts running the program, the page size of the program resource to be used for the time being is divided into the contents of the page control table and the free space by a macro instruction on the use processing program. Based on the contents of the page control table, the resource is secured on the main memory, the resource is held on the main memory, and recorded on the corresponding resource control word, and the program resource is stored on the main memory. The page address information contained in the program resource is controlled to be recorded in the corresponding map, and when the task that is currently using the program resource no longer uses the program resource, the record in the corresponding resource control word is deleted and the The contents of the resource control word and the page control table indicate that the program resource to be secured is stored in the main memory by another task. When it is determined based on the above-mentioned information, the program resource is controlled to record the page address information of the program resource on the map corresponding to the task.

This will be explained below with reference to the drawings. Figure 1 is an explanatory diagram illustrating the relationship between a map created in response to a task and the actual page position on the main memory indicated by the contents of the map, and Figures A' and B are for the conventional segment method. FIG. 3 is an explanatory diagram conceptually explaining the system of the present invention, and FIGS. 4 A and B are explanatory diagrams respectively explaining the enlarged macro instruction and reduced macro instruction according to the present invention. 5 shows the configuration of an embodiment of the processing method according to the present invention,
FIGS. 6 and 7 show a flowchart of an embodiment of the processing operation according to the present invention using the configuration shown in FIG.

In a page control data processing system, when executing processing by one task, the resources required by the task, that is, the data resources and program resources, are stored in which real page location on the main storage device. In order to provide instructions, a map is prepared corresponding to each task.

FIG. 1 shows this mode, where 1 is a map, 2 is a main memory, and 3-1, 3-2, . It represents the page position (or page information).

Map 1 corresponding to one task has storage locations for, for example, 64 words.

Now, the resources required for the task are real page address locations ADR81, ADR82, etc. on the main storage device 2.
・If it exists, the page address information ADR81 corresponds to the storage location of the above map 1, one by one.
, ADR82, . . . are stored.

Needless to say, it is up to the operating system (O8) of the data processing system to decide which real address location on the main memory 2 the above resource should reside in, and the location of each page on the main memory is , also commonly used by other tasks.

Figures 2A and 2B explain the problems with the conventional segmentation method. In the figure, task A consists of data (
The allocation is shown as requiring resources (including the program that performs the processing) and program resources.

The solid line length corresponding to each resource shown in FIG. 2A is shown as corresponding to the size (page size) of the corresponding resource.

Conventionally, in order to efficiently use the storage area on the main storage device 2, the resources required by a task, for example, task A, are divided into multiple resources, ■, ■...■, and one of them is stored at a time. As for the resources (1), (2), (2), (2), (2) of which only one is used, a segment method is adopted in which they are not placed on the main storage device 2 at the same time.

That is, in the case of the segment method, the following method is adopted.

(1) When executing the process corresponding to task A, when the task A is started, a page size corresponding to the predetermined page size corresponding to the task A is stored on the main storage device 2 as shown in FIG. 2B. Secure space 4A.

. (2) The spaces 4A are generally secured at discrete positions as explained in connection with FIG. 1, but the size of the spaces 4A is as shown in FIG. 2A.

To explain this, spaces 4-1 corresponding to the page size of the data resource and space 4-2 corresponding to the page size of the program resource ■ or the largest program resource ■ among the program resources ■ are stored simultaneously. be made sufficient for

(3) Now, when task A processes the contents of the data resource based on the program resource ■, the data resource is held in the space 4-1 above, and the program resource hold it above and perform the predetermined processing.

(4) When task A next processes the contents of the data resource based on program resource ■, the above space 4-2
The upper program resource 2 is deleted and a new program resource 2 is retained.

As mentioned above, in the case of the conventional segment method, a plurality of program resources are used mutually exclusively.

By storing only one of ■, ■, ■, and ■ on main memory 2, we are trying to effectively utilize the storage area of main memory 2, but for task A, Considering the state in which, for example, program (2) is held in the occupied space 4-2, the page size indicated by the dotted line in FIG. 2A is not used.

In the case of the present invention, the above-mentioned problem is solved by employing simple processing.

FIG. 3 conceptually explains the scheme of the present invention.

The symbol IA in the figure is a map corresponding to task A, 1
B is the map corresponding to task B, 2 is the map 1A above now
and 1B represent the main storage as existing externally, 4-I A is the data resource storage space of task A used by task A, 4-2A is the program resource ■ storage space used by task A for the time being, 4-IB is task B's data resource storage space used by task B, 4-2B
indicates the program resource ■ storage space that task B will use for the time being.

4-2A and 4-2B show the program resource (2) storage space when both tasks A and B use the program resource (2) at the timing.

In the case of the present invention, considering the processing of tasks A, . . . H, the retention of resources on the main memory device 2 is controlled as follows.

That is, (5) a space 4-1A sufficient to hold the data resource DA required by task A- is secured on the main storage device 2 based on a free page matrix table, which will be described later with reference to FIG. Data resource D in the space 4-1A
A is transferred from an external large storage device (not shown) and stored, and then the first page address information ADR8DA of the space 4-1A is recorded on the mask 1A.

(6) When task A uses program resource ■ for the time being, space 4-2 sufficient to hold program resource ■
A person is secured in the main storage device 2 in the same manner as above, and the program resource ■ is transferred from the external large storage device and stored in the space 4-2A, and then the space 4-2A is stored on the map 1A. First page address information ADR8■A
is recorded.

(7) Task A then processes the contents of data resource DA using program resource ■.

(8) Next, if task A begins to use program resource ■, the illustrated space 4-2A will be released and the page address information ADR8■A in the map 1A will be released.
is cleared, and a space 4-2AB sufficient to hold program resource ■ is secured on the main storage device 2 based on the free page matrix table in the same way as above, and the space 4-2AB is cleared.
The program resource ■ is transferred from the external large storage device and stored in -2AB, and the corresponding space 4-2A is placed on one map.
The leading page address information A D RS■ of B is recorded.

(9) Task A then processes the contents of data resource DA using program resource (2).

(10) For task B, the data resource DB is similarly stored in the space 4-1B, and the program resource (2) to be used for the time being is stored in the space 4-2B, and then processing is performed.

(11) Task A is currently holding program resource ■ on space 4-2AB, and when task B attempts to use program resource ■ for the time being, program resource ■ has already been stored in space 4-2AB. Since it can be seen from the respective contents of the resource control word γ and the page control table 5 that will be described later that it is held on -2AB, the processes of securing the space and storing the program resource ■ described above are omitted. It is sufficient to simply record the first page address information ADR8■ of space 4-2AB on map 1B.

(12) In this state, only task A attempts to use another program resource, for example, ■, and when the resource ■ becomes unnecessary, it simply clears the address information ADR3■ on the map IA.

In other words, the program resource ■ which is the content of space 4-2AB
Space 4-2A is used by Task B, so space 4-2A
B will never be released.

In the case of the present invention, as described above, in order to proceed with processing while securing a space commensurate with the page size of the program resources that each task is trying to use for the time being, as in the method shown in FIG. It never occupies space 4-2.

Furthermore, when a plurality of tasks use the same program resource, only one such resource is held on the main storage device 2 so that each task can use it in common.

Therefore, compared to the method shown in FIG. 2 in which the same resource needs to be held in duplicate on the main storage device in such a case, it is possible to further increase the effective use of the storage area of the main storage device 2. Become.

The above processing mode will be explained in more detail below.

FIGS. 4A and 4B respectively explain the enlargement macro instruction and the reduction macro instruction according to the present invention.

Now, as shown in FIG. 4A, task A completes processing for data resource DA using program resource ■, task B first processes data resource DB using program resource ■, and then program resource ■ It is assumed that processing is performed by utilizing the information.

This assignment is known when the user attempts to run the zip and is prompted as follows.

That is, in this case, making the program resources available for use through the above process is referred to as "program expansion" in this specification, and conversely, making the program resources unusable is referred to as "program reduction." However, for example, in response to task B, the expansion macro instruction '>a for resource ■ is first given, then the contraction macro instruction ◆b for resource ■ is given, and then the expansion macro instruction A? for resource ■ is given. c is given and instructed by the user to...

FIG. 5 shows the configuration of an embodiment of the processing method according to the present invention,
FIG. 6 and FIG. 1 show flowcharts for the cases in which the enlargement macro instruction is given and the case in which the reduction macro instruction is given, respectively.

In FIG. 5, IA, IB, ..., IP are maps that can be created corresponding to each task, 2
5-0, 5-1, . . . are main storage devices including the central processing unit.
, 5-n are page control tables (PC location), 6 is empty page matrix table (EPGQL), 1-■, γ
-■, ..., 1-O are resource control words (RCW), respectively.
, 8-1.8-2° . . . , 8-r represent empty pages, respectively.

Page Control Table
ble) 5 is a table prepared for managing the storage area of the main storage device 2, and one table P device is prepared corresponding to each real page position in the storage area.

In the table, real address information of the real page position, the number of the resource currently using the real page position, for example, the number of the resource (2), in other words, the number information of the RCW7-2, etc. are stored.

Empty Page Que
eueLimit) 6 is a table prepared for managing the page control table P devices that are currently in an empty state.

In the table EPGQL, there is an empty PCTBL (
In the illustrated case, real page address information of the PCTBL corresponding to the free page 8-1), information on the number of free PC locations (1 in the illustrated case), etc. are stored.

Resource Control Word
%rd) is 1 the above data resource or program resource■,
(2) This is a table that is created in one-to-one correspondence with .

Then, within the word RCW, there are resources such as the page ■.
Size information, the origin (logical address information) of the resource (2), real page number (or address) information on the main storage device 2 where the resource (2) is currently stored, etc. are stored.

The operation corresponding to the enlarged macro instruction will be explained below with reference to FIG.

As shown in Figure 5, the free page matrix table (EPG
It is assumed that free pages 8-1 to 8-r are registered for QL') 6, and one enlargement macro command (supervisor call SVC enlargement) is issued from the user processing program 9, as shown in FIG. Suppose that

Note that at this time, the user processing program 9 is not instructing which program resource, for example, the resource (2), to be expanded.

At this time, the (13) system program interrupt analysis routine determines that the program is to be enlarged, and the parameters and the like are checked.

(14) Then, the contents of the resource control word (RCW) γ-■ corresponding to the resource to be expanded, for example, ■, are checked.

(15) If it is found from the contents of the resource control word (actual page number) that the resource to be expanded does not exist on the main storage device 2, that is, in the case of X shown in the figure, the free page matrix table (EPGQL) 6 It is checked whether there is an empty page corresponding to the page size (for example, 3 pages) of the resource ■ by examining the contents of the resource ■.

If it does not exist, other processing is performed at that point, such as rolling out the old page, but suppose it does exist now.

(16) Remove empty pages 8-1, 8-2, and 8-3 (shown in FIG. 5) from the empty page matrix table (EPGQL) 6.

(17) And the said page 8-1.8-2.8-3,
Connect to source control word (RCW') 7-■.

In other words, the page number is expressed as a resource control word (RCW) γ-■
Write inside.

Of course, in this case, the contents of each page control table (on the PC) 5 corresponding to the pages 8-1.8-2.8-3 are updated to a busy state.

(18) Next, the contents of the resource (2) to be expanded are transferred from the external large storage device to the above pages s-i, s-2, s-2, of the main storage device 2.
8-3.

(19) Then, the page address information of the page 8-1 is recorded on the map 1 as explained with reference to FIG.

(20) Then, the operating system startup routine is entered, and the user processing program 9 resumes processing.

・(21) As a result of the above process (14), resources to be expanded■
is being used by another task and has already been stored in main memory 2.
If the resource is located above, that is, in the case of Y shown in the figure, the actual page position where the resource to be expanded is currently stored is checked based on the contents of the resource control word 7-■.

(22) Then proceed to the above processes (19) and (20).

In other words, resource (2) used by other tasks will be shared.

(23) As a result of the above process (14), the resource ■ has been used before, and the resource ■ exists at the page position (that is, there is no resource on the page control table 5 corresponding to the page position). 1 size in which the number of the resource control word RCW corresponding to (1) is recorded), but if the page position is in an empty state, that is, in the case of Z shown in the figure, the page is in the empty page matrix table (EPGQL) 6. There's just a queue at the top.

From this, we can define the page in the free page matrix table (
Remove from EPGQL')6.

That is, the page is connected to the resource control word γ-■.

(24) Then proceed to the above process (19), @).

Having explained the processing operation according to the enlargement macro instruction, the operation corresponding to the reduction macro instruction will now be explained with reference to FIG.

As shown in Figure 5, page 8-1.8-2.8-3 is the resource control word (RCW')? -■, and one reduction macro command is issued from the user processing program 9 as shown in FIG.

At this time, (25) the O8 interrupt analysis routine determines that program reduction processing is being performed, and checks parameters and the like.

(26) Then, the contents of the resource control word (RCW) 7-■ corresponding to the resource to be reduced, for example, ■ and the contents of the page control table 5 are checked.

(27) If there is no other task using the resource ■ to be reduced, that is, in the case of ■ shown in the figure, the resource control word (
RCW)? -Delete the page numbers of pages 8-1, 8-2, and 8-3 from ■.

Then, the page 81.8-2.8-3 is connected to the empty page matrix table (EPGQL) 6.

Of course, as a result, the contents of the page control table (PCTBL) 5 corresponding to each page are updated to an empty state.

(28) Next, the real address information of the resource ■ to be reduced is
Clear map 1.

That is, the amount corresponding to the page size of the resource (2) is cleared.

(29) Then, the OS program startup routine is entered.

(30) As a result of the above process (26), if another task is using the resource (2), that is, in the case of W shown in the figure, the process immediately moves to the above processes (28) and (29).

The processing corresponding to FIG. 6 and FIG. 1 is performed by the processing unit shown in FIG. It may be considered that the operating system is started and executed by an enlargement macro instruction or a reduction macro instruction from a user processing program using the contents of the corresponding resource control word 1.

As explained above, according to the present invention, each task only needs to occupy the storage area on the main storage device 2 according to the page/v size of the program resource that it is actually trying to utilize, and the storage area can be used extremely efficiently. As it is used, it is possible to expand the storage area to an infinite extent, and the program structure that is called has good flexibility, such as a reentrant structure.

In addition, in processing operations for this purpose, resource control words (RC
It is sufficient to prepare a resource control word (W) and record the page position used by the corresponding resource in the resource control word (RCW), and the processing does not become complicated.

[Brief explanation of drawings]

Fig. 1 is an explanatory diagram illustrating the relationship between a map created in response to a task and the actual page position on the main memory indicated by the contents of the map, and Fig. 2 A, , and B show the conventional segment method. An explanatory diagram explaining the problems in
Fig. 3 is an explanatory diagram conceptually explaining the method of the present invention;
Figures A, , and B are explanatory diagrams for explaining enlarged macro instructions and reduced macro instructions, respectively, according to the present invention, FIG. 5 shows the configuration of an embodiment of the processing method according to the present invention, and FIGS.
1 shows a flowchart of an embodiment of the processing operation according to the present invention using the configuration shown in the figure. In the figure, 1 is the map, 2 is the main memory, and 3 is the page location (
or page information), 4 is space, 5 is page control table (PCTBL), 6 is free page matrix table (
EPGQL), 1 represents a resource control word, and 8 represents an empty page.

Claims (1)

[Claims] 1. Page address information where the data and programs necessary to process a given task are stored on the main memory. A map created in response to the above task to store the information, and the location of each page on the main memory. It is equipped with a page control table that can be created correspondingly to the page control table, and a free page matrix table that manages the free page control tables in the page control table in the form of a queue, and processes while managing page information on the main memory. In the progressing page control data processing system, a resource control word is prepared corresponding to each resource, which is data or a program, used by each of the plurality of tasks, and after the task runs the program, the resource control word is A macro instruction stores the page size of the program resources to be used for the time being in the main memory based on the contents of the page control table and the free page control table among the program resources used by the one task. The program resource is secured and held in the main memory and recorded in the corresponding resource control word, and the page address information where the program resource is stored in the main memory is recorded in the corresponding map. control,
When a task that actually used the program resource no longer uses the program resource, control is performed to delete the record on the corresponding resource control word and the record on the corresponding map, and further attempts to secure the above resource. When it is determined based on the contents of the resource control word and the page control table that the program resource to be executed is stored in the main memory by another task, the program is displayed on the map corresponding to the task. A control method for a page control data processing system, characterized in that the page control data processing system is controlled to record page address information of a resource.