JPH087688B2 - Creation method of multi-kernel process space - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Outline] A method for creating a multiple kernel type process space that creates a plurality of kernel type process spaces at once, and initialization of only a control table for the minimum necessary process space that cannot be statically coded The purpose is to dynamically create multiple kernel type process spaces at once by dividing the main memory into page units. In an information processing system that multiplexes core processes of an operating system based on a virtual memory system for dynamically allocating a kernel, a kernel process space assembling means for statically coding an execution environment of each process space, and the assembling means. IVP (Initial Value Pattern Are), which is one unit of the execution environment formed by means
For a), the IVP format, which is different for each kernel type process space, is divided into the common information area and the specific information area from the kernel text, which is the execution environment setting area for the entire multiple process spaces, and each IVP in the specific information area is divided. By dividing the kernel text onto each kernel type process space without changing the address on the kernel type process space by using the IVP copying means for the kernel type process space and other control table pointers. Base point control that moves the base point control table in the common information area of the IVP copied in the virtual space to the IVP area that is always the same virtual address in the process space private area and is different from the private area When the table moving means and the control table in the kernel type process space eigen area have the address of the base point control table, the base point control table add in the control table in the eigen area is added. And a dynamic initialization means of the control table for presetting the start address of the base point control table transferred by the moving means in advance, and for initializing the minimum necessary control table that cannot be statically coded. Configure to have.

[Industrial application field]

The present invention relates to a virtual space creation method for allocating a process in which various cores of a supervisor function in an operating system are multiplexed to a virtual space, and more specifically, a multi-core process for creating a plurality of core process spaces at a time. Regarding the method of creating a space.

The virtual memory system allows a programmer to use a virtual address space having a much larger capacity than the actual main memory without being aware of the actual capacity of the main memory. As the virtual address space, an external storage device, for example, a direct access storage medium such as a magnetic drum device, a disk device, or a disk pack device is used, and the virtual address space is held in these devices and the main storage device. Dynamic Address Translation DAT (Dynamic Address Tra
The role of the (nslation) mechanism is to translate the virtual address used by the programmer into a real address in the real address space. This address conversion is performed in units called pages. The virtual address space used by the programmer is divided into pages and associated with the pages of the main memory.
And all of the program need not be loaded into main memory, only the pages needed for execution. Dynamic address translation is the sequential translation of an address in the virtual address space into an address in main memory when a program is executed. When the page required during the execution of the program is not in the main storage device, the page is transferred from the external storage device to the main storage device. When a kernel, which is a supervisor function of an operating system (OS), is multiplexed in such a virtual space to create a virtual space, it is necessary to create a plurality of kernel-type process spaces in a short time.

[Conventional technology]

Conventionally, in the creation of this type of virtual space, the virtual space under the DAT environment is always dynamically allocated an area in the virtual space by using the DAT mechanism, and the necessary control tables are initialized for each one. I was creating a virtual space while making it virtual. When performing dynamic address translation, the segment table is pulled out at the start address of the segment table in the control register, and the segment number in the virtual address section is used to retrieve the information indicating the segment number from the segment table. The start address of the page table is extracted using the start address of the page table included in. Then, the page number in the virtual address is used to determine the page number, and the page address output from the page table and the in-page displacement of the virtual address portion are used to generate the real address. When dynamically allocating the virtual space in such a DAT environment, a control table has been initialized for each.

[Problems to be Solved by the Invention]

Therefore, the conventional method has a problem that it takes a very long time to create a multiple virtual space. That is, in the conventional method, even if the position of the process space in the virtual space can be statically allocated in advance, it is dynamically allocated and the necessary control tables are initialized one by one. Therefore, there is a problem that it takes time to create a multiple virtual space.

The present invention makes it possible to create a plurality of kernel type process spaces at one time in a short time by dynamically initializing only a control table for a minimum process space that cannot be statically coded. To aim.

[Means for solving the problem]

The present invention is an information processing system that divides a main storage device into pages and dynamically creates information from an external storage device in page units based on a virtual storage system that multiplexes a core process that is a supervisor function of an operating system. Provide the system.

The kernel-type process space assembling means 1 statically codes the execution environment of each process space,
The IVP copying means 2 is an IVP (Initial Value Pattern) which is one unit of the execution environment formed by the assembling means 1.
Area), the IVP format that is different for each karyotype process space is divided into the common information area and the specific information area from the kernel text 18 which is the execution environment setting area for the entire multiple process spaces. The IVP is copied to each kernel type process space formed by dividing it in the virtual space without changing the address, and the moving means 3 of the base point control table has a pointer of another control table and has the above copying means. The base point control table in the common information area of the IVP copied on the virtual space by 2 is moved from the kernel type process space private area to the IVP area which has the same virtual address in all process spaces and is different from the private area. If the control table in the kernel type process space private area has the address of the base point control table, the dynamic initialization means 4 of the control table is the base point control in the control table in the private area. It is preset to address to the first address of the base point control table that is transferred by the moving means 3, and performs initialization of the control table of the minimum part that can not be statically coded.

[Action]

In the present invention, in order to reduce the dynamic initialization processing of the process space as much as possible, the execution environment of the process space is statically coded in advance and copied to the memory at the time of creation. Then, the base point control table is moved to a fixed position in the process space so that the start address of the execution environment becomes constant in any process space. Furthermore, only the minimum necessary control table that cannot be statically coded is dynamically allocated.

〔Example〕

 Embodiments of the present invention will be described with reference to the drawings.

First, the execution environment of the process space is described. A statically coded execution environment of one process space is called an IVP (Initial Value Pattern Area).

FIG. 2 is a relational diagram of the static control table in the contents of IVP. That is, IVP is considered to describe the relationship between the control table and the control table, and the control table includes, for example, the stack management table 5,
There are various types such as the message buffer for transmission / reception 6, the registration-type cell pool management table 7, the space configuration information table 8, and the timer control table 9. These control tables are connected by indirect address pointers. The first control table is an LCT (Local Sevice Conrol Table) 10. By using each address stored in the LCT as a pointer, it becomes possible to draw a tree structure control table. In addition to the control tables connected by the tree structure, LFT (L
There is a control table for program management called ocal Fcop Table) 11. This LCT and LFT are called the base point control table,
LCT is a base point control table that is necessary to derive other control tables. The control table pointed to by the LCT base control table is called the common control table. There are also control tables that are not pointed out from the base point control table, and these control tables are called unique control tables. For example, control tables LSE12, VSVT13, AVSB1 in the lower part of Fig. 2 that have no children to inherit in the tree structure
4, ALSB15, etc. are control tables for managing space and are unique control tables. Further, the registration-type cell pool management table 7, the space configuration information table 8, the timer control table 9 and the like are unique control tables without inheriting children. For other control tables, LCT is the root and tree
It has a structure, and these are control tables pointed from the base point control table LCT.

The control table of FIG. 2 and the relationship between the control tables are summarized as shown in FIG. FIG. 3 is an embodiment diagram showing the format of the IVP which is one unit of the execution environment.

The content of the IVP in FIG. 3 is divided into two, LCT and LFT, which are base point control tables, and a control table pointed from the base point control table,
That is, it can be divided into a common information area and other unique information areas. As shown in FIG. 3, the IVP is divided into a common information area 16 in which a base control table and a common control table pointed from the base control table are summarized, and a unique information area 17 in which other unique control tables are compiled. That is, there are a plurality of core process spaces in the system, each of which has a different function, such as a space management function, a message management function, or a process space management function. For controlling these functions. There are multiple control tables. The control table required depending on the type of karyotype process space differs according to each function. Therefore, it is necessary to prepare a control table for each nuclear process space in IVP. And there are multiple such IVPs. In each IVP, the control table that differs depending on the difference in the function of the process space is separated as data of the unique control table.

FIG. 4 is an example diagram of a kernel text that collects IVP information.

Multiple IVPs are prepared for different process spaces with different functions. Information of a plurality of IVPs prepared to create a plurality of kernel type process spaces at once is resident in a storage device as a kernel text 18. In the kernel text, the DAP (Direct Access Page), which is the system information area on the first page of the process space, the FCOP (Frexible Common Program), which is the storage area for programs and sets the necessary information for each program, and There is a common area 19. Further, a plurality of IVPs are stored below it. For example, IVP0 for general process space, IVP1 for core process space for message management, IVP2 for core process space for space management, IVP3 for process space management core process space,
Etc. are continuously resident in the kernel text. The start address of IVP0 is the IVP start position.

FIG. 5 is an embodiment diagram showing the procedure for creating the kernel type process space of the present invention. This figure shows the concept of creating a kernel type process space, and the procedure is in the order of ,,. The creation is performed in the virtual space 20. First, the karyotype process space is assembled under the DAT environment.
And in the second copy the IVP for the karyotype process space. Third, it is set in the eigenregion of the karyotype process space. Regarding the set base control table, that is, LCT and LFT, move this to the IVP area. Fourth, the control table is dynamically initialized by using these base point control tables. Since the process core is assembled in the DAT environment, the process space page table and segment table are created. In the second setting for copying the IVP for the kernel type process space, copy the IVP for the kernel type process space from the kernel text to the kernel type process space,
A karyotype process space only for each karyotype process space eigenregion is created.

The reason for moving the base point control table is to make the start address of the execution environment constant in any process space. In this way, when the supervisor function starts, it is possible to start the base point control table if it is located at a fixed position in the process space. All other control tables can be pulled out by the pointer based on this base point control table.

FIG. 6 is a diagram showing an embodiment of the copying system of the IVP for the kernel type process space. From Kernel Text to Karyotype Process Space IV
It is shown that P is copied to create a karyotype process space only for the eigenregion of the karyotype process space. That is, a state in which the kernel text 18 is copied to the virtual space 20 is shown. There are multiple core processes depending on the system, and the space differs in the virtual space due to the difference of processes. That is, the kernel process space 1, kernel process space 2, and kernel process space 3 have the same address but different addresses in the virtual space. The DAP on the kernel text 18 is moved to the virtual space DAP as it is, and these are common to multiple process spaces. The FCOP is also common to each process, and the common area 19 is copied to the common area 21 as it is. Also, the initial program load IPL is similarly copied from the kernel text 18 to the virtual space 20 as common to all kernel process spaces. The karyotype process space varies depending on the type of function. Regarding IVP copying, each IVP is copied to each space with the address unchanged. For example, if the space management IVP exists at the address A on the kernel text, the space management IVP is copied in the kernel process space 1 so as to start from the same address A as well. That is, the address is not changed and is directly copied laterally to the proper area 22 of the kernel type process space 1. Similarly for the IVP for message management, if this starts from address B in the kernel text, for example, B
It is copied to the proper area 23 of the kernel type process space 2 starting from the address. The process space management IVP is also copied to the kernel type process space 3 without changing the address.

In this way, the kernel-type process space of the proper area is copied without changing the address of the IVP required in the kernel text, and those commonly used in each process such as DAP, FCOP, and common area are copied from the kernel text as they are. It Therefore, the upper part of the virtual space 20 is common to the system, and the lower IVP is a different space depending on the system. Therefore, the karyotype process space 1 can be accessed in the vertical direction, but cannot be referred to the other karyotype process space in the horizontal direction because it is memory-protected. In the unique area, V = R indicates that the virtual address (V) and the real address (R) are equal. IVP25 indicates that this area is used to store the start address commonly used in the process space. In this way, in the lower part of the virtual space, the IVP required for the functions specific to each kernel type process space is copied from the kernel text. Therefore, if there is an IVP that is not used in the karyotype process space, the corresponding area will be empty. As described above, in the present invention, the IVPs of all the kernel type process spaces are incorporated in the kernel text in order to create the kernel type process space at one time. Then, in order to simplify the process space creation, the IVP start address in all process spaces is set to the same position, and the IVP required in each process space is copied without changing the address. At this time, the data is stored by being classified into a common information area and a specific information area in the specific area of each kernel type process space.

FIG. 7 is an embodiment diagram showing the format of the eigenregion of the kernel type process space.

The IVP # area 26 for the karyotype process space corresponds to the common information area 16 in FIG. 3, and the information area 27 of each karyotype process space other than the IVP # becomes the unique information area 17 in FIG. Correspond. That is, in this unique information area, a control table, a data area, etc. which are used only in each kernel type process space are set.

FIG. 8 is an embodiment diagram showing the copying operation of the base point control table of the present invention. FIG. 8 shows how the base point control table is copied so that the start address of the execution environment is constant in any process space.

A state at the time of IPL in the virtual space is a diagram (a), and a state at the time of initialization processing is a diagram (b). One page of LCT and LFT in IVP # area 28 will be moved to IVP area 29. The IVP area 30 is empty at the time of IPL. And in the state at the time of initialization processing, 1 of LCT and LFT which were in IVP # area 28
Pages will be moved to IVP area 29.

The IVP # area of each karyotype process space is loaded on different virtual addresses at IPL.
This is the state of (a). Generally, it is necessary to relocate the statically bound control table relationships within the IVP # to correct the address relationships. However, in the present invention, setting all IVPs on the same virtual address means that LCT and LF are set in the IVP.
Address modification has been completed by placing only the base control table of T on the same virtual address. That is, in the present invention, all connection relationships in the control table are bounded by pointers, and the fact that the pointers start from the LCT is used to fix the position of the LCT. Also, since the LFT is independent in the tree structure of the control table, the LFT also moves to a fixed address. All other control tables can be found by pointers, if only the virtual addresses of this LCT and LFT are known.

In the present invention, LCT and LFT have the same address in all process spaces.

Therefore, in the present invention, as shown in FIGS. 8A and 8B, one page from the beginning of the IVP # area 28 at IPL is copied to the IVP area 29 at the time of initialization processing. By copying, LCT and LFT exist in the same virtual address among all processes.

However, at this time, if another control table is aware of the addresses of LCT and LFT, one problem occurs. L at IPL
When other control tables use the start addresses of CT and LFT, it is LCT and LFT in the state of (b) where LCT and LFT have moved.
Will be moved to a different address, causing a problem that the reference address is different.

FIG. 9 is a control table relation diagram in the process space for explaining problems and solutions when another control table has an LCT address. In the right figure of FIG. 9A, the ICP # area 28 is set so that the LCT is placed on the same virtual address in all process spaces.
This is the state when moving from IVP area 29 to. In the right figure, the LCT has the XXX control table address of another control table, and the control table 31 in the XXX may have the LCT control table address. In this case, the XXX control table address 32 that was in the LCT when the LCT was moved to the base address of the standard control table is
There is no problem because XXX does not change, but in the control table that was in XXX
Since the LCT control table address 33 is the address before transfer, it is not the correct LCT control table address. The state of (b) shows how to solve this. As shown in the left figure of (b), in the present invention, IV between karyotype processes
If there is a control table that considers LCT and LFT addresses when incorporating P into the kernel text, IVP of the kernel text
An address is generated so that the pointer 34 is aware of the LCT of the area. That is, the XXX control table address in the LCT35 indicates XXX, and when the control table 36 at the XXX address has the LCT control table address 37, it is assumed that the LCT has moved that address and the IVP to be moved. Change it at the time of incorporating kernel text at address 34 beforehand. This way IVP
Even after moving to the area, as shown in the right figure of (b), XXX
The LCT control table address 37 in the address refers to the start address 34 of the LCT after movement.

Next, a coding method for creating such an IVP and IVP # control table will be described with reference to the drawings.

According to the present invention, in coding the mapping macro, the static area of the IVP is converted into the mapping macro. Then, distinguish between IVP area and IVP # area by the parameter,
The static control table of the IVP area and the IVP # area is coded so that the entry used only in the karyotype process space can be specified as a parameter when the karyotype process space is coded. First, the coding method of the base point control table will be described.

FIG. 10 is an embodiment diagram showing a coding method of the base point control table of the present invention. In the figure above, DCL is a declaration statement. When coding IVP, LCT is statically declared as external sharing. The figure below shows the coding method for the karyotype process space eigendomain, and refers to the external control table XXX in LCT #. On the other hand, XXX refers to the LCT, but as explained in FIG. 9, when another control table has the address of the LCT, the LCT control table address in the control table of the XXX is indicated by the pointer in the LCT #. Instead, it is the address of the LCT that will be moved to the IVP area. That is, when incorporating the IVP of the kernel type process space into the kernel text, the IVP area of the kernel text is made aware.
By coding in this way, the LCT address in the IVP area is determined in the XXX01 entry. When coding control tables other than LCT and LFT, it is not necessary to be aware of the IVP area and IVP # area.

Next, an embodiment of coding the mapping macro of the static judgment control table area will be described. FIG. 11 is a diagram showing an embodiment of a mapping macro in the static control area. % MACRO IVP or IVP or IVP
Specify whether or not #, and specify it when putting a value in each entry. % MACRO Below is the part that makes the LCT for IVP #. The first% THEN to END is the part that makes the LCT, and the next% THEN to END is the part that makes the LFT. Next DCL
IVPDUMMY in the declaration statement of is for making an empty area under the LCT and LFT. That is, an empty part in one page (4096 bytes) of the unit to be copied (see 27 in FIG. 8)
make. The lower half of FIG. 11 is a part for creating a control table for the XXX address in FIG. This is a coding for creating the start address of the LCT after moving when the control table has the LCT address. The procedure of FIG. 11 is shown below.

 Specify IVP or IVP #.

LCT01 Specified when entering a value in LFT01 Entry specified when entering a value VSVT01 Specified when entering a value PCT01 Specified when entering a value General process or kernel process or general process LCT control table expansion LFT control table expansion LCT01 entry specification for kernel process or LCT01 entry not specified LCT control table expansion LCT01 entry specification expanded with LCT control table specific initial value expanded LFT01 entry specification or LFT01 entry not specified LFT control table specification Expand LFT01 Entry specification Expand the LFT control table by entering a unique initial value into it Free space for the format shown in Figure 8 General process or kernel process Expand VSVT control table for general process Expand PCT control table VSVT01 entry specification for karyotype process or VSVT01 entry specification not specified VSVT01 entry specification VSVT01 entry specification VSVT control table expansion with a unique initial value entered Figure 12 deployed is entering a unique initial value deployment PCT01 entry specification PCT control table PCT control table not PCT01 entry specifies whether PCT01 entry specification is an example diagram of a mapping macro LCT and PCT. When LCT (TYPE =, LCT01 =); is called, IVP or IVP #
Create it separately. Then, declare in DCL whether to use LCT or LCT #. The 5th line is the external reference declaration of LCT 7-
On line 8, move to LCT external reference declaration and 1VP LCT L
Declaration to change CT name is made. On the other hand, PCT corresponds to XXX, and the embodiment shown in FIG. 13 is a case where it has an LCT address.

 Figure 12 shows the procedure of the flow. IVP or IVP # is specified.

 LCT01 Specified when entering a value in the entry General process or kernel process Declares the LCT for general process as external sharing.

 External reference declaration of LCT for karyotype process.

 Declare the LCT that moves to the LCT in the IVP area by changing the name label.

 Yes. LCT01 entry area declaration NO. LCT01 entry area declaration NO. LCT01 entry declaration with LCT02 entry declaration LCT03 entry declaration LCT031 entry declaration LCT032 entry declaration The procedure shown in Fig. 13 is specified when a value is entered in the PCT01 entry. Declaration of PCT Declaration of area of PCT01 entry that is not PCT01 entry specification or PCT01 entry specification PCT entry specification Declaration of PCT01 entry by putting initial value in PCT01 entry .

〔The invention's effect〕

As described above, according to the present invention, the execution environment of the process space is statically coded in advance, and the content coded in the virtual space is copied at the time of creation so that the start address of the execution relation becomes constant in any process space. The base point control table is moved to a fixed position in the process space.
Further, since the minimum necessary control table that cannot be statically coded is dynamically performed, the present invention can create a plurality of kernel type process spaces at once in a short time. .

[Brief description of drawings]

FIG. 1 is a functional block diagram of the present invention, FIG. 2 is a relational diagram of a static control table showing the contents of IVP, FIG. 3 is an embodiment diagram showing the format of IVP which is one unit of the execution environment, and FIG. Figure shows an example of kernel text that collects IVP information. Figure 5 shows IV for creating the kernel type process space of the present invention.
FIG. 6 is an embodiment diagram relating to the operation of P, FIG. 6 is an embodiment diagram of the copying method of the IVP for nuclear process space, and FIG. 7 is an embodiment diagram showing the format of the proper area of the nuclear process space, FIG. ) And (b) are embodiments showing copying of the base point control table of the present invention, and FIGS. 9 (a) and 9 (b) show problems and solutions when other control tables have LCT addresses. Control table relation diagram in the process space to be described, FIG. 10 is an embodiment diagram showing a coding method of a base point control table of the present invention, and FIGS. 11 to 13 are embodiment diagrams of coding of a mapping macro of the present invention Is. 1 ... Nuclear process space assembling means, 2 ... Nuclear process space IVP copying means, 3 ... Base point control table moving means, 4 ... Control table dynamic initialization means.

Claims (1)

[Claims] 1. An information processing system in which a main memory device is divided into pages and a core process of an operating system is multiply created based on a virtual memory system in which information is dynamically allocated from an external memory device in page units, A kernel type process space assembling means (1) for statically coding the execution environment of each process space, and an IVP (Initial Value Pattern Area) which is one unit of the execution environment formed by the assembling means (1). On the other hand, from the kernel text (18), which is the execution environment setting area for the entire multiple process spaces, the IVP format that differs for each kernel type process space is divided into a common information area and a specific information area,
IVP for kernel process space that copies each IVP of the unique information area into each kernel process space created by dividing it into virtual space without changing the address from the kernel text (18)
And a control point table in the common information area of the IVP copied in the virtual space by the copying means (2) having a pointer to another control table Moving means of the base point control table that always moves to the IVP area that has the same virtual address and is different from its own area in the process space (3)
When the control table in the kernel type process space proper area has the address of the base point control table, the base point control table address in the control table in the proper area is transferred to the moving means (3).
And a dynamic initialization means (4) for the control table that presets the start address of the base point control table transferred by the above and initializes the minimum necessary control table that cannot be statically coded. A method for creating a multi-kernel process space characterized by.