JPS60163148A - Segment en bloc load system - Google Patents

Abstract

PURPOSE:To improve the processing capability including information representing whether or not the information in a segment has mutual relation and whether or not it is to be loaded en bloc to a workig set frame in the virtual storage of the segmentation paging system. CONSTITUTION:A virtual address space is assigned to each process, and an identifier WSID of a working set frame to which the segment page to be belonged and an en bloc load designation bit of the segment are provided to a segment describer SDi at a location designated by a part (i) of a virtual address VA from a segment table ST designated by a process control block PCB. Moreover, a control bit representing whether or not en bloc load is to be conducted to the entry WSCB of the working set management table WSCT addressed by the working set frame identifier is stored in addition to the page frame number and an address of a page list. The en bloc load or the loading of the corresponding page is conducted by the designation bit and the control bit.

Description

DETAILED DESCRIPTION OF THE INVENTION (Technical Field) The present invention relates to a segment batch loading method in a computer system that employs a segmentation paging method as a virtual storage method.

(Common technology) In a virtual storage system based on the segmentation method, a logical chunk of a program is defined as a segment, and this is used as a unit to protect the program and allocate the program to main memory.As mentioned above, a segment is a program Since it is a logical unit of Jt, its size depends on the program and differs for each segment.For this reason, when assigning a segment to a host, it is necessary to determine the size of the required segment. It is necessary to find the free area r of the main memory, and if there is no free area plus the size 'kA, then the size of the allocated segment on the main memory and the free area before and after it. , or the size of the segment, etc.?Determining which segments should be evicted from main memory by taking into account7C. Furthermore, as time passes, the small-sized area increases and the usage rate In order to prevent the performance from decreasing, there was a problem in that at some point, a process called garbage collection, which is a process of rearranging all the segments in main memory, was required.

On the other hand, in the paging method, a program is divided into pages of a fixed size, regardless of its logical structure. The main memory is also a block of the same size t) (hereinafter referred to as c
This has the advantage that it is not necessary to consider the size of free space as in the case of the segmentation method, which simplifies the management of allocation. .

Segment Yonfist paging method H, 7' is a logical version of the program (yc i ) k, and further,
It is divided into pages of a fixed size, and allocation to main memory is done in units of pages.This allows for logical management, such as protection of future information, to allocate main memory in units of segments. Such physical management can be performed on a page-by-page basis.

In normal virtual storage systems, a control system called an on-demand system is generally adopted.

This is due to the nature of the program, when it is detected that the page or segment containing the necessary information does not exist on the main memory, the page or segment that contains the necessary information is imported into the main memory, that is, the paging method. , or in the segmentation paging method, when a page absence is detected during program execution, a ``1N page 7 memory'' is searched for in the main memory to allocate this page, and if there is no free page 7 memory. To do this, pick up the assigned page frame, create an empty hage frame, and see if this page frame can be accessed by assigning it to the required page and transferring the required page information here. As mentioned above, in the on-demand method, when a page fault occurs, the page fault processing continues with the post-processing that stores the necessary page in the user's memory. , if all the pages that are strongly related to this page can be imported into main memory at the same time, when accessing the pages that were imported at the same time, page absence 7 will be displayed.
This means that processing can be carried out without generating O.

Furthermore, regardless of the number of pages to be processed, many parts of the necessary processing are required in the -times page absence processing, such as the entry of various control tables, process state management, page nog I10 start processing, end processing, etc. occupies . Therefore, how to handle page absence processing for multiple pages? Is the overall processing time longer if all the steps are done once, compared to when it is done multiple times for each page? It is possible to significantly shorten the time.

(Prior art) As mentioned above, in the segmentation paging method, segments can be identified as logically related groups, so if a page failure occurs at a certain point, the entire segment including the page failure is take in, i.e.
Batch loading suppresses the occurrence of page failures.

However, in such a conventional segment bulk loading method, when a certain part of a segment is accessed, other parts are likely to be accessed in a relatively short period of time, i.e., there are highly related segments. There are segments and non-segments, and is it possible to bulk load even relatively unrelated segments? This has the disadvantage that it is used unnecessarily and the performance of the computer system as a whole is degraded.

Additionally, whether or not bulk loading should be performed is also influenced by the free space of the main memory. In other words, if the main memory load is high, you may want to load related pages all at once. If the effect of loading is outweighed by the negative effect of pages being evicted to make room for bulk loading, bulk loading will have a negative impact on overall performance. There is a drawback that this occurs.

(Objective of the Invention) The object of the present invention is to enable specifying, as an attribute of a segment, whether or not information within this segment has a strong relationship with each other, and to place this on the segment descriptor.
By making it possible to specify whether or not to perform bulk loading for the working set frame, when a page failure occurs, the segment containing that page and the pages contained within that segment can be specified. Batch loading according to the above attributes of the working set frame to be connected? In the evening of the visit, it is possible to load only pages 7 and to reduce the frequency of occurrence of page absences, and to efficiently handle page absences 7 due to the unique free state of the user. It is possible to increase the execution speed of the program, reduce the overhead for handling page faults, and improve the processing power of the entire system. The loading method is to provide gold.

(Structure of the Invention) Is the method of the present invention a segmentation/basing method as a virtual hoisting method? In the segment batch loading method of the computer 7 system to be adopted, should the segments be loaded together with the information for specifying the working set frame r of the above to which the pages belonging to the segment should be connected and managed as segment information? The first control information indicating whether or not the working set frame should be read or not is held as the working set frame information, and the second control information indicating whether or not the working set frame should be read or not is held as the working set frame information. When the front load of a segment corresponding to a page is specified, the entire segment including the page is loaded into the main memory, and when at least one of the first and second control information does not specify a bulk load, only the page is specified. t Loaded into the main memory and configured.

(Example) Next, an example of the present invention will be described in detail with reference to the drawings. Figure 1 F3), tb) and Figure 2 (a)
.

tb), tc), ld), [e) 1. Configuration of control table for address translation and control table for main memory management in this embodiment? show.

In this embodiment, it is assumed that a virtual address space is given to each process, and the virtual address V
A is a segment address SA consisting of 32 bits, each consisting of 10 bits from the most significant.

Intra-segment page address PA of lO bits.

It is assumed that it is composed of a 12-bit in-page relative address P-A. Process control block P CB (
p) has an address space specification word ASWk.

The address space specification word ASW is the segment table ST
It has a size 5TSZ and a pointer 5TP7 to the segment table 8T. Pointer to segment table ST
Segment table 5TfiS'l'5 specified by P
Z(((H) segment descriptors SD, each segment descriptor SD contains segment state information SST, as shown in FIG. 2 [a).

Attribute information SAT, segment size (number of pages) PN
, has a pointer P'f'Pa- to the page table PT. As attribute information SAT of the segment, protection information PR
In addition to T, @ to which the page of this segment belongs, a working set frame identifier WSID, and a batch load designation bit Ll of this segment are provided.

The page table PT addressed by the pointer FTP to the page table PT of the segment descriptor SD is composed of the number of page descriptors PD specified by the size PN of the segment on the segment descriptor SD. As shown in FIG. 2 (I), each page descriptor PD provides page status information such as whether this page is on top or not.
Show biy)P.

A bin that indicates whether this page is valid.

It has bits W, , U, which indicate whether there is any write or access to this page, and a real page address RPA. When the top page address 几PA is P Bi and Soto is “l”,
That is, if this page is on the above IJiMM,
The above address? , when the P bit is "O", it indicates the response of the backing store BKST.

The following table shown in FIG. 1(b) is provided for real memory management.

Pool control block PLCM, free page? In the rounding control block for managing, as shown in FIG. 2(C), the number of free page frames PI, CNT, and the addresses of the first page and last page of the list of free page frames, PLTPTR and PLLPTR7
Motsu.

The working set management table WSCT is a table addressed by the working set frame identifier WSID.1) WSCB is a table addressed by the working set frame identifier WSID. The number of page frames belonging to (abbreviated) WSCNT.

Pointer indicating the address of the first and last page of the list of pages belonging to this WS class W8TPTl-1゜W
8LPT 几, control bit L indicating whether to perform bulk loading 7 for this W8 frame 2. Also includes other information.

The memory map table MMT has an entry t corresponding to each page frame above, and each memory map table entry MME is a state information F'ST of this page frame, as shown in FIG. 2 (eJ).

Related status information FUS, this page frame, a list of the number of page frames that are connected to the WS of C; forward and backward pointers FP and BP for management;
, dfvt information to indicate the virtual address r to which this real page is assigned, AD 几S.

Backing store address BS corresponding to this real page
ADR8 is retained.

In this embodiment, a real page (here, referred to as a t-page frame) is connected to either a pool frame or a working set frame (WS frame) and managed.

The 7 frames of all pages that have not been updated are shown in Figure 3, tag, (b
), the forward and backward pointers FP and BPK EX of the memory map table entry MME corresponding to each page 7 frames are connected in a list, and its first pointer yfPLTPTR and end pointer PLLPT are connected in a list.
几 and the number of pages connected to this list, ie, the number of available frames PLCNT, are registered in the pool frame control block PLCB.

As in the case of empty page frames, the page 7 frames in use are connected to and managed by any of the working set frames. The belonging of each page is specified in the segment descriptor 8D corresponding to the segment to which the page belongs in the tooling set frame.

Connection and disconnection of page frames to the working set frame and pool frame are performed using the WS control block WSCB or the pool frame control block PL, the number of pages in the CB WSCNT, the PI, and the CNT start pointer WSTPT.

PLTPTR and tail pointer WSLPTR, PLL
This is done by updating the pointers FP and BP'r of the memory entry MME.

How to connect page frame to WS frame and pool frame.

This is done by adding it to the top of the page list (see Figure 3th). The page 7 frame is separated from the pool frame starting from the end of the page list. The separation of the page 7 frame from the WS frame is determined based on the usage status of the page frame, etc., and is performed for the page frame at an arbitrary position on the talist.

When accessing the above address, conversion from a virtual address to a real address is performed as follows.

Here, the virtual address is 1 division 1 as segment address SA, page address PA! :l, mutter j.

Value as intra-page address PlIIA? ]l″.

First, the address space specification word ASW of the process control block PCB (p) of the currently executing process (p1
Starting address in main memory of segment table ST? know,
This first segment descriptor 5D11fr is read. Checks the status information SST of segment descriptor SD1, access protection information PRT, etc., and if the access is valid, starts page table PTi corresponding to segment l by boinking PTP to page table FT on segment descriptor SDi. Full address knowledge, this jth page descriptor PD date? One after another. If the P bit is "1", the required page exists on the main memory, and the page address on the main memory is known from the address address PA on the page descriptor PDij. When 5P="0", the central address can be obtained from the in-page address k of the virtual address.

That is, in the case of page absence, the following page absence processing is required.

Next, referring to FIG. 4, a seventh explanation of page absence processing in this embodiment will be provided.

When the program is executed, a page fault occurs @
, that is, the virtual address VA(SA2i.

PA=j, P几A=) to a real address, if the P bit of the page descriptor PDlj corresponding to the virtual page specified by the virtual address VA is 0, the page The following processing is performed as the absence processing: First, the state of the process that caused the page absence is set to an unexecutable state (step 101).

Next, read the segment descriptor 8Di2 corresponding to the segment i that includes this page, and check its batch load designation bit Llk (step 1027゜When the batch load designation bit L1 is "0", that is, if the batch load is not specified, The required number of pages is set to 1 and the process moves to the next step (step 1o3).

If the batch load designation bit Ll is “engine”, @, that is, if the batch load designation is specified, the corresponding segment descriptor SD4
is specified by the working set frame identifier WSID. Control pin 1- of working cent frame control block W80H
Check L2'r (step 104c) If this is 0'', that is, if the batch load is not specified, set the required number of pages as 'kl' and proceed to the next process (step 1037° control pitch) When L2 is l, That is, in the case of batch loading designation, the number of pages of this segment is obtained from the segment size PN on %SDi, and is set as the number of pages required for this meeting (step 105).

Next, the number of empty pages 7 frames PL of the pool frame control block
It is checked whether there are seven free pages, the number of pages required for CNTk reading (step 106).

If there is a page frame that is deemed necessary, the process moves to the next step. If there is not the required number of pages, page extrusion processing is performed to create empty page frames for the number of missing pages (step 107), and the required number of 'g'! , @Bage 7 After the frame creation is completed, the process moves to the next step at the 1ζ step of reconnecting the page frames.

That is, the necessary number of page frames are taken from the t-pool frame and connected to the WS frame specified by the corresponding WS frame (working set frame identifier WSII of segment descriptor 8Di) (step 108).

Next, the virtual address of the page that is newly connected to the corresponding WS frame and corresponds to the virtual address information LAD S of the memory map table end ljMMH corresponding to the page frame is pledged. That is, in the case of L1 = ``θ''', is the virtual address of the page where the page not present sound occurred? , L1-“l
", the virtual addresses of all pages in the segment containing the page that occurred due to the page fault are sequentially set in each memory map table entry MME. The virtual addresses include the identification name (ip) of the process that caused the page fault, and , segment address SA, page address PA
is written (step 109).

Next, reconnect the memory map table entry i to indicate that the page 70 page 7 frame is not paged & being processed.
A state indicating that the process of reconnecting to JMME is in progress is entered (step 110).

Thereafter, the following process is performed to transfer information from the banking store BKST to the newly allocated queen i-page 7 frame. The page to be transferred (if it is not a batch load, the page that caused the page fault; if it is a batch load, the page descriptor F that corresponds to all the pages included in the segment that causes the page fault sound to be generated and includes the nine-page charge)
D=, and the backing store address where the page to be transferred is stored is obtained from the real address part PA. This backing store address is used as the backing store address for reading, and the previously allocated page 7
Create a channel program using the frame number as the glance address. In the case of a single page load, the channel program is for transferring one page, and in the case of a bulk load, the channel program is for transferring all pages of the segment? A channel program to be transferred is created (step 111).

This channel program then starts the I/U meeting (step 112) and waits for the completion of the backing store I10 (step 113.l).

Once backing store I10 is complete, we move on for completion processing.

In other words, the following process is performed to reflect that the backing store I/(J has been completed and the page is now available. The state of the memory map table efficiency MME corresponding to the target page frame is page absent. The process is set to a completed state (step 115).After this,
The P bit t″l” of the corresponding page descriptor PD is set to a usable state (step 116J. After this, the state of the process that generated the page not-available sound is set to an executable state, and the process is completed (step 116J). 117).

As a result, if there is a batch load specification in both the segment descriptor SD and the corresponding working set frame, the entire segment will be loaded at once and become ready for one use. , only the page where the page error occurred is loaded and becomes available for copying.

An embodiment of the present invention has been described above.In this embodiment, information indicating whether there is a strong access relationship between each page in a segment is stored in the t-segment, and also in the working set frame. It also outputs information t indicating whether or not to apply the load r, and this information is used when processing page absences, and there is a designation that there is strong relevance.

Batch loading also in the corresponding working set frame [If it is specified that it can be done, load all the segments including the page that caused the page failure at once,
When accessing other pages in the same segment thereafter, the process can be performed without performing the page-absence process 7, thereby making it possible to execute the L program at high speed. 1 overall processing power by reducing system overhead? can be improved.

The number of segments, maximum segment size, page size, etc. in the virtual address space are not limited to the values in this embodiment, and two-stage conversion is also possible.

tyc. In this embodiment, in order to simplify the explanation, a detailed explanation of the structure of each control table is omitted for parts that are not directly related to the present invention. In addition to the fields in the description, it is possible to add various fields such as the maximum number of pages, minimum number of pages, expected value of the working set, etc. that can be connected to the WS in order to properly manage the tool. Furthermore, in the explanation of this embodiment, the details of the process when the required number of pages does not exist in the pool frame in the event of a page absence are not mentioned, but this is also due to the conventional method of creating empty pages. Various methods can be applied.

Also, in this embodiment, this is not mentioned.

The control information regarding the application of batch loading to the working set frame can be set, for example, according to the load status of each of the above-mentioned working set muscles.

(Effects of the Invention) The present invention has the following advantages: By retaining control information on whether or not segments should be loaded at once in the segment information and working set frame information, !7. This method has the effect that it is possible to efficiently perform page fault processing based on the free state of the main memory, and to increase the central processing speed of the program.

[Brief Description of the Drawings] Figure 1 (aJ (bJ is a diagram showing the overall structure of the control table in an embodiment of the present invention), Figure 2 (al is a segment descriptor SD, (b) is a page description Child PD, (C)
is the pool frame control block PLCB, (d) is the Zukingse-Soto frame control block W80B, and (e) is the memory 7.
A diagram showing the configuration of Tsubuen ijMME, FIG. 3 is a diagram showing the configuration of the pool frame (purple), and (a) is the state before page connection. tb) is a diagram showing the state after connection, and FIG. 4 is a chart outlining the operation in this embodiment. VA...Virtual address, 8 people...Segment table, PA...Page address within segment, Pi'LA...Relative address within page, PCB [pl・・・・・・Process 1lilJ M
Block, ASW・・・Address space specification word, 5
TSZ・・・・・・Segment table size, ST・
... Segment table, STP ... Pointer to segment table, 8D ... Segment descriptor, SST ... Segment status information, SAT ...... Segment attribute information, PN...
... Segment size, FTP ... Pointer to page table. P-T...Segment protection information, WSID...
...Working set frame identifier, Ll...
Batch load specification hit, PIJ...Page descriptor, fLPA/Old...Real page address, BK8T...
...Backing store, PL, CB...
Pool frame control block, PLCNT... Empty page 7 frame lfi, PLTJ'TR... First page address pointer of empty page 7 frame list,
PLLPT 几・・・Page address pointer at the end of empty page 7 frame list, WSCT・Old・Working set management table, WSCB・・・Working set management table entry, WSCNT・・・
...Number of page 7 frames belonging to the tooling set, W
STPT 几・・・First page address pointer belonging to the working set, WSLPTR・・・・・・
The last page address belonging to the tooling set/
L2...control bit, MMT/old...memory map tape, MME...memory map table end 1FST...page frame status information, FUS... ...Page 7 frame usage status report, FP...forward pointer, BP...
...Reverse direction pointer, LAI) R8... Information indicating the virtual address allocated to the real page, BS
AD 几S...Backing store address information to which the actual page is allocated. (Reno (d) (C) Half-Z revision (ρ) v3ㅅ

Claims (1)

[Claims] Segmentation/basing method as one-layer self-memory method? In the segment bulk loading method of the computer system to be adopted, should information for specifying the working set frame of the main memory to which pages belonging to the segment are to be connected and managed be loaded as segment information and the segment information in bulk? The first control information shown? hold. As working set frame information, second control information indicating whether or not to collectively load the working set frame is held. When a page absence occurs in the main memory, when the first control information of the segment corresponding to the page and the A-th control information of the working set frame to which the page is to be connected are specified for bulk loading, the page is included. Load the entire segment into the main memory, and when at least one of the first and second control information does not specify a batch load, only the page is loaded into the main memory.
A segment batch loading method featuring t.