JPH025156A - Virtual object memory control system - Google Patents

Abstract

PURPOSE:To attain efficient saving processing by controlling information for finding out an object to be saved. CONSTITUTION:The size of an object read out from a secondary storage medium is found, the 1st object 40 to be traced from the entry of a route table 10 coincident with the size is saved in the secondary storage medium and another object is read out from the secondary medium to a real storage area occupied by the saved object 40. The read object 40 is added to the end of a list to be traced from the entry of the table 10. Since the information for determining the object to be saved is controlled, efficient receding processing can be executed.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to a virtual object memory management system, particularly an object-oriented language processing system in which a series of contiguous storage areas called objects is used as a logical unit of operation. This invention relates to a virtual object memory management method for using a storage area larger than the area.

[Conventional technology] Small, a typical object-oriented language
The k-80 processing system manages objects in the real storage area as a series of continuous storage areas. FIG. 2 is a diagram explaining the method of managing the object area. In FIG. 2, an object table 20 is a table that manages identifiers given to objects, and a real storage area 21
Continuous areas 211, 21 corresponding to the substance of the object
The object 211 in this figure is identified by the identifier 2111 via the address information 202 in the object table 20. S
malltalk-80, Addison Wesley
, published in 1983, p. 541-).

Furthermore, in order to effectively utilize a narrow real storage area, a virtual object memory system that utilizes a secondary storage medium has been considered. FIG. 3 is a diagram illustrating the virtual object memory management method. 2 in Figure 3, address information 203
There is an indirect pointer area 31 in the real storage area pointed to by
Is the indirect pointer area 31 2? When the object entity 301f saved in the storage medium 30 and the object pointed to by the referenced address information 203 are needed, the object entity 301 is executed using the address 1# information 311i held by the indirect pointer 31. Operation to read into storage area r
Let's do it.

Here, when reading an object from the secondary storage medium 30 to the real storage area, if sufficient space cannot be secured for the object to be read, the less necessary objects are temporarily evacuated to the secondary storage medium 30, It is necessary to secure an area for the object to be read (References 2G, Krasna/Sma11talk-80, Addis
on-Wesley.

Published in 1983, p. 251-).

[Problem to be solved by the invention]

However, in the conventional method, there is a problem that efficient evacuation processing cannot be performed because information r for determining objects to be evicted is not managed.

[Means to solve the problem]

In the virtual object memory management method of the present invention, the object-oriented language processing method includes a route table that classifies objects in use consisting of a series of contiguous storage areas according to the size occupied by the area of this object;
Before reading objects of the same size from this route table, by specifying the linkage information held in a single object area and the size of the object, the corresponding size is calculated from the route table and linkage information. It consists of a selection means to decide which objects to have and a multi-purpose method.

[Effect]

Find the size of the object to be read from the secondary storage medium,
The first object that can be traced from the route table entry that matches this size is saved to a secondary storage medium, and the object is transferred from the secondary storage medium to the real storage area occupied by this saved object. Adds the read object to the end of the list traced from the root table entry.

〔Example〕

Next, embodiments of the present invention will be described with reference to all the drawings.

FIG. 1 is a block diagram of an embodiment of the present invention. In FIG. 1, the route table 10 consists of entries that are uniquely determined for each size of the corresponding object, and each entry has a start pointer (100° 110) and an end pointer (
101, 111), an object 120, etc. has link information that connects an object t of the same thickness in addition to an area for storing all internal information of the object.
They are connected like 20°121.122. When reading an object from the secondary storage medium to the real storage area, if sufficient space cannot be secured for the object to be read, temporarily save the less necessary objects to the secondary storage medium. , it is necessary to reserve space for the object to be read.

The description will be made assuming that the size of the object read from the secondary storage medium matches the size of the object referenced by the head pointer 100. Based on the size of the object to be read, the route table 10t is scanned to obtain the head pointer 100. After selecting one of the objects that can be traced from this head pointer 100 and saving this selected object to a secondary storage medium, the object to be read is read into the area occupied by the saved object. It's crowded. FIG. 4 is a diagram explaining the present processing process in detail. At the 41st request, an entry in the route table 10 is selected depending on the size of the object to be read from the secondary storage medium.

Next, in FIG. 4(A), the object 40 referred to by the head pointer is selected as an object to be saved to a secondary recording medium, and a save operation is performed, and the object 41 to which the object 40 referred to the head pointer is saved. The object file is read from the secondary storage medium into the storage area occupied by the object 40. Next, in FIG. 4, the object 42 referred to by the end pointer of the route table entry is changed to refer to all objects 41. At the same time, the end pointer is also changed to refer to the object 40.

As a result, as shown in FIG. 4 (fA), the slope occupied by the object inserted from the secondary storage medium comes to the end.

In addition, if the entry that fits the size of the object to be read from the secondary storage medium is empty, an entry that is large enough to store the object to be read is used as described above. All you need to do is 7 lines of processing.

As described above, when performing the process of saving objects to a secondary storage medium, the following problems often arise.

In other words, the evacuated object quickly becomes necessary,
There may be cases where it is necessary to reload immediately. This is called thrashing.

According to the invention, such thrashing can be accomplished in at most - times. In other words, objects read from the secondary storage medium are connected to the end, so they are not immediately saved and combined into a bundle.

〔Effect of the invention〕

As explained above, according to the present invention, the next clearing message for finding objects to be evacuated is processed, which is efficient). , I wonder if I'll have to pay the evacuation fee.

[Brief explanation of the drawing]

Fig. 1 is a configuration diagram of an embodiment of the present invention, Fig. 2 and Fig. 3
This figure is a diagram explaining a conventional object management system, and FIG. 4 is a diagram illustrating the entire virtual object memory system according to an embodiment of the present invention. 10... Route table, 20... Object table, 30... Secondary storage medium,
31... Indirect pointer, 40, 41.42, 1
20,121゜122, 130. 131. 132
．． 133- 211゜212...Object, 100.110...Start pointer, 101
, 111...End pointer, 201.202.
203...9 object address information, 2111.
・・9N μ Beniji 1 day outside sum → et al←≠φ=, 301・・・・
...Object saved to secondary memory, 311...
...object address in the secondary storage medium. Agent: Patent Attorney Shindai Nai?叉277、272：Suspicious Busiect No.

Claims (1)

[Claims] In an object-oriented language processing system, there is a route table that classifies objects in use, which consist of a series of contiguous storage areas, according to the size occupied by the area of this object, and a route table that classifies objects in use according to the size occupied by the area of this object. A virtual object memory characterized by having linkage information held in an object area of the virtual object memory, and selection means for determining an object having a corresponding size from the route table and linkage information by specifying the size of the object. Management method.