JP3644078B2 - Program sharing device and method - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a program sharing system in the same virtual space in a virtual storage system computer that associates a main memory and a virtual memory by an address translation mechanism.
[0002]
[Prior art]
First, the terminology used in the description of the present invention will be introduced while explaining the program execution environment in the virtual storage system.
[Program execution (execution body generation and program allocation)]
When the operating system is requested to execute a process such as inputting a command from a terminal and executes a new executable program (an object program, hereinafter simply referred to as a program), the operating system includes the virtual space and the virtual space. An environment for operating a program in a space (called a task, a thread, etc., hereinafter referred to as an execution body) is created, and a program to be run in the execution body is placed in the virtual space (the program is Placement means that a program existing in the program library on the secondary storage is made accessible by a virtual address in the virtual space), and an entry point existing in the arranged program (calling the program) When the control is passed to the command position) Operating a gram.
[Placement of program in virtual space]
When executing a process by calling another program from a certain program in a certain execution body, there are roughly two methods for arranging these programs. One is to create a virtual space and place all necessary programs before passing control to the entry point of the program. The other is that when creating a virtual space, only the program with the entry point to which the operating system passes control is placed, and the program to be called is placed when another program is called while the program is running. Is the method.
[Dynamic linker]
In both of the above methods, when calling from one program to another program, a function to search to which program control is transferred (when a program that is not allocated is accessed, which dynamically allocates the program) This is detected and the operating system searches the program library (this function is usually called a dynamic linker).
[0003]
In the case of the former arrangement method, since all the programs are arranged, this function searches for a necessary entry point from among the programs already arranged in the virtual space, and passes control.
[0004]
In the case of the latter arrangement method described above, a necessary entry point is searched from a program already arranged in the virtual space, and control is passed if the entry point exists. A program having a necessary entry point is searched from programs existing in a library on the next storage, the found program is arranged in the virtual space, and control is passed to the entry point.
[Program placement in a multitasking (multithreaded) environment]
In an environment in which a plurality of execution bodies run in one virtual space (so-called multitask environment or multithread environment), there are the following two methods for arranging a program in the virtual space.
[0005]
One is a method in which when a certain program runs on a plurality of execution bodies existing in the same virtual space, the program is arranged in the virtual space by the number of the execution bodies. The other is a method in which only one program is arranged in the virtual space and shared even when a certain program runs on a plurality of execution bodies existing in the same virtual space.
[0006]
Usually, the former method is adopted in the case of a program that updates variables (external variables, etc.) that retain information in the program. This is because when the latter is adopted, the data values performed in the program are destroyed between the execution bodies, and the data values cannot be guaranteed for each execution body.
[0007]
[Problems to be solved by the invention]
A program can be broadly divided into a part in which an instruction code or the like is stored (hereinafter referred to as a text part) and a part in which data such as a variable is stored (hereinafter referred to as a data part).
[0008]
In general, the entry point of a program exists in a text part as in the ELF format adopted in UNIX or the like. In this type of program, control is transferred from the operating system to an entry point existing in the text portion, and an instruction code existing in the text portion is executed. At this time, in the operating instruction code, a variable or the like existing in the data part is referred to or updated.
[0009]
For this reason, in the case of a program in which the entry point exists in the text part as described above, the relative positional relationship (called offset) between the position of the instruction code and the position where the variable is stored executes the program. It must be determined when it is possible (ie when linking). After linking, that is, when an executable is created, when a program is placed, when control is passed to a program, etc., it cannot be changed dynamically (that is, in the program every time triggered by the above scene) (This means that all existing positional information must be changed).
[0010]
To run a program of the above type in an environment where multiple execution bodies run in a single virtual space (so-called multitasking environment or multithreading environment), the necessary programs must be executed It is necessary to arrange in the virtual space. In other words, when a certain program runs on a plurality of execution bodies existing in the same virtual space, the program must be arranged in the virtual space by the number of execution bodies.
[0011]
This is because if only one program is placed in the virtual space and this program is run by multiple execution bodies, the values of data to be referenced and updated in this program are destroyed between the execution bodies, and the data This is because the value of cannot be guaranteed for each execution body.
[0012]
For this reason, when a program of the above format is run in an environment where a plurality of execution bodies run, a virtual space area that can be used for arranging a plurality of the same programs for each of the plurality of execution bodies in the virtual space. You will be pressured.
[0013]
In this way, in order to benefit from the improvement in hardware performance, the above-mentioned virtuality can be improved even when the multiplicity of programs to be run (that is, the number of execution bodies) is increased and processing is performed in parallel. There was a problem that it could not be realized due to compression of the area in the space.
[0014]
In view of these points, the present invention arranges only one program having the entry point in the text in the same virtual space, and is shared by a plurality of execution bodies in the virtual space. Thus, an object of the present invention is to provide means for preventing the virtual area in the virtual space from being compressed.
[0015]
[Means for Solving the Problems]
The above-described problem is solved by a program sharing apparatus configured as follows.
[0016]
FIG. 1 is an explanatory diagram of the principle of the present invention.
A text part 2s of the shared program and a data part 3 of the shared program statically linked to the text part 2s are arranged in the virtual space 4,
An environment for executing the shared program in the virtual space 4, that is, a shared apparatus for programs having one or more execution bodies 1s such as 1a, 1b, 1c... 2a is the execution bodies 1a, 1b, 1c. The DRA 9a, DRB 9b, and DRC 9c represent entities on the primary storage for the execution bodies 1a, 1b, and 1c corresponding to the data part 3 of the shared program. DFA 8a, DFB 8b, and DFC 8c represent secondary storage entities for the execution bodies 1a, 1b, and 1c corresponding to the data portion 3 of the shared program.
[0017]
The PTA 7a, PTB 7b, and PTC 7c are tables that hold the location of the entity such as whether the entity of the data portion 3 of the shared program is in primary storage or secondary storage for each of the execution bodies 1a, 1b, and 1c. The data unit entity management table is associated with each other (not shown).
[0018]
The execution body switching means 5 switches the execution bodies 1a, 1b, and 1c on which the shared program operates. The data part entity switching means 6 synchronizes with the execution body switching means 5 to locate the entity of the data part 3 The tables PTA7a, PTB7b, and PTC7c that hold the data are switched.
[0019]
When the text part 2s of the shared program and the data part 3 of the shared program statically linked to the text part 2s are arranged and executed in the virtual space 4, the text part 2s of the shared program is an execution environment. The execution bodies 1a, 1b, and 1c exist only as a common text part entity 2a.
[0020]
When the text part 2s accesses the data part 3 of the virtual area to refer to or update, the contents 9a, 9b, 9c on the primary storage or the contents 8a, 8b, 8c on the secondary storage are referred to as the substance of the data part 3 In order to update, address conversion is performed by tables 7a, 7b, and 7c that manage the locations of virtual areas and entities.
[0021]
At this time, the data unit entity switching unit 6 is operated in synchronization with the execution unit switching by the execution unit switching unit 5 so that the entity of the data unit 3 corresponds to the execution units 1a, 1b, and 1c. It is like that.
[0022]
In this way, the text part 2s of the shared program uses the only entity 2a, and the data part 3 uses the entities 9a, 9b, 9c or 8a, 8b, 8c provided for the execution bodies 1a, 1b, 1c. Thus, sharing of programs for performing independent processing for each execution body can be realized.
[0023]
DETAILED DESCRIPTION OF THE INVENTION
FIG. 2 shows a configuration diagram of the embodiment of the present invention.
In a computer system having a virtual storage device, a plurality of execution bodies (multitasking or multithreading) are present, and a text part which is an instruction part of a shared program is the only one common to each execution body in the virtual space. Only one data portion that is referred to when the text portion is executed is apparently arranged in the virtual space.
[0024]
When an instruction in the text part is executed, the virtual address of the data part that is statically linked in the virtual space does not change regardless of which execution object is operating in the data part.
[0025]
However, since the processing contents performed by multiple execution bodies are naturally performed in different environments using different data, the text part that is the command part of the program uses only one entity, but the data part Each execution entity must handle different data entities to obtain different outputs for different inputs.
[0026]
For this purpose, in order to manage the shared program in addition to the normal program management, some means as indicated by a dotted line 250 in FIG. 2 are additionally provided.
[0027]
First, the overall configuration will be described.
Reference numeral 210 denotes a program management unit that manages the arrangement and collection from the program library to the virtual space. The program management table 211 holds information related to program arrangement and collection. The program placement unit 212 makes the program library accessible in a virtual address with a virtual address. That is, loading into the virtual space is performed. As described above, loading of a program is performed every time the program is called, or necessary programs are collectively arranged at once.
[0028]
The program collection means 213 is called when the arranged program does not need to exist in the virtual space, and collects the designated program from the virtual space.
[0029]
Regarding the arrangement and collection of the programs described above, it is essential for the execution body management unit 220, the execution body control unit 230, and the virtual storage device before describing means added to realize sharing of the programs in the embodiment of the present invention. The paging control unit 240 will be described.
[0030]
As described above, the execution body is an environment in which a program operates. Usually, a plurality of execution bodies are set at the same time so that a plurality of programs proceed in parallel in a plurality of environments.
[0031]
The execution body generation means 221 and the execution body collection means 222 create a new execution body and collect the execution body that is no longer needed. That is, when new information processing is performed, it is necessary to prepare an environment for operating the program, and an execution body is generated, and then the program is arranged. The reverse is recovery.
[0032]
The number of execution bodies that can be executed simultaneously is determined by the number of processing devices. The execution body switching means 231 switches which execution body is operated. There are several triggers for switching the execution body. For example, there are an elapsed allocation time, waiting for input / output completion, waiting for exclusive control, and the like.
[0033]
The paging control unit 240 is a mechanism of a virtual storage device in which the entity of virtual storage exists in the primary storage device or the secondary storage, and the primary storage device is used alternately in units of pages as necessary. Page-in request processing means 241 When page-in is requested, a search is made for a free page in page frame units of the primary storage device, and when there is no page-in, a page that is not used is paged out and then page-in is performed. The page-in completion processing unit 243 confirms completion of input / output accompanying page-in. Similarly, the page-out request processing means 242 and the page-out completion processing means 244 also process page-out requests.
[0034]
Next, the adding means 250 for sharing programs will be described.
The text part entity management table 253 holds information related to the entity of the text part. Program identification information, virtual space identification information in which a program is arranged, that is, information used to identify a virtual space of a multiple virtual storage device, a program The virtual address and size of the text part in the arranged virtual space, and the execution object identification information of the execution object that is shared are included.
[0035]
The text part entity management information construction unit 251 is activated by the program placement unit 212, and sets and constructs information in the text part entity management table 253 for the text part of the newly placed program.
[0036]
The text part entity management information collection unit 252 is activated by the program collection unit 213 and collects entity management information of the text part of the designated program.
[0037]
The data part entity management table 256 includes the virtual area of the data part and the address of the entity management virtual area (described later) set for each execution object corresponding to the data part, program identification information, size, and corresponding execution object identification information. It holds information about all combinations of programs and executables.
[0038]
The data unit entity management information construction unit 254 and the data unit entity management information collection unit 255 register and delete information in the data unit entity management table 256.
The data part entity switching unit 257 is activated in synchronization with the execution body switching unit 231 and switches the entity of the data part accessed by the text part.
[0039]
When the above-described page-in / page-out processing occurs, the paging interface unit 258 receives control from the paging control unit 240 if it is understood that the contents are the substance of the shared program in the status display in the page table. Therefore, the target virtual address is adjusted so that the paging I / O operation is normally completed regardless of the switching of the execution body that occurs asynchronously.
[0040]
Next, the configuration of each table will be described with reference to each drawing and FIG. 2 showing the overall configuration.
FIG. 3 is an explanatory diagram of the program management table.
[0041]
As shown in FIG. 3, the program management table 211 includes a program ID (identification number) 31, an allocated virtual space ID 32, an address of the allocated virtual area (segment number, page number, page in the format of SPD). This represents the internal displacement (the same applies hereinafter) 33, the area size 34, and the program configuration 36.
[0042]
FIG. 3 shows a state in which two programs PG1 and PG2 are arranged. The virtual area addresses are 11-0-0 and 13-0-0, respectively, indicating the heads of segment numbers 11 and 13. The size of the area represents 8 KB or 7 KB.
[0043]
FIG. 4 is an explanatory diagram of the text part entity management table.
The format is the same as above, and the text portions of PG1 and PG2 are described. Since the text part is used in common for all execution bodies, there is no execution body ID information, but a list of shared execution body IDs is held in the execution body management table shown in FIG.
[0044]
FIG. 5 is an explanatory diagram of the data unit entity management table.
In addition to the above, a corresponding execution body ID 56 and entity management virtual area address 57 are set as items. A plurality of lines are entered. First, when T01, T02, and T03 are set as execution bodies, the program PG1 is arranged by the program arrangement unit 212, and the information of the first three lines is set. ing. That is, execution bodies T01, T02, and T03 correspond to PG1, and the data portion virtual area address 53 of the program is 4-0-0, indicating the same virtual area address.
[0045]
The entity management virtual area address 57 uses a virtual area having the same size as the data section area of each program in a separate segment. In the above example, they are segments 1, 3, and 14. This entity management virtual area prepares the entity of the data part for each execution body, and when each execution body operates, when the instruction in the text part of the program accesses the area indicated by the virtual area address 53 of the data section, this entity actually The entity corresponding to the area indicated by the management virtual area address 57 is accessed.
[0046]
For the program PG2 arranged second, information is recorded corresponding to the execution bodies T01, T02, and T03 in the next three lines. In such a state, an execution body T04 is newly generated and information on the last two lines is created. That is, for the existing programs PG 1 and PG 2, an entity management virtual area is secured for the execution body T 04 and recorded as segments 8 and 9.
[0047]
As described above, information is generated for all combinations of the programs PG1 and PG2 and the execution bodies T01, T02, T03, and T04.
FIG. 6 is an explanatory diagram of the execution body management table.
[0048]
One table is set for each virtual space ID 61, and the information of the number 62 of execution bodies currently set and the list 63 of execution body IDs is held. This is necessary, for example, when it is necessary to construct information in the data unit entity management table 256 for all the execution bodies existing when a program is newly arranged.
[0049]
FIG. 7 is an explanatory diagram of the structure of the segment table and the page table.
The segment table shown in (a) shows the starting point address from the preceding table 71. Corresponding to the segment number 72, the address 73 of the page table shown in (c), (d) is shown. The relationship between the segment table and the page table is indicated by arrows 79a and 79b for the execution bodies T01 and T02 whose program ID 51 is PG1 shown in the data unit entity management table 256 of FIG.
[0050]
The data part virtual area address 53 of PG1 is 4-0-0, and the segment number of the area is 4. The entity management virtual area address 57 has a program ID of PG1, an execution body ID of 1-0-0 with respect to T01, and a segment number of 1. Further, the entity management virtual area address 57 corresponding to T02 is 3-0-0 and the segment number is 3.
[0051]
The page table address 73z shown in the segment number 4 of the segment table in FIG. 7A originally points to the page table 74 by 79z, but the original page table 74 is made to share the program. Instead, the data unit entity switching means 257 operates in synchronization with the execution body switching means 231, and 73z corresponds to the segment number 1 as shown in FIG. 7 (c) or corresponds to the segment number 3 as shown in FIG. 7 (d). An address indicating the virtual area page table for entity management is written. Thus, the pointer from 73z becomes 78a or 78b.
[0052]
As described above, the page table indicating the substance of the data part is switched by rewriting the pointer of the page table corresponding to the segment number of the data part of the segment table.
[0053]
FIG. 8 is an explanatory diagram of a page table entry.
(A) and (b) show the relationship between the segment table and the page table. The page consists of two entries and is arranged at a fixed interval, here a distance of 100 addresses in hexadecimal. Entry 1 stores hardware related information, and entry 2 stores software related information. Information on the existence location of the entity is determined based on both entry 1 and entry 2 information.
[0054]
Specifically, as shown in FIG. 4C, entry 1 includes information 86a on whether or not there is a real page on the primary storage corresponding to the virtual page, and if it exists, page address 87a of the real page and others. As the information, the attribute H88a holds the status of access right, reference, and update.
[0055]
In entry 2 of (d), information 86b indicating whether or not the entity exists in the secondary storage and, if present, the block address 87b on the medium and the status display during page-in and page-out as other attribute H88b And an indication that it is a data area of a shared program.
[0056]
How to operate using the above table will be described with reference to a flowchart.
FIG. 9 is a construction flowchart of the text part entity management information.
[0057]
The text part entity management information construction unit 251 is activated from the program placement unit 212 as described above, and records information related to the entity of the text part in the text part entity management table 253. The operation will be described.
[0058]
In step S91, a blank line for entering information is searched. In step S92, the entity management information in the text portion of the program to be arranged as the information given to the blank line is set as shown in FIG.
[0059]
In step S93, a page table area corresponding to the size of the virtual area of the text part entered in 44 of FIG. 4 is acquired to construct the page table. Entity information is set in the page table. When the text part of the program is arranged, it initially exists in the secondary storage, so that entry 1 is blanked because there is no real page, and entry 2 has a storage block address of the text part received from program placement means 212. Record.
[0060]
In step S95, the address of the constructed page table is set in the segment table.
FIG. 10 shows a recovery flowchart of the text part entity management information.
[0061]
In step S1, the text part entity management table 253 is searched for the program ID to find the corresponding entry line.
In step S2, the page table address in the segment table is obtained from the segment number of the virtual area address 43 in FIG. 4, and in step S3, the segment table indicator is invalidated to indicate that there is no page table. To return. In step S5, one line of the text part entity management table 253 is returned to empty.
[0062]
FIG. 11 shows a construction flow chart (No. 1) of data unit entity management information.
The operation when the data unit entity management information construction unit 254 is activated from the program placement unit 212 will be described.
[0063]
In step S101, the pointer of the execution body management table of FIG. 6 is set to the head. In step S102, the pointer of the data unit entity management table 256 of FIG. 5 is set to the head of the blank line.
[0064]
In step S103, information such as a program ID and a virtual space ID is set in the data unit entity management table 256. In step S104, an entity management virtual area for the execution body ID in the execution body management table indicated by the pointer is acquired as a virtual area having the same size as the data part virtual area 54, and in step S105, the entity management virtual area address 57 is set. Set.
[0065]
In step S106, an area of the page table corresponding to the size 54 of the area of the data portion is acquired, and in step S107, an entry is set as an initial value so as to exist in the secondary storage.
[0066]
In step S108, a page table address is set in the segment table corresponding to the segment number of the entity management virtual area.
In step S109, the execution body ID indicated by the pointer of the execution body management table in FIG.
[0067]
In step S110, it is confirmed whether the processing has been completed for all the execution bodies. If not finished yet, the pointer of the execution body management table is advanced in step S111, the pointer of the data unit entity management table is advanced to the next blank line, and the process is repeated from step S103.
[0068]
FIG. 12 shows a flowchart of the operation of the data unit entity management information construction unit when it is activated from the executable object generation unit 221.
In step S201, the pointer is set to the head of the program management table 211 of FIG. 3, and the pointer of the data unit entity management table 256 is set to the head of the blank line.
[0069]
In step S202, the virtual space ID, the virtual area address, and the size of the virtual area are copied to the data entity management table 256 for the program indicated by the pointer in the program management table 211 of FIG.
[0070]
In step S203, the execution object ID generated from the execution object generation means 221 is set to the execution object ID 56.
In step S204, an entity management virtual area is secured corresponding to the execution body ID, and in step S205, the entity management virtual address 57 is set.
[0071]
In step S206, a page table corresponding to the size of the area of the data part is constructed, and in step S207, the initial value of the entry is entered. The initial value of the entity is set to be in secondary storage.
[0072]
In step S208, the address of the page table constructed corresponding to the segment number of the reserved physical management virtual area is set in the segment table.
[0073]
In step S209, it is confirmed whether or not the processing has been completed for all programs existing in the program management table. If not, the pointer is advanced and information about the next program is constructed from step S202.
[0074]
FIG. 13 is a collection flowchart (part 1) of data unit entity management information. The data unit entity management information collection unit 255 is activated from the program collection unit 213 and the execution body collection unit 222. (Part 1) describes the operation when activated from the program collection unit 213.
[0075]
In step S31, the ID of the program to be collected is obtained from the caller. In step S32, a pointer is set at the head of the data entity management table 256.
In step S33, it is checked whether the program ID 51 in the line indicated by the pointer in the data unit entity management table 256 in FIG. 5 is the same as the program ID. If it is the program ID to be collected, the page table area indicated by the segment number of the entity management virtual area address 57 shown in FIG. 5 is returned in step S34, and the entity management virtual area is returned in step S35.
[0076]
In step S36 and step S37, the program ID of the data unit entity management table is checked for all rows.
The data part entity management information collection flowchart (part 2) in FIG. 14 shows the operation when the data part entity management information collection unit 255 is activated by the execution body collection unit 222.
[0077]
In step S41, the ID of the execution object to be collected designated from the caller is obtained. In step S42, a pointer is set at the head of the data entity management table 256.
In step S43, it is checked whether the execution object ID indicated by the pointer matches the ID. If the execution object ID is to be collected, the entity management virtual area is returned in step S44, and the page table area is returned in step S45. In step S46 and step S47, repetition is designated so as to perform processing for all rows in the data unit entity management table.
[0078]
FIG. 15 shows a flowchart of the data part entity switching means.
The data part entity switching unit 257 is activated in synchronization with the execution body switching unit 231 when switching the execution body. In step S51, the ID of the execution body to be newly switched is obtained as information from the caller. In step S52, the pointer is positioned at the head of the data unit entity management table 256.
[0079]
In step S53, it is checked whether or not the execution body ID 56 in the line indicated by the pointer matches the ID to be newly switched. When the execution object IDs match, in step S54, the area indicated by the entity management virtual area address 57 in the row corresponds to the substance of the data part used by the program indicated by the program ID 51 in the new execution object. Therefore, in order to allow the program to access this, the address of the page table in the segment table is obtained from the segment number of the address indicated by the entity management virtual area address 57, and the segment indicated by the virtual area address 53 of the data section is obtained. Rewrite the page table address corresponding to the number.
[0080]
In steps S55 and S56, the above processing is executed for all rows existing in the data unit entity management table 256.
FIG. 16 shows a flowchart of the paging interface means.
[0081]
The paging interface unit 258 is activated by the page control unit 240 that detects the occurrence of paging on the substance of the data portion of the shared program.
[0082]
In step S61, a data part virtual area address and an execution body ID are obtained as interface conditions. In step S62, the pointer is set to the first line of the data unit entity management table 256.
[0083]
In step S63 and step S64, it is checked whether or not the interface condition is met. That is, when both the data part virtual area address 53 and the execution object ID 56 match, the entity management virtual area address 57 indicated by the pointer is returned to the paging control unit 240 of the caller as a paging target address.
[0084]
【The invention's effect】
As is apparent from the above description, according to the present invention, it is possible to share information of common processing contents executed in parallel in a computer using virtual memory with a common program arranged in a virtual space. In particular, online processing, communication processing, etc. that allow a large number of large-scale processing to be executed simultaneously can be processed in a larger amount, and there is a remarkable industrial effect of improving economy and processing capacity. is there.
[Brief description of the drawings]
FIG. 1 illustrates the principle of the present invention
FIG. 2 is a configuration diagram of an embodiment of the present invention.
FIG. 3 is an explanatory diagram of a program management table.
FIG. 4 is an explanatory diagram of a text part entity management table.
FIG. 5 is an explanatory diagram of a data unit entity management table.
FIG. 6 is an explanatory diagram of an execution body management table.
FIG. 7 is an explanatory diagram of the configuration of a segment table and a page table
FIG. 8 is an explanatory diagram of a page table entry.
FIG. 9 is a construction flowchart of text part entity management information.
FIG. 10 is a collection flowchart of text part entity management information.
FIG. 11 is a flowchart of construction of data unit entity management information (part 1).
FIG. 12 is a construction flowchart of data part entity management information (part 2).
FIG. 13 is a flowchart of data part entity management information collection (part 1).
FIG. 14 is a flowchart of data part entity management information collection (part 2).
FIG. 15 is a flowchart of data part entity switching means.
FIG. 16 is a flowchart of paging interface means.
[Explanation of symbols]
1s, 1a, 1b, 1c execution body
2s, 2a Shared program text part
3 Shared program data section
4 Virtual space
5 Executable body switching means
6 Data part entity switching means
7a, 7b, 7c Tables that store the locations of entities
8a, 8b, 8c Data section on secondary storage
9a, 9b, 9c Data section on primary storage

Claims (3)

And text portion of the shared program, and a data portion of the text portion and statically linked the shared program placed in a virtual memory space, running body is an environment for executing the shared program by the virtual memory space A shared apparatus for programs having one or more of the following:
A data part entity management table that holds information about entities that are the contents of virtual storage on primary storage or secondary storage for each execution body corresponding to the data part of the shared program;
When a new shared program is arranged in the virtual storage space, data unit entity management information is constructed for each execution body existing in the virtual storage space in the data unit entity management table, and in the virtual storage space A data part entity management information constructing means for constructing the data part entity management information of the execution object corresponding to the data part of the shared program arranged in the virtual storage space,
A data unit entities switching means for switching entity based on the data portion entity management information of the executable units indicated by the data portion entity management table in synchronism with the switch between the different executing entity which the shared program operates,
An apparatus for sharing a program, comprising: When the paging control unit that controls paging detects a page-in request or a page-out request for the entity of the data part of the shared program,
  2. The program sharing apparatus according to claim 1, further comprising paging interface means for notifying the paging control unit of data part entity management information of the data part of the shared program. An executable that is an environment in which a text part of a shared program and a data part of the shared program statically linked to the text part are arranged in a virtual storage space and the shared program is executed in the virtual storage space A program sharing method in a computer system having one or more of:
A data unit entity management table is provided for holding information on entities that are the contents of virtual storage on primary storage or secondary storage for each execution body corresponding to the data portion of the shared program,
When arranging a new shared program in the virtual storage space, building data unit entity management information for each execution body existing in the virtual storage space in the data unit entity management table;
When creating a new execution body in the virtual space, constructing data portion entity management information of the execution body corresponding to the data portion of the shared program arranged in the virtual storage space;
A step of switching entities based on the data unit entity management information of the execution unit indicated by the data unit entity management table in synchronization with switching of the executing unit on which the shared program operates ;
Method of sharing programs that have a.

Images