JPH04170643A - Optimum segmentation determining system - Google Patents

Abstract

PURPOSE:To reduce the replacing frequency of segments by executing a temporarily linked load module and connecting each load module in accordance with the number of accesses. CONSTITUTION:A program is executed by the state which a load module stored in the external storage device 12 is developed on a main storage device 14 and each instruction is processed by a CPU 13. In the case of executing segmentation, a module relation information table 15 having an area for storing module accessing/accessed relation and an area for storing the number of accessed times is previously formed. Then, a temporarily linked road module is executed and an accessing module, an accessed module and the number of accesses between both the modules are stored in the table 15. Segment table groups 16 are successively formed by combining plural modules in accordance with the descending order of access frequency. Consequently, the probability of including a required module in the main storage is high, so that the replacing frequency of segments is reduced.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to an optimal segmentation system.
In particular, it relates to the load module structure of programs, and particularly to segmentation in overlay structures.

[Conventional technology]

If one program cannot be stored in the main memory area, the load module is executed in an overlay structure. That is, the program is divided into several parts (called segments) that are not executed simultaneously, and only the necessary segments are stored in the main storage area and executed. In many cases, a program is composed of a large number of modules (or sometimes called subprograms) using structured programming techniques, and when linked, these modules are put together to form a plurality of segments. At this time, the process of combining which modules into one (this process is called segmentation) was carried out by simply focusing on the size of the segments.

[Problem to be solved by the invention]

Focusing only on the conventional segment size described above does not necessarily result in optimal segmentation, and there is a high probability that the segment required during execution does not exist in the main storage area, resulting in frequent segment replacement. This was a factor in the performance deterioration of throughputs, etc. Furthermore, in order to obtain the optimal segmentation, a lot of time was required as trial and error was repeated using synimilation and the like.

[Means to solve the problem]

The optimal segmentation system determining system of the present invention includes an input device for inputting operation instructions, an external storage device for storing a load module, a central processing unit for executing a program, and a main memory for storing the program when the program is executed. It has a device, a module related information table that stores the presence or absence of an ink face between modules in structured programming, etc., a group of segment tables that stores names of modules that are grouped into segments, and an output device that outputs execution results. .

〔Example〕

Next, the present invention will be explained with reference to the drawings.

FIG. 1 shows one embodiment of the present invention, and the basic idea will be explained here as well. In FIG. 1, a program is generally executed in such a manner that a load module stored in an external storage device 12 is loaded onto a main storage device 14, and the central processing unit 13 processes each instruction. In addition, instructions to start their execution are issued from the input device 11, and processing results are output to the output device 17. In a load module with an overlay structure, the unit of expansion in the main storage device 14 is a segment, and the object of the present invention is to reduce the number of times the segment is expanded as much as possible.

When performing segmentation, first, a module related information table 16 is created in advance, which has an area for storing the module calling/calling relationship and the number of times the module is called.

Next, the linked load module is temporarily executed and the number of times which module has been called by which module is stored in the module related information table 15. Then, a segment table group 16 is created by combining modules that are related to each other frequently. At this time, there is a limit to the size of the segment, so do not exceed this limit.

To explain the module related information table 15,
Now the program “PROGl” is “PROGOO”~“
When the module-related information table 15 is composed of a plurality of modules of "PROG95" and has the hierarchical structure shown in FIG. 2, the module-related information table 15 is created as shown in FIG.

Next, creation of the segment table group 16 will be explained. Assuming that the number of times the linked load module is executed and the module is called takes the value shown in Figure 5, and the size of each module that makes up the program "PROGl" takes the value shown in Figure 4 (the unit is Bytes).

Furthermore, the segment size is 16KB (kilobytes)
up to. Module related information table 15 in Figure 5
are sorted in descending order using the number of times as a key, resulting in the state shown in FIG.

First, item number 1 of the module related information table 15 in FIG. 6 will be described. Create segment table 16-1 and add modules “PROG30” and “PROG32” here.
” and each size are registered, and the total size is calculated. Then, the state shown in FIG. 7 will be obtained.

If you do the same for item number 2, it has nothing to do with the module registered in the segment table 16-1 mentioned above, so create a new segment table 16-2 and enter the module name, module size, and total value. When each is registered, the state shown in FIG. 8 will be obtained.

In this way, when a module unrelated to the previous module appears, a new segment table is created and registered. Also, if the module to be called or the module to be called is already registered in the segment table, add the module that is not registered in the segment table,
Repeat the process of adding the sizes.

, for item number 7, “PROGIO” and “PRO
This is the process of putting together "Gl3", but the calling module's "
Since “PROGlo” is registered in the segment table 16-2 as shown in FIG.
However, the total size is 17E38OB (bytes), which is 1 of the segment size.
It cannot be added because it exceeds 6KB. As a result, a segment table for one module is obtained, such as segment table 16-5 in FIG.

Regarding item number 12, “PROG20” and “PROG20”
G92".The state immediately before that is as shown in FIG. 10, where "PROG20" is registered in the segment table 16-4 and "PROG92" is registered in the segment table 16-8.The two segments The total size of the table is 13520B or 16KB.
Since it is as follows, it is possible to integrate the segment table 16-4 in FIG. 11. Here, the integrated segment table 16-8 is no longer needed and is therefore deleted.

Regarding item number 15, “PROG32” and “PROG32”
G94'', but they have already been registered in segment table 16-1 and segment table 16-6.The total size of the two segment tables is 16720B, which exceeds 16KB, so they cannot be combined, and as a result, The state is shown in Figure 12.As a result of the above processing, the segment size is 18K.
In case B, the segmentation becomes as shown in FIG.

Now, consider a case where the segment size is 32KB. In this case as well, the size of the segment table is 32K.
Exactly the same processing as when the segment size is 16 KB can be performed, except that the segment size must be less than or equal to B. However, in the process of combining "PROG30" and "PROG33" of item number 19 in the module related information table 15 in FIG.
As shown in the figure, both modules have already been registered in the segment table 16-1. In such a case,
The segment table group 16 is not changed and the next item number is processed.

As a result of the above processing, the segment size is 3.
In the case of 2KB, the segmentation is shown in FIG. 15.

〔Effect of the invention〕

As explained above, in the present invention, since relationships that are called more often are prioritized and grouped together, there is a high probability that the required module exists in the main memory, and as a result, the number of times segments are replaced is reduced. Furthermore, segmentation does not require much time since it only requires the time to execute the temporarily linked load module and the time to create a group of segment tables.

[Brief explanation of drawings]

FIG. 1 is a schematic diagram of the present invention, FIG. 2 is a diagram showing an example of a program structure, FIG. 3 is a diagram showing an example of registering a module related information table based on the structure diagram of FIG. Figure 4 shows a list of modules that make up the structure diagram in Figure 2.
The figure shows an example of creating a module-related information table after executing a temporarily linked load module, FIG. 6 shows the state of the module-related information table in FIG. 5 after sorting, and FIGS. 7 to 12 The segment size is 18KB
FIG. 13 shows an example of creating a segment table group when
The figure shows an example of segmentation result output when the segment size is 18KB, Figure 14 shows an example of creating a segment table group when the segment size is 32KB, and Figure 15 shows an example of segment table group creation when the segment size is 32KB. It is a diagram showing an output example of a segmentation result. 11... Input device, 12... External storage device, 13.
...Central processing unit, 14...Main storage device, 15...
Module related information table, 16... Segment table group, 17... Output device, 16-1 to 16-8.
...Segment table.

Claims (1)

[Claims] An input device for inputting operation instructions, an external storage device for storing load modules, a central processing unit for executing programs, a main storage device for storing programs during program execution, and a storage device between modules in structured programming, etc. In a system that has a module-related information table that stores the presence or absence of an interface, a group of segment tables that stores module names that are grouped into segments, and an output device that outputs the execution results, if you temporarily execute a linked load module, An optimal segmentation determination system is characterized in that which module is called and how many times it has been called is recorded in a module related information table, and the connection is performed based on the relationship that has the most number of calls.