JPS63184836A - Frame managing system - Google Patents

Abstract

PURPOSE:To improve the utilization efficiency of a main storage device by managing a frame by a queue arranged in order of a new access. CONSTITUTION:A main storage device 8 contains a frame storage part 13 for storing a frame F and a frame managing information storage part 1. The frame managing information storage part 1 consists of a queue storage area 1a for storing a queue which has arranged discriminating information of the frame existing on the main storage device 8, a load number storage area 1b for storing a load number being the total number of the frames existing on the main storage device 8, a maximum load number storage area 1c for storing the maximum load number, and a minimum load number storage area 1d for storing the minimum load number. A queue adding means 3 updates a queue storage area 1a and a load number storage area 1b at the time the frame on a file 11 is read onto the main storage device 8 by a loading means 9.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a frame-type knowledge representation system in an artificial intelligence system, and in particular is capable of processing a large number of frames using a main memory with a limited capacity. Regarding frame management methods.

[Conventional technology]

A frame-based knowledge representation system that employs a data structure called a frame is known as one of the knowledge representation systems in artificial intelligence systems.

Conventionally, when implementing such a frame-based knowledge representation system on a computer system, the necessary frames are stored in advance in a file on an external storage device, and all frames are retrieved from that file at once at the start of processing. It was read into a storage device and used for processing. Furthermore, the process of writing a frame read into a reciprocal storage device to a file and the process of erasing the written frame from the main storage device are performed together at the end of system processing.

[Problem that the invention seeks to solve]

As mentioned above, the conventional method uses a method in which all frames are always stored in the main memory, which reduces the utilization efficiency of the main memory and requires a large-capacity main memory. The drawback is that it is difficult to process a large number of frames.

SUMMARY OF THE INVENTION Therefore, an object of the present invention is to provide a frame management method that can process a large number of frames using a main storage device with a limited capacity.

[Means for solving problems]

In order to achieve the above object, the present invention has a queue storage area that stores a queue in which frames existing on the main storage are arranged in the order of the most recently accessed frames, and a load number that is the total number of frames existing on the main storage. a frame management information storage unit including a load number storage area to be stored, a maximum load number storage area where a maximum load number which is an upper limit of the load number is set, and a minimum load number storage area where a minimum load number is set; a queue addition means for updating the queue storage area and the load number storage area each time a frame is read into the main storage from a file storing the frame; and the load number storage is updated each time a frame is read from the file into the main storage. unload determination means for determining the necessity of unloading from the contents of the area and the maximum load number storage area; Activate an unloading means to refer to the queue storage area and write frames that have not been accessed recently from the main storage to the file so that as many frames as the number of loads set in the area remain in the main storage. and a queue update means that updates the queue storage area each time a frame on the main memory is accessed.

[Effect]

The queue storage area is updated by the queue adding means each time a frame is read from a file into the main memory by the loading means, and by the queue updating means each time a frame existing on the main memory is accessed. , the queue storage area always maintains a queue state in which frames existing on the main memory are arranged in the order of their most recent access. When frames are sequentially read from a file to the main memory by the loading means, and the number of frames currently existing in the main memory exceeds the maximum load number preset in the maximum load number storage area, for example, the frames are unloaded. It is determined by the load determination means and the unload selection means is activated.
The unloading means responsive to the instruction from the unloading selection means writes frames that have not been accessed recently among the frames existing on the main storage device to a file;
Free space is reserved for loading a new frame from the file into main storage.

〔Example〕

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

FIG. 1 is a block diagram showing an example of a system implementing the present invention, in which 8 is a main storage device, and a frame storage section 13.8 stores a frame F. It includes a frame management information storage section 1. The frame management information storage unit 1 includes a queue storage area 1a that stores a queue in which identification information of frames existing on the main storage device 8 is arranged in descending order of access, and a load storage area 1a that stores a queue that is the total number of frames existing on the main storage device 8. Memorize numbers. a load number storage area lb; a maximum load number storage area 1c that stores the maximum load number, which is the upper limit of the load number;
and minimum load number storage area 1 that stores the minimum load number.
It is composed of d. Further, 11 is a file for storing frames, 9 is a loading means for loading the frames stored in the file 11 into the main storage device 8, IO is an unloading means for writing the frames on the main storage device 8 to the file 11, and 7 Reference numeral 2 refers to a frame reference/update unit for referencing and updating frames on the main storage device 8 in response to a request from a request source (not shown); 2 is an initial unit for setting initial values to each area in the frame management information storage unit 1 Value setting means, 3 is file 1
Queue adding means updates the queue storage area 1a and load number storage area 1b when the frame above 1 is read into the main storage device 8 by the loading means 9; 4 unloads at the same time as the queue adding means 3; means l
unload determination means for determining whether or not it is necessary to start O;
5 is an unload selection means activated by the unload determination means 4 to select a frame to be written to the file 11 and activates the unload means 10; 6 is a frame reference update means 7
12 is an input means for updating the queue storage area 1a when a frame on the main storage device 8 is accessed by the queue updating means.

FIG. 2 is a flowchart of a processing example of the initial value setting means 2, FIG. 3 is a flowchart of a processing example of the queue addition means 3, FIG. 4 is a flowchart of a processing example of the unloading determination means 4, and FIG. A flowchart of an example of processing by the selection means 5 and FIG. 6 are a flowchart of an example of processing by the queue updater 6.
12. 521-S24.531-336. S41 indicates each step. Hereinafter, the operation of this embodiment will be explained with reference to each figure.

In FIG. 1, when the initial value setting means 2 is activated by the input means 12 at the timing of loading the frame stored in the file 11 into the frame storage section 13 of the main storage device 8 and starting processing, the initial value The setting means 2 starts the process shown in FIG. First, the initial value setting means 2 sets a queue in which no frame exists on the main memory 8 to the queue storage area 1a (51), and then sets the queue in the main memory 8.
"0", which is the total number of initial states of the upper frame, is set in the load number storage area 1b (S2). Also, take in the maximum load number input from the input means 12 (S3), set this value in the maximum load number storage area 1c (S4), and take the next minimum load number input from the input means 12 (35).
, set that value to the minimum load number storage area 1d (36
), the initialization of the frame management information storage unit 1 is completed with the above processing.

Thereafter, the processing of the system progresses, and for example, when the frame reference update means 7 shown in FIG. The frame reference updating means 7 issues an instruction to the loading means 9 to read the frame from the file 11 into the main storage device 8, and in response, the loading means 9 performs a process of reading the frame into the main storage device 8. When this is done, the queue addition means 3 is triggered by this reading.
is started. Note that the frame reference updating means 7 refers to a management table 130 that manages whether or not each frame exists on the main storage device 8, for example, and determines whether a requested frame exists or not. , loading means 9
loads a frame and updates its management table.

When the queue adding means 3 is activated, it starts the process shown in FIG. 3, and first adds the identification information of the frame read above to the head of the queue stored in the queue storage area 1a (311), and then The load number stored in the load number storage area 1b is incremented by 1 (312). Such processing by the queue adding means 3 is performed every time a frame is read from the file 11, and as a result, the load number storage area 1b is increased by 1 (312). The value of 1b is gradually increased according to the number of frames existing in the main storage device 8.

Furthermore, in addition to the queue addition means 3 being activated when the loading means 9 reads a frame into the main storage device 8, the unloading determining means 4 is activated at the same time.

When the unload determination means 4 is activated, it starts the process shown in FIG.
Refer to the maximum load number set in S21.C.
522), then it is determined whether the number of references referred to is greater than or equal to the maximum number of loads (S23). If the current number of loads is not greater than the maximum number of loads, there is no need to unload, so the process is finished; on the other hand, if the number of current loads is greater than or equal to the maximum number of loads, the unload selection means 5 is activated (S2
4). Although the unload determining means 4 is activated after the queue adding means 3 is activated in the above description, the queue adding means 3 may be activated after the unload determining means 4 is activated.

When the unload selection means 5 is activated, it performs the processing shown in FIG. That is, first, the current queue status stored in the queue storage area 1a is referred to, and the minimum load number set in the minimum load number storage area 1d is referred to in 331. 332), and then sequentially activates the unloading means 10 for each frame whose identification information in the queue is arranged after the minimum load number by specifying that these frames are to be written to the file 11 (S33). .534).

As a result, all frames whose identification information in the queue is arranged after the minimum load number are written from the main storage device 8 to the file 11 by the unloading means 10. Furthermore, the management table 1 is
30 is updated. Next, the unload selection means 5 deletes the identification information of each frame written to the file 11 by the unload means 10 from the queue stored in the queue storage area 1a (S35), and then the load number storage area The contents of 1b are updated to the minimum load number set in the minimum load number storage area 1d (336).

On the other hand, when a frame in the main memory 8 is accessed by the frame reference updating means 7, the queue updating means 6 is activated, and the queue updating means 6 updates the identification information of the currently accessed frame as shown in FIG. Chie J
T? The queues stored in the iI area 1a are rearranged to the top (541).

Therefore, as described above, at the time when the unload selection means 5 is activated, frames whose identification information in the queue in the queue storage area 1a is arranged after the minimum load number are selected from frames that have not been accessed recently, starting from the oldest frame. It becomes what it is.

For example, rloOJ is set in the maximum load number storage area IC by the initial value setting means 2, "70" is set in the minimum load number storage area 1d, and r100J frames currently exist in the main storage device 8, Cue storage area 1a
are F +, F t, ..., Ft. .

Fl, ..., Ft. , and if the unload determination means 4 is activated at this time, it is determined in step S23 that the number of loads is greater than or equal to the maximum load number, and in step S24, the unload selection means 4 is activated. 5 will be activated. Then, in step S33, the unload selection means 5 determines whether the identification information F in the queue is the "70th" or later identification information? 11..., Ft. .

The unloading means 10 of step 334
The data will be erased from the main storage device 8 by activation of the . Then, in the next step 335, the identification information in the queue is updated to F It F It..., FI,
The load number in the load number storage area 1b is updated to "70" in step S36.

〔Effect of the invention〕

As explained above, the present invention manages frames in a queue arranged in the order of the most recently accessed frames, and when the total number of frames on the main storage device exceeds a certain value, the queue is referred to and frames that have not been accessed recently are is written to a file from the main memory and then erased, which improves the utilization efficiency of the main memory and allows a large number of frames to be processed on a small-capacity main memory.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an example of a system implementing the present invention, FIG. 2 is a flowchart of an example of processing by the initial value setting means 2, FIG. 3 is a flowchart of an example of processing by the queue addition means 3, and FIG. 4 is a flowchart of an example of processing by the queue addition means 3. 5 is a flowchart of an example of processing by the unload determining means 4, FIG. 5 is a flowchart of an example of processing by the unload selection means 5, and FIG. 6 is a flowchart of an example of processing by the queue updating means 6. In the figure, 1... frame management information storage unit, 1a...
...Queue storage area, 1b...Load number storage area, I
C... Maximum load number storage area, 1d... Minimum load number storage area, 2... Initial value setting means, 3... Queue addition means, 4... Unload determination means, 5... Unload selection means, 6... Queue update means, 7... Frame reference update means, 8... Main storage, 9... Load means, 10... Unload means, 11... File , 12... input means.

Claims (1)

[Claims] In a frame management method in a frame-based knowledge representation system, there is provided a queue storage area for storing a queue in which frames existing on the main storage are arranged in the order of the most recently accessed frames; A frame that includes a load number storage area that stores the total number of loads, a maximum load number storage area where the maximum load number that is the upper limit of the load number is set, and a minimum load number storage area where the minimum load number is set. a management information storage unit; a queue addition means for updating the queue storage area and the load number storage area each time a frame is read from a file storing the frame into the main storage; and a queue addition means for reading the frame from the file into the main storage. an unload determining means that determines the necessity of unloading from the contents of the load number storage area and the maximum load number storage area at each time; , to refer to the queue storage area and write frames that have not been accessed recently from the main storage to the file so that frames equal to the number of loads set in the minimum load number storage area remain in the main storage; 1. A frame management system comprising: unload selection means for activating an unload means when a frame on a main storage device is accessed; and queue update means for updating the queue storage area each time a frame on a main storage device is accessed.