JPS63168753A - High-speed swapping system - Google Patents

Abstract

PURPOSE:To attain high-speed swapping by providing a means for generating a channel program between a main storage and a secondary storage for swapping while using a page table updating means and a unit map updating means to decreased the seek time and the rotation waiting time of a magnetic disk. CONSTITUTION:When a swap-out request of a job A is inputted, a channel program generating means 7 calculates a minimum unit number and a unit map updating means 60 informs an address on the swapping secondary storage 30 for a head record of each unit to a channel program generating means 70. When the notice is received, the program generating means 70 generates a channel program transferring the content of the main storage 10 corresponding to each page descriptor 21 of the page table 20 to an address on the secondary storage for swapping of a head record of each unit information from the unit amp updating means 60 at each unit. Thus, the seek time and rotation waiting time of a magnetic disk are decreased.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a high-speed swapping method in an information processing system implementing a virtual storage method using paging.

[Conventional technology]

Traditionally, the swapping method in information processing systems that implement a virtual memory method using paging consists of a page table, which is a table of page descriptors that holds the locations where pages exist, and a secondary memory for swapping that records each page. , a slot map that maintains the usage status of secondary storage for swapping in record units, a page table update means that updates the contents of a page table, a slot map update means that updates the contents of the slot map, and a page table update means. The channel program creating means creates a channel program between the main memory and the swapping secondary memory using the slot map updating means, and the channel program executing means runs the channel program.

When a job swap-out request is input in such a swapping method, the channel program creation means requests the slot map update means to secure the number of records equal to the number of pages in the main memory that the job is using. The slot map updating means refers to the slot map, secures empty records, and notifies the channel program creation means of the address of each record in the swapping secondary storage.

Furthermore, when the channel program creation means receives the above notification, the contents of the main memory corresponding to each page descriptor of the page table are transferred to the secondary storage for swapping of each record notified by the slot map updating means for each page. Create a channel program to be transferred to the address and request the channel program execution means to execute it. Then, the channel program execution means executes the above channel program and transfers the contents of each page on the main memory to the swapping secondary memory.

Finally, the channel program creation means notifies the page table changing means of the address on the swapping secondary storage of each record, and the page table changing means informs the page table changing means of the address of the swapping secondary storage of the record that has been notified of the contents of the page descriptor. Change to address.

[Problem that the invention seeks to solve]

However, in the conventional swapping method, the usage status of the swapping secondary storage is maintained and updated on a record-by-record basis, so for example, 3 consecutive swapping secondary storage
When there are 0 free records, if 29 records are used to swap out a certain job, one isolated free record may occur. As swapping is repeated, the addresses of free records on the secondary storage for swapping become discontinuous, and therefore the addresses of free records reserved for swapping also become discontinuous. This method has the disadvantage that swapping performance is degraded due to an increase in time and rotational waiting time. SUMMARY OF THE INVENTION An object of the present invention is to provide a high-speed swapping method that avoids such discontinuity in swapping areas and improves the above-mentioned drawbacks.

[Means for solving problems]

The swapping method of the present invention is implemented in an information processing system that implements a virtual memory method using paging. a unit map that maintains the usage status of the swapping secondary storage on a unit-by-unit basis;
page table updating means for updating the contents of the page table; unit map updating means for updating the contents of the unit map; and using the page table updating means and the unit map updating means, the main memory and the swapping It is comprised of a channel program creation means for creating a channel program to and from secondary storage, and a channel program execution means for executing the channel program.

〔Example〕

Next, the present invention will be explained in detail with reference to the drawings.

FIG. 1 is a block diagram showing an embodiment of the present invention. In the figure, the high-speed swapping method includes a main memory 10 divided into pages, a page table 20 that is a table of page descriptors 21 that holds the locations where pages exist,
A swapping secondary storage 3o that is recorded in units of pages, a unit map 4o that holds the usage status of the swapping secondary storage 30 in units of units, and a page table update means 50 that updates the contents of the page table 20.
A channel program between the main memory 10 and the swapping secondary memory 30 is created using a unit map update means 60 for updating the contents of the unit map 40, a page table update means 50, and a unit map update means 60. channel program creation means 70 for executing the channel program; and channel program execution means 8 for executing the channel program.
It consists of 0.

Next, the operation of the present invention will be explained.

It is assumed that one track of the swapping secondary storage 30 has four records, and the unit map 40 holds the usage status of the swapping secondary storage 30 with two tracks (eight records) as one unit.

At this time, if a swap-out request for job A is input as shown in FIG.
0 is ゛(number of units) x (number of pages per unit)〉(
The unit map updating means 6
0 to secure the above number of units. Then, the unit map updating means 60 refers to the unit map 40, secures a vacant unit, and notifies the channel program creating means 70 of the address on the swapping secondary storage 30 of the first record of each unit.

Upon receiving the notification, the channel program creation means 70 updates the contents of the main memory 10 corresponding to each page descriptor 21 of the page table 20 for each unit of the first record of each unit notified by the unit map updating means 60. Create a channel program to transfer to an address on the swapping secondary storage. At this time, as shown in FIG. 3 (a), the addresses on the swapping secondary storage 30 are consecutive for records in the same unit, so there is no need to seek or wait for rotation. (b) shows an example of the program configuration of the conventional swapping method.

Next, the channel program creation means 70 requests the channel program execution means 80 to execute the channel program, and the channel program execution means 80 executes the channel program to save the contents of each page on the main memory 10 for swapping. Transfer to secondary storage 30.

Finally, the channel program creating means 70 notifies the page table changing means 50 of the address on the swapping secondary storage of the first record of each unit. The page table changing unit 50 transfers the contents of the page descriptor 21 to the address on the swapping secondary storage of the notified first record of the unit if the transferred record is the first record of the unit; Change the address to a contiguous address.

FIG. 4 shows the state after the channel program is executed.

In this way, the seek time and rotational waiting time of the magnetic disk are reduced, making high-speed swapping possible.

〔Effect of the invention〕

As described above, according to the high-speed swapping method of the present invention, the seek time and rotation waiting time of the magnetic disk are reduced, so that a high-speed swapping operation can be realized.

[Brief explanation of the drawing]

FIG. 1 is a configuration diagram showing an embodiment of the present invention, FIG. 2 is an explanatory diagram showing a case where a swapping request for job A is input (before processing), and FIG. 3 is an explanatory diagram showing a case where a swapping request for job A is input. FIG. 4 is an explanatory diagram showing a channel program created and executed when a swapping request for job A is input (after processing). 10... Main memory, 20... Page table, 21.
...Page descriptor, 30... Secondary storage for swapping, 40... Unit map, 50... Page table updating means, 60... Unit map updating means, 70
. . . channel program creation means, 80 . . . channel program execution means. $ / Figure 2 Figure ((Ll
(mu) 稟4 concave

Claims (1)

[Claims] In an information processing system that implements a virtual storage system using paging, there is provided a page table that is a table of page descriptors that holds the locations where pages exist, and a secondary storage for swapping that is recorded in units of pages. a unit map that holds the usage status of the swapping secondary storage with a plurality of consecutive tracks as one unit; a page table update unit that updates the contents of the page table; and a unit that updates the contents of the unit map. map updating means; channel program creating means for creating a channel program between the main memory and the swapping secondary storage using the page table updating means and the unit map updating means; and executing the channel program. and channel program execution means.