JPS62293451A - Operating system for queue file - Google Patents

Abstract

PURPOSE:To realize a correction of the use efficiency of a memory and a processing speed of a queue file by allowing a main storage device to have the contents whose reference frequency is high in a queue element, and allowing an auxiliary storage device to have the contents whose reference frequency is low. CONSTITUTION:By a program which has been stored in a advance in a storage device 4, or a program which is inputted through an input/output terminal 5, the collected contents are divided into the contents whose reference frequency is high and the contents whose reference frequency is low. In case of using said contents as a queue R and executing the enqueuing, the contents 11B whose reference frequency is high in a queue element are put into a main storage device 1, the contents whose reference frequency of low are written in an auxiliary storage device 2 which is mainly composed of a disk device, etc., and information for indexing at this time is put as access information 11A in the main storage device 1 in the same way.

Description

[Detailed Description of the Invention] 3. Detailed Description of the Invention [Field of Industrial Application] The present invention relates to a queue file operation method, and in particular, the present invention relates to a queue file operation method, in particular, a method for separating frequently referenced content and low reference content of queue elements separately. This invention relates to a queue file operation method for an electronic computer stored in a storage device.

[Conventional technology]

Conventionally, this type of key-file operation system has adopted either a system in which all queue elements are stored in the main storage device, or a system in which all queue elements are stored in the auxiliary storage device.

[Problem that the invention seeks to solve]

Among the conventional key-file operation methods described above, in the method of accommodating all queue elements in the main memory, the size of the queue file is limited by the capacity of the main memory, and all elements are accommodated in the auxiliary memory. The disadvantage of this method is that the access time is long and the processing speed is slow.

[Failure to solve the problem]

A cue file operation method of the present invention is a cue file operation method for an electronic computer, comprising: a main storage device that stores access information for frequently referenced content in a queue element and access information for infrequently referenced content in the queue element;
and an auxiliary storage device that accommodates content that is referenced with low frequency in the cue element.

〔Example〕

Next, the present invention will be described in detail with reference to drawings showing embodiments.

FIG. 1 is a block diagram showing the structure of one embodiment of the present invention, and FIG. 2 is a flowchart showing the operation of one embodiment of the present invention. As shown in FIG. 1, this embodiment has a main storage device 1,
It includes an auxiliary storage device 2, a processing device 3, a storage device 4, and an input/output terminal, which are connected by a data bus 100.

The present invention divides queue elements to be enqueued prior to data processing into frequently referenced contents and lowly referenced contents.
・Access information 12B and content with low reference frequency 11A・
12A is stored in the main storage device 1, and a queue R21 and a queue 822 indicating contents that are less frequently referenced are stored in the auxiliary storage device 2, respectively.

The program is stored in advance through the input/output terminal 5 or directly on the storage device 4! /C storage, and based on the control of the processing device 3, the queue for data processing is sent to the input/output terminal 5.
Enqueue from. According to FIG. 1, there are two queues, queue R11 and queue 812, but it may be singular or plural depending on the content of data processing. Also,
The input/output terminal 5 includes a communication terminal 51, a storage device 52 mainly including a magnetic tape device with a large storage capacity and a long access time, and a storage device 53 mainly including a magnetic disk device with a short access time. Data is input/output to and from external systems etc. through the communication terminal 51 and is temporarily stored in the storage devices 52 and 53, or directly input to the main storage device 1 or the auxiliary storage device 2. Furthermore, data stored in advance in the storage devices 52 and 53 can also be used.

Under such a configuration, the contents (sometimes including not only data but also subprograms) collected by a program stored in advance in the storage device 4 or a program input through the input/output terminal 5 are Divide into frequently referenced content and less frequently referenced content. When enqueuing this as queue R, the frequently referenced content 11B in the queue element is placed in the main storage device 1, and the less frequently referenced content is written to the auxiliary storage device 2, which is mainly a disk device. Information for the index is also stored in the main storage device 1 as access information 11A.

When dequeuing the queue R, the contents on the main storage device 1 are read out, and if only the frequently referenced contents 11B exists in the lever, the read contents are referred to, and if there is access information, this is used. The auxiliary storage device 2 is accessed by referring to .

When enqueuing the queue k again, the dequeued contents of the main memory device 1 are collected and enqueued to the main memory capacity 1 as they are. The same operation is performed for key-8.

Next, the operation of this embodiment will be explained.

First, prior to data processing, a queue element is enqueued, the queue element on the main storage device 1 is read out, and dequeue processing is performed (step 2).

At this time, it is checked whether the content to be referred to is only the queue element on the main storage device 1 (step 2). If only the queue elements on the main storage device 1 are required, the data indicated in the program is processed (step 2).

However, if contents other than the key elements on the main storage device 1 are required, the queue elements are read from the auxiliary storage device 3 (step 2), and then the data is processed (step 2). Also, refer to the program and check whether it is necessary to further use the queue on the main memory (step ■), and if re-enqueue is not necessary, the operation ends here, and if it is necessary, enqueues only the same element as the queue on the main memory as the next queue element from the input/output terminal (step ■), and processes the data again (step ■
), the repeat operation ends until enqueuing is no longer necessary.

〔Effect of the invention〕

By storing infrequently referenced content in elements in auxiliary storage, access speeds can be increased without being relatively limited by the capacity of main storage, making it possible to optimize memory usage efficiency and queue file processing speed. effective.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of an embodiment of the invention, and FIG. 2 is a flowchart showing the operation of the embodiment of the invention. 1...Main storage device, 2...Auxiliary storage device, 3...Processing device, 4...Storage device, 5...Input Output terminal. 10th

Claims (1)

[Claims] In a cue file operation method for an electronic computer, a storage device that stores access information for frequently referenced content in a queue element and infrequently referenced content in the queue element, and infrequently referenced content in the queue element. and an auxiliary storage device accommodating the queue file operation method.