JPS61138338A - Process start processing system - Google Patents

Abstract

PURPOSE:To execute process formation at a high speed and to improve the efficiency of a memory by detecting a logical address space to which a module is loaded on the basis of a module control table and using the detected information. CONSTITUTION:Start processing is executed on the basis of a process start processing program 10 and a process table 7-p is tried to be acquired at first. When the table 7-p can acquired, a required program is searched in a module control table 8, and when there is no required program, the program is loaded to any segment. When the program exists, a process control table 9-i is searched and whether a data area having required size can be secured or not. When the area can be secured, the table 7-p is set up and the status is informed to an active queue. When the data area can not be secured, the program is copied on another segment. When the program can be copied, the data area is secured, a process table is set up and the process is set up in the active queue. When the data area can not be secured, an error is outputted.

Description

DETAILED DESCRIPTION OF THE INVENTION (A) Industrial field of application The present invention is directed to process startup processing systems, particularly data processing systems where the physical address space is larger than the logical address space. The present invention relates to a process startup processing method that speeds up process creation by making it possible to utilize logical spaces as long as they exist in any logical space.

(B) Prior Art and Problems to be Solved by the Invention The following two methods are known as conventional process startup processing methods. Namely, ①Bank method A method in which the physical address space is divided into a plurality of logical address spaces, each logical address space is an independent address space, and the information in each address space is not used. In this method, only one process is created in the air address space. Since they do not use any information about each other, the program must be loaded from a file whenever a process is spawned. This method has the following drawbacks. (i) The maximum number of processes that can be created is limited to the number of logical address spaces. (ii) Memory efficiency is poor because the same program cannot be shared. (iii) Even if the program is located somewhere in the logical address space, the program must be loaded from a file, which takes a long time to load.

■Mapping method A method that dynamically creates a logical address space from a physical address space. When creating a process, if the program already exists somewhere in the address space, the part where the program exists is mapped so that it is shared. If the program is not in any address space, load the program from the file. Although this method has better memory efficiency than the bank method, it has the disadvantage that program debugging becomes complicated because the logical address space changes dynamically.

(C) Means for solving the problems The present invention solves the above problems, and includes at least the following:
By using the module management table, we can know in which logical address space a module is loaded, and by using that information, we can speed up process creation and improve memory efficiency, but we cannot dynamically perform memory mapping. We provide a process generation method that makes debugging relatively easy without making any changes.

Then, the process startup processing method of the present invention checks whether the program of the process to be created exists in any address space, and if so, creates a process in that address space and shares the program code. We aim to make this possible.
■Even if a program exists, if a process cannot be created in the space where the program exists due to memory capacity, etc., the program is copied to another address space where a process can be created, and a process is created in that space.

■If the program does not exist in any address space, it is characterized by loading it from a file and creating a process. This will be explained below with reference to the drawings.

(D) Embodiment FIG. 1 shows the configuration of an embodiment of the present invention, and FIG. 2 shows the processing mode of an embodiment of a process startup program used in the present invention.

In FIG. 1, 1 is a central processing unit, 2 is a main memory,
3 is an external memory, 4-0 to 4-15 are segments each of which divides the main memory bag W2 into 16 pieces each having a size corresponding to the logical address space, and 5 is a memory segment register. Its contents indicate which segment the process is currently being executed; 6 is an active pointer that indicates the entrance of the queue for the process currently being generated; 7-0 ,? −11, , , are the process and
A table 8 stores information regarding processes that are currently generated, and 8 is a module management table referred to in the present invention that stores information regarding program modules loaded on each segment. 9-B to 9-15 are process management tables, which are provided corresponding to each segment and hold information regarding the process generated corresponding to the segment; 10 is a process management table; Represents the startup processing program. In addition, illustration 7.8.
9 and 10 are respectively stored on the main memory W2, but for convenience of explanation, they are shown as existing on the central processing unit 1.

If we consider a data processing device with a 16-bit address, the logical address space will have a size of 64 bytes, and in the case of a 1M byte main memory W2, it will have a logical address space of 64 bytes.
It is divided into 6 segments. Each segment is
They are independent in processing, and only one segment is active at a time, and by writing the segment number to memory segment register (MSR) 5, it is possible to determine which segment is currently being processed. It will tell you what you are doing.

In the case shown in Figure 1, a size r
The program name of 500J is rsORT.
The module is loaded and is being used by one of the processes (use count "1").
”) is revealed from the module management table 8. Also, address r4000 on segment 4-2.”
A program module with the program name "MERGE" of size r300J is loaded at the start address of be revealed.

For example, from the contents of the process management table 9-0 corresponding to segment 4-1, (i) Process #1 uses a program with size r500J with address r8000J as the first address, and address rl 000J as the first address as the data area. An area of size r200J is used as an address, and (ii) 7" l:l access #2 is used as an address. Size: r3 as the first address.
00J prog UJ, use 6, ka, 4≠-2 area, 7
Size r40 with Ars r2000J as the first address
It has been revealed that the area of 0J is used. Of course, the processes #1 and #2 are queued in the queue indicated by the active pointer 6.

In the present invention, with the configuration as shown in FIG. 1, a desired startup process is executed based on a process startup process program 10. 2 shows an example of processing a of the process startup processing program 10. Hereinafter, the following processing will be performed. That is, in (11 process (A)), an attempt is made to acquire the process table.

(2) If the program can be acquired, in process (B), the module management table 8 is searched to determine whether the program to be used exists on any segment.

(3) If it does not exist, load the desired program onto any segment by processing (C).

(4) If it exists, the process management table 9-i is searched by process (D) to check whether a data area of the desired size can be secured.

(5) For the reserved customers, the process table 7-p is set by process (E) and connected to the active queue by process (F).

(6) If the segment cannot be secured and is available, the program is copied onto another segment by processing (G). .

(7) If the copy is successful, perform processing (H) to secure the data area.

If +811i1 can be maintained, process (E), process (F
).

(9) If it cannot be secured, an error will occur in process (1).

(E) As described in detail, according to the present invention, if a desired program exists on any segment, a process can be generated using it.

[Brief explanation of the drawing]

FIG. 1 shows the configuration of an embodiment of the present invention, and FIG. 2 shows the processing mode of an embodiment of a process startup program used in the present invention. In the figure, 1 is a central processing unit, 2 is a main memory, 3 is an external memory, 4-0 to 4-15 are segments, 6 is an active pointer, 7 is a process table, 8 is a module management table, 9 is a process management table, 1
0 represents a process activation processing program.

Claims (1)

[Claims] A physical address space larger than a logical address space is provided, the physical address space is divided into a plurality of segments each having a size corresponding to the logical address space, and a load is loaded onto each of the segments. In a data processing system in which one or more processes use a program that is loaded to execute processing, a module that manages the program modules loaded on each of the segments using information including the module name of the module. a management table, a process management table that manages information about processes that are generated to use the program modules loaded on each of the above segments, and an active queue that queues process tables related to processes that are currently being generated. (i) means for checking the contents of the module management table to determine whether a program used by the process to be generated exists in any of the segments; (ii) any of the above; means for checking whether a data area can be secured on the segment by checking the contents of the process management table in order to generate the process in relation to the segment when the process exists on the segment; (iii) If the segment can be secured, a means to generate a process on the segment and connect the generated process to the active queue; (iv) If the segment cannot be secured, the program can be moved to another free segment. (v) if the above program does not exist, loading a desired program from external memory onto a segment and transferring it to the segment; A process startup processing method characterized in that a means for creating a process in association with the above is provided, and the process is started.