JPS6086638A - Storage management system of program - Google Patents

Abstract

PURPOSE:To perform an optimum memory management for every program by assigning a real storage capacity in every program processing unit and performing page conversion in accordance with a page conversion system designated with the program. CONSTITUTION:An address part of a virtual file 12 which exists on a main memory 16 is retrieved in accordance with operation of the program by a TLB 17. Nevertheless, if a program which is not stored on the memory 16 is required, a storage management control part 14 refers to a task management table TCB 16-2 to operate a CPU13 in accordance with an optimum page conversion system of the program, for example, a program of the FIFO system in a storage management program storage part 15. Thus, the CPU13 converts plural pages stored in the beginning of this program to plural desired pages by a list 16-3, and hereafter, the program of converted pages is used to continue a job. In this manner, the program is controlled most suitably.

Description

[Detailed Description of the Invention] [Technical Field of the Invention] When performing page conversion processing for a program stored in a main storage device, the present invention specifies a page conversion method that is suitable for the program and its operation mode. This invention relates to a program storage management system that allows for the storage of programs.

[Prior art and problems]

Data processing device [C] When performing data processing.

Controlled by the program. This program is usually stored in a virtual file, and the parts necessary to execute the job are stored in main memory. in this case.

The main memo 17K stores programs for a plurality of jobs, and has a plurality of page areas divided for each job. When a program to be executed when executing a job is not in the main memory, a part of the pages stored up to that point is converted into a necessary page. In this case, there are multiple types of page conversion algorithm formats; the LRU method, which retains the most recently used one and converts it to the one used in older Kfli, and the FIFO method, which converts the first one imported first.・・・
There are multiple things... For example, the LRU method is generally suitable for programs with branch destinations, and the FIFO method is suitable for batch processing programs.◇When multiple programs are partially stored in main memory like this As for these page conversion methods, the storage management of each program is performed using a specific conversion method that is considered to be comprehensively effective, considering the operating form of each program. Therefore, there is a drawback that each individual program is not managed in an optimal state.

By the way, in the conventional memory management method, one page pool (collection of real pages) is used for multiple programs (jobs).
There is a method in which the page conversion method is determined for each page pool, but since it is a combination of programs with different operating characteristics, there is a drawback that the performance of the same program varies greatly depending on the characteristics of the programs running in parallel.

[Purpose of the invention]

An object of the present invention is to improve the above drawbacks by allocating real storage capacity for each program processing unit (job) and converting pages according to the page conversion method specified by the program. An object of the present invention is to provide a program storage management method that can perform optimal memory management.

[Structure of the invention]

In order to achieve this purpose, the program storage management method of the present invention stores a program to be executed in a real storage section,
In a data processing device that performs page conversion using a predetermined algorithm when a program necessary for execution does not exist on the real storage unit, the real storage unit has an area divided for each program, and an optimal storage area for each program. It has an optimal page conversion display section that displays the most suitable page conversion method, and a storage management program storage section that stores a plurality of page conversion processing programs. The feature is that the conversion is performed.

[Embodiments of the invention]

Before describing the present invention in detail based on one embodiment.

The outline will be explained below.

In the present invention, the most appropriate paging method is specified for each program. For example, as shown in FIG.

Enter [FIFOJ] in source text 1 of the programmer as the optimal page conversion method for that text. When this source text 1 is stored in an executable format in the virtual memory unit 2 by the controller, the page conversion method part is entered in the task management table (TCB) 6 by the loader 5. A part of the expanded program is stored in the main memory 4 and the job is executed, but a page fault occurs as the program runs, and the part of the program stored in the main memory 4 is stored in the main memory 4. When converting, access the task management table 6 and read that the #L suitable conversion method is FIFO,
Page conversion on the main memory 4 is performed based on the subroutine FIFO of the storage management program 3. This allows page conversion to be performed in an optimal manner depending on the operating characteristics of the program.

Next, one embodiment of the present invention will be described based on FIG.

In FIG. 2, numeral 10 is a source text file in which the optimum page conversion method is displayed in the directory portion, and corresponds to source text 1 in FIG. 11
is a compile control unit that expands the program written in the high-level language in the source text file 10 into an executable form and stores it in the virtual file 12. 131iCP
A device that executes a job based on a program.

14 is a storage management control unit that controls when data is stored in the main memory 16; 15 is a storage management program storage unit that stores various programs necessary for page conversion, such as LRU system programs; FIFO system programs, FILO system programs, etc. are stored. 16 is a main memory, outside the program area 16-1 where programs are stored,
A task management table (TCB) 16-2 that contains the optimal page conversion method for each program, the state in which each program's pages are used, and a main memo! There is a list 16-3 etc. in which the ranks etc. stored in 716 are entered. 17 is TLB
(Tran-slatlon Look aside
Buffer), which searches which address part of the virtual file 12 exists on the main memory 16.

Next, the operation shown in FIG. 2 will be explained.

Prior to executing data processing, the high-level language program stored in the source text file 1 is compiled into an executable format by the compile control unit 11 and stored in the virtual 7i A-12. At this time, an indication of the optimal page conversion method is also stored in the virtual file 12. When executing the program, a part of this program is transferred from the virtual 7 isle 12 to the main memory 16 by the CPU 15.
The program area 16-IKK is stored. Normal CPU1
5 executes a plurality of jobs, a part of a similar program for each job is stored in the program area 16-1. In this case, the storage area of the main memory is divided and allocated for each program. At this time, task management table 1
In 6-2, the optimum page conversion method is entered for each program.

Depending on the operation of the program, a program that is not stored in the main memory 16 despite reference to the TLB 17 becomes necessary, and when so-called page 7 ortho occurs, the memory management 1DIJ control unit 14# or the task management table 16- 2.Recognize the optimal page conversion method for the program by referring to 2.For example, if this is the FIFO method,
The CPU 13 is operated by a FIFO type storage management program from the storage management program storage section 15. Kono L
(In C, the CPU 13 is a squirrel) 16-3 converts the plurality of pages stored at the beginning of the program into the desired plurality of pages. Of course, at this time, the number of converted pages may be one page instead of a plurality of pages. From then on, the job is continued using the program of this converted page.

In the example above, one optimal page conversion method is specified for each program, but as shown in Figure 3, the program is divided into multiple sections, and the program itself for each section specifies the subsequent page conversion method. Declare (&CHGPFLGC)
You can also. Program A' is the first phase
1, for example, page conversion is performed using the FIFO method, so this is first entered into the task management table TCB. When Phase 1 ends and Phase 2 begins, page conversion is performed using the LRU method. At this time, the page conversion method instruction section P of the task management table TCH is corrected to the LRU method based on this declaration. When the job progresses and phase 2 ends and phase 3 begins, page conversion is performed using the FIFO method.

At this time, the FIFO method is again entered in the page conversion method instruction section P of the task management table TCH.

In this way, it is also possible to specify the optimal page conversion method for each phase of a program that has different operating characteristics. According to this, the entire program can be optimized.

In the above case, an example was explained in which the optimal page conversion method for the four-gram internal pressure was displayed, but instead, a table showing the program name and the corresponding optimal page conversion method is prepared in the compile control section. , the compilation control unit can be configured to display this in a virtual file based on the program name.

In this way, the main memory area to be used is divided for each program operating environment (job), and the page conversion method specified by the program is used.

It is possible to control the program optimally.

〔Effect of the invention〕

According to the present invention, it is possible to select a page conversion method with optimal performance in accordance with the program characteristics, so data processing efficiency can be greatly improved compared to the conventional case where the page conversion method is fixed. I can do it.

[Brief explanation of drawings]

FIG. 1 is an explanatory diagram of the present invention, FIG. 2 is a configuration diagram of one embodiment of the invention, and FIG. 3 is an explanatory diagram of another embodiment of the invention. In the figure, 10 is a source text file, 11 is a compilation control unit, 12 is a virtual 7-isle, 15 is a CPU, 14 is a storage management control unit, 15 is a storage management program storage unit, 16
is the main memory, 16-1 is the program area, 1 (S-
2 is the task management table. 16-6 is a list, and 17 is a TLB. Patent applicant Fujitsu Ltd. Representative Patent Attorney Akira Yamatani

Claims (1)

[Scope of Claims] A data processing device N that stores a program to be executed in a real storage unit, and performs page conversion using a predetermined algorithm when a program necessary for execution does not exist in the real storage unit. , a real storage section having areas divided for each program. It has an optimal page conversion display section that displays the optimal page conversion method for each program, and a storage management program storage section that stores multiple page conversion processing programs, so that when page conversion occurs, the page conversion that is optimal for that program is provided. A memory management method for glograms, which is characterized by a method that performs page conversion based on the method.