JPH01150936A - Program executing system - Google Patents

Abstract

PURPOSE:To make the execution of a program faster by providing a collective segment preparing means in a linker, a batch loading instruction segment preparing means and a page input means in a page loader. CONSTITUTION:A collective segment preparing means 22 in a linker 2 prepares a collective segment which collects related segments, and a batch loading instruction segment preparing means 21 in the linker 2 prepares a segment descriptor related to the collective segment prepared by the collective segment preparing means 22 in batch loading instruction segments 31 and 31'. Further, a page input means 41 in a page loader 4 loads the page corresponding to the collective segment related to the segment descriptor to a real memory 7 based on the segment descriptor in the batch loading instruction segments 31 and 31' prepared by the batch load instruction segment preparing means 21 at the time of the execution of the program. Thus, the generation of a page absence fault decreases, the time of an input/output processing is shortened based on the decrease of the number of page inputs/outputs, and the execution speed of the program is made faster.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a program execution method, and in particular to a computer system that adopts a virtual storage method called a segmentation baging method (a computer system in which a program is divided into pages in which virtual space is divided into fixed size pages). The present invention relates to a program execution method in a computer system in which segments, which are division units, are associated with each other and a program is executed while pages are loaded onto real memory as necessary.

[Conventional technology]

Conventionally, in this type of program execution method, when an object module is converted into a load module by a linker, segments on the load module are associated with pages in a virtual space based on information in the object module.

Segments on the load module (segments associated with pages) are moved to a file called a banking store file during execution, and the program is executed while inputting and outputting pages between the backing store file and real memory. It will be executed.

The correspondence between real storage and banking store files and virtual storage is managed by a table called a page table.

The page table shows the status of pages in the virtual space, and indicates whether each page exists in real memory or in the banking store file (the page actually exists in the real memory or backing store file). If the page exists in real memory, it indicates the location of the page in real memory. If the page exists in the backing store file, it contains information indicating the location of the page in real memory. contains information indicating the location of that page on the backing store file.

If a page containing a location to be referenced does not exist in real storage during program execution, a page-absence fault occurs and a page loader is activated.

In the page loader, the required page (actually a segment corresponding to the page) is loaded from the backing store file onto real memory, and the page is loaded onto real memory at the page pointer on the page table corresponding to the loaded page. information indicating that the load module has been executed is set, and control is passed to the program implemented by the load module.

FIG. 2 is a block diagram showing the configuration of an example of the conventional program execution system as described above. Next, the operation of the program execution system configured as described above will be explained.

In the linker 20, object modules are input from the object file IO, and each segment is assigned to a page P1. P2. ..., the page table 6 on the virtual space 60 in association with Pn (n is a positive integer)
While 01 is being created, the rotor module 30 is created and output.

The load module 30 created by the linker 20 (
Segments 5EGI, 5EG2. ..., SEGm(m
is a positive integer)) are transferred to the buffing store file 50 (segments 5RCI', 5E on the backing store file 50) by a transfer means (not shown).
G2', -, SEGm' are segments 5EGI, 5E
G2.・=, which is equivalent to SEGm) at program execution time.

When a program realized by such a load module 30 is executed (segments 5EGI and 5EG2 (segments 5EGI' and 5EG2')
are allocated to pages P1 and P2, respectively), segment 5RGI (SEGI '
), if a reference is made to a location within
The page PI (actually, the page PI
The page loader 40 determines whether the segment SP:G1′) corresponding to .

With this determination, page P1 is the backing store file 50.
If the page PI (segment 5EGI' on the backing store file 50 corresponding to page P1) is stored in the real memory 70 by the page loader 40 (if a page fault occurs) 7
0 and page P on page table 601
The page loader 40 sets information indicating "loaded" to the page pointer indicating the state 1, and control is passed to the program implemented by the load module 30 (if no page fault occurs, control is immediately passed to the program). is passed).

As the program progresses, segment l-3EG2 (SE
Similarly, when a reference is made to a location in G2'), when a page fault occurs, page loader 40 loads page P2 onto real storage 70.

As explained above, in the conventional program execution method,
Each time a page fault occurs, the necessary pages are loaded one by one onto real memory and the program is executed.

[Problem that the invention seeks to solve]

In the conventional program execution method described above, only one page can be loaded into real memory at one loading time, so when the program becomes large-scale and the number of segments increases, When the number of references to the location increases, page faults occur frequently, and the increase in the number of page input/outputs increases the time required for input/output processing, resulting in a decrease in program execution speed.

In view of the above-mentioned points, an object of the present invention is to load a plurality of necessary pages onto real memory in one loading operation, thereby reducing the occurrence of page faults and reducing the number of page input/outputs. An object of the present invention is to provide a program execution method that reduces output processing time and increases program execution speed.

[Means for solving problems]

The program execution method of the present invention includes a set segment creation means in a linker that creates a set segment in which related segments are grouped together, and a segment descriptor for collectively loading segment descriptors related to the set segments created by this set segment creation means. a set of segment descriptors based on the segment descriptors in the batch load instruction segment created by the batch load instruction segment creation means in the linker when the program is executed; and page input means in a page loader for loading a page corresponding to a segment into real memory.

[Effect]

In the program execution method of the present invention, the set segment creation means in the linker creates a set segment that collectively includes related segments, and the batch load instruction segment creation means in the linker creates a set segment related to the set segment created by the set segment creation means. A segment descriptor is created in the bulk load instruction segment, and the page input means in the page loader writes the segment description based on the segment descriptor in the bulk load instruction segment created by the bulk load instruction segment creation means when the program is executed. Load the page corresponding to the child aggregate segment into real memory.

〔Example〕

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

FIG. 1 is a diagram showing the configuration of an embodiment of the program execution method of the present invention. The program execution method of this embodiment includes an object file 1, a linker 2, a load module 3, and a page loader. 4, a backing store file 5, a virtual space 6, and a real memory 7.

Object file 1 is object module M
l (consisted of segments 5RGII and 5EG12), M2 (segments 5EG21 and 5E
G22),...

Mj! (J is a positive integer) (object module M2 is called from object module M1).

The linker 2 includes a bulk load instruction segment creation means 21 and a set segment creation means 22.

Load module 3 is batch load instruction segment 31
and set segment 31 (segment 5EG11.5B
G12.5EG21 and 5BG22), S2. ..., Sk (k is a positive integer).

The page loader 4 includes page input means 41.

The backing store file 5 includes a bulk load instruction segment 31' and a collection segment 81' (segment 5
EGI1.5EG12.5EG21 and 5EG22), S2', . . . , Sk'.

The virtual space 6 has a page table 61 (actually the real memory 7
etc.) and pages P1゜P2.・・・
, Pj (j is a positive integer).

Next, the operation of the program execution method of this embodiment configured as described above will be explained.

The set segment creation means 22 in the linker 2 receives information (segments 5EGI1, 5EG12, 5E) input from the object file 1 by an input means (not shown).
"Call relationship (relationship in which something is called by something else)" and "definition/reference relationship (relationship where something is called by something else)" between G21 and 5EG22, etc.
Segment 5EGI1.
Based on the information showing the relationship between 5EG12, 5EG21 and 5EG22 etc., segments 5EGII, 5
EG12, 5EG21 and 5EG22 are grouped together) Set segment 31 containing Sl. S2.・
..., Sk is created on the load module 3.

Furthermore, the set segment creation means 22 generates set segments) 31, 32. . . , Sk is the page PI on the virtual space 6, P2 . . . , Pj, a page table 61 is created based on the association, and the set segments Sl, 32 . ..., the size and attributes of Sk and the set segment) Sl, 32. ...,
Pages P1゜P2.corresponding to Sk. ..., information on the position of Pj in the virtual space 6 is passed to the batch load instruction segment creation means 21 in the linker 2.

The batch load instruction segment creation means 21 generates the set segments 31, 32, etc. based on the above information passed from the set segment creation means 22. ..., segment descriptor for Sk (set segment Sl, 3 based on the above information)
2. ..., the size and attributes of Sk and the set segments 31.32. ..., page P1 corresponding to Sk
．． P2. ..., information describing the contents of the set segments Sl, S2, ..., Sk, such as the position of Pj in the virtual space 6) is created in the bulk load instruction segment 31 and output to the load module 3. .

The load module 3 created by the linker 2 in this way is transferred to the backing store file 5 by a transfer means (not shown) when the program is executed. The set segments S1, S2..., Sk on the load module 3 become the batch load instruction segment 31' on the backing store file 5 of the transfer destination.
'.

..., Sk').

During the execution of the program realized by the load module 3 created as described above, segment 5EG11
If a reference is made to a location in segment S (assuming that set segment S1 is allocated from the beginning of page P1 to page P2), segment S
Pages P1 and P2 (actually the set segment corresponding to pages P1 and P2) S based on the page pointers indicating the states of pages PI and P2 on the page table 61 corresponding to the set segment S1 having EG11
The page loader 4 determines whether the file ``l''' exists in the backing store file 5 or the real storage 7.

If this judgment reveals that pages P1 and P2 do not exist on the real memory 7 (if a page absent fault occurs), the page input means 4 in the page loader 4
1, the pages P1 and P2 to which the set segment Sl' is allocated based on the segment descriptor related to the set segment Sl' in the bulk load instruction segment 31' (actually, the set segment 31' itself on the backing store file 5 ) is loaded onto the real memory 7,
Information indicating "loaded" is set to the page pointer indicating the status of pages Pi and P2 on the page table 61, and control is passed to the program realized by the load module 3 (if no page fault occurs, control is passed to the program immediately).

Furthermore, when the program execution progresses and object module M2 is called by object module Ml, pages P1 and P2 containing segments 5EG21 and 5EG22, which are components of object module M2, will receive a page fault fault corresponding to segment 5EGII. Since it has already been loaded onto the real memory 7 at the time of occurrence, the program continues without a page fault occurring, that is, without page input/output to/from the real memory 7.

〔Effect of the invention〕

As explained above, the present invention provides a set segment creation means and a batch load instruction segment creation means in the linker, and a page input means in the page loader, thereby preventing the occurrence of a page fault and reducing the number of page input/outputs. This has the effect of shortening input/output processing time and speeding up program execution.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention, and FIG. 2 is a block diagram showing the configuration of an example of a conventional program execution method. In the figure, 1... Object file, 2... Linker, 3... Load module, 4... Page loader, 5... Backing store file, 6... Virtual space, 7... Real Memory, 21... Batch load instruction segment creation means, 22.
...Collection segment creation means, 31.31' ...Batch load instruction segment, 41
...Page input means, 61...Page table. M1-M1...object module, P1-Pj
...Page, 81~Sk, St'~Sk'... Set segment, 5RGI1.5EG12.5EG21, 5EG22...
・It is a segment.

Claims (1)

[Claims] A set segment creation means in a linker that creates a set segment in which related segments are grouped together, and a segment descriptor related to the set segment created by this set segment creation means in a batch load instruction segment. Based on the bulk load instruction segment creation means in the linker to be created and the segment descriptor in the bulk load instruction segment created by the bulk load instruction segment creation means during program execution, it corresponds to a set segment related to the segment descriptor. A program execution method comprising: page input means in a page loader for loading a page to be stored into real memory;