JPS62248040A - Queue managing system - Google Patents

Abstract

PURPOSE:To increase the degree of freedom of a queue, and to make it have the extendability of a use condition, by eliminating that which has other advance factor, at the time of the rearrangement of a dequeuing sequence by the priority of a factor and the generation of a specific factor. CONSTITUTION:At the time of enqueuing, whether a dead record exists in record managing information or not is detected by a record managing part 4, and when the dead record is detected, write of a data is executed. In this case, from the factor of the existing record, the factor of a new record, and factor defining information, a dequeuing sequence number is rewritten by the latest priority. As for how to give this sequence number, in this case, it is set as an ascending power order. Also, at the time of dequeuing, the maximum value to 1-(n+1) except zero of a dequeuing sequence number 4-1 is retrieved by the record managing part 4, and when all are zero, no registration is decided and the dequeuing is ended, otherwise, the record managing information concerned is read, the managing part concerned is cleared to zero and the dequeuing is ended.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a queue management method for managing queue files used when maintaining queues for computer processing on disk memory or other memory areas. It is something.

[Conventional technology]

For example, the structure of the queue data file in this kind of conventional queue management system is shown in Figure 3 of the Kanagawa System Disaster Prevention Administrative Radio Software Specification (P391, published October 1985). In the figure, 1 is the record storage area, 2 is the registration information, and the number of registrations (2-
1), a read pointer (2-2) indicating the pair fJ ==- dekey position.

and a write pointer (2-3) indicating the position of the record to be temporarily enqueued.

Next, the operation will be explained with reference to FIG.

The figure shows enqueue in the conventional queue management method.

The steps of dequeue are shown below, where IF[al is the enqueue temporary management procedure and fbl in the figure is the dequeue temporary management procedure. First, at the time of enqueue, the number of registered factors (2-1) is checked to see if it is over-registered, and if the predetermined capacity is reached, it is determined that registration is impossible and the process ends (ST-1). 9. If there is free space, the record indicated by the write pointer is glanced over (ST-2), the write pointer and the number of registrations are each incremented by 1 (ST-3''), and the process ends (ST-3''). , At the time of decoding, check the presence or absence of the number of registrations (2-1) from the registration information 2 as shown in Figure 4 (BL), and if the number of registrations is -0, the end is 5T-1). At the time of ``,'' read the record indicated by the read pointer (2-2'') (ST-2), add 1 to the read pointer (2-2), -1 to registration a (2-1>), and finish. Do (ST3
).

[Problem that the invention seeks to solve]

In the conventional queue management method, which is performed as described above, it is enqueued and de-needed in order of b times, so it lacks flexibility in that it is only suitable for time-series processing. This invention has been carefully designed to solve the above-mentioned problems, and it has been developed to replace the conventional chronological priority (priority I!) method.
l) The objective is to obtain a queue management method that can be fully expanded in functionality from management to priority management based on factors.

[Friendly means to solve problems]

In addition to the conventional pointer method, the queue management method according to the present invention includes a factor definition section consisting of decube priority information for each factor, a dekey sequence number for each record, and a dekey sequence number for each record.
and a record management section consisting of a factor number arbitrarily used by the user as registered information, and the queue is managed.

[For production]

The queue management method according to the present invention makes it possible to arbitrarily change the dequeue order by intentional operation on the enqueue side.

〔Example〕

DESCRIPTION OF THE PREFERRED EMBODIMENTS The entire drawings of an embodiment of the present invention will be described below. In the figure, the same parts as in Figure 3 are shown with the same reference numbers as in Figure 3.
In the figure, the figure shows an example of the structure of a cue file according to the present invention, and the file is a record storage f! l
It consists of s1 and registration information 2. Then, the registered information 2 is sent from the factor definition section 3 and the record management section 4 as fit#.
), and the factor definition unit 3 further stores a factor priority (3-1) that defines a dequeue priority for each occurrence factor and a dequeue order number 1 to n+1 . . . that registers a dekey order number for each record. (41) and a record management section 4 in which factor numbers (4-2) arbitrarily used by the user are stored.

Next, the queue management method will be explained. First, the second Z
(at indicates the enqueuing step, as shown in the figure (b)
shows the dequeue temporary management procedure.

That is, at the time of the record management s4, the presence or absence of an empty record is detected from the record management information (5T-1), and if an empty record is found, all data is written (ST-2).

At this time, the dekey sequence number (4-1) is rewritten with the latest priority based on the factor of the existing record, the factor of the new record, and the factor definition information (ST-3). Here, the order numbers are assigned in ascending order. Also, at the time of Deki 2, the record management section 4 searches for the minimum value from 1 to n + 1 excluding zero in the order number (4-1') for all rows (ST-1), even if they are all zero. If so, it is determined that there is no registration and the process ends. Otherwise, the corresponding record management information is included (ST-2) (ST-3), and the corresponding management section is cleared to zero and the process ends (ST-4).

〔Effect of the invention〕

As described above, according to the present invention, the dequeue order can be rearranged based on the priority of factors, and when a specific factor occurs, other preceding factors can be deleted. This has the effect of making the usage conditions more extensible.

[Brief explanation of drawings]

FIG. 1 is a configuration diagram of a queue file according to an embodiment of the present invention, and FIG. 2 is an enqueue according to the present invention. The third figure is a diagram showing the configuration of a conventional queue file, and FIG. 4 is a diagram showing the management procedure for the enqueue and dequeue methods shown in FIG. In the figure, 1 is a record storage section, 2 is a registration information section, 3 is a factor definition section, and 4 is a record management section. Figure 1 4. Record pipework! Sweat P Fig. 2 (a) Fig. 2 (b) Fig. 3 n: Maximum record f - total number of trees, -1 Filiority: 1~m Shi Code Kakunanai p 2:3 To Zenshu L. Takeshi Yoshiyuki Figure 4 (a) Figure 4 (b) C-D Procedural amendment (voluntary) 1. Indication of ゛100'I Patent application No. 61-91193 2, Title of the invention Queue management method 3, Relationship with the person making the amendment f'1 Patent applicant address 2-2-3 Marunouchi, Chiyogawa-ku, Tokyo Name (601) Mitsubishi Electric Stock Company Representative Moriya Shiki 4, Agent Postal Code 105 Address
1-4-10-5 Nishi-Shinbashi, Minato-ku, Tokyo, Subject of amendment (1) Detailed description of the invention in the specification (2) Drawings 4'Pa, 1. 6. Contents of amendment (11 “Record management information Z” on page 6, line 1 of the specification)
I corrected it to "record t". (2) In the 7th to 8th lines of page 6 of the specification, the phrase ``I decided to delete it,'' was corrected to ``I had it deleted.'' (3) Correct Figure 1 as shown in the attached sheet. (4) Correct the attached document, Figure 2 (a). (5) Amend the attached document V, Figure 3. 7. List of attached documents (1) 1 document (2 copies) showing the revised Figure 1
) Revised barrel 2 drawing (alY written document 1 copy (3
) 1 or more documents listed in Figure 3 χ after amendment Figure 1 4 Rufoud Kanko! Figure 2 (a)

Claims (1)

[Claims] In a queue file management method in which a computer processing queue is provided on a disk memory or other memory area, the queue is managed using a factor definition section consisting of decube priority information for each factor and a dequeue order for each record. The registration information is composed of a record management section consisting of a number and a factor number arbitrarily used by the user, and the dequeue order can be arbitrarily changed by intentional operation on the enqueue side. Queue management method.