JPS63223834A - Queue processing system - Google Patents

Abstract

PURPOSE:To simply cancel the component elements without changing the connecting method among these elements by providing previously the valid bits in response to those component elements connected to a queue structure respectively. CONSTITUTION:A queue structure 1 contains plural component elements connected to each other and each of these elements has a valid bit showing its validity or invalidity. When a certain component element is canceled in the structure 1, a flag showing 'invalid' is set at a valid bit of said component element by a valid bit processing part 3 based on an instruction given from a queue control part 2. Then the component element is extracted via a queue extracting part 4 when an extracting request is received from the part 2. In this case, such component elements whose valid bits are defined as 'invalid' are disused and the element extracting job is repeated until a component element whose valid bit is not defined as 'invalid' is obtained.

Description

DETAILED DESCRIPTION OF THE INVENTION TECHNICAL FIELD The present invention relates to a queue processing method, and more particularly to a processing method for a first-in, first-out queue structure.

BACKGROUND ART Conventionally, in this type of queue processing, when canceling a queue component from a queue structure, the connected components are examined one by one, and when the desired component is found, the connection method is changed. , it is then necessary to cancel the component to be canceled.

In the conventional method described above, it is necessary to sequentially examine the components connected to the queue structure from the beginning.
This method has the disadvantage that it takes time to find the component to be canceled. In particular, the larger the number of connected components, and the closer the desired component is connected to the end of the queue structure, the longer it will take to find the desired component. The disadvantage is that a lot of money is wasted.

Furthermore, since the queue structure changes due to the cancellation of the constituent elements, it is necessary to change the method of linking the queue structure.

OBJECT OF THE INVENTION The present invention has been made to solve the above-mentioned drawbacks of the conventional ones, and its purpose is to provide a queue in which components can be easily canceled without changing the connection method of the components. The objective is to provide a processing method.

Another object of the present invention is to provide a queue processing method that allows component cancellation processing to be performed easily and in a short time.

According to the present invention, there is provided a queue processing method in a first-in, first-out queue structure having a group of queue components and connectors that connect these components to each other, wherein each component A valid bit is set in advance for each element, and the constituent elements in the queue structure can be handled. In response to the i4 request, the valid bit corresponding to the component to be canceled is invalidated, and when the configuration element is taken out from the queue structure, the valid bit is checked and if it indicates invalidity, the corresponding component is 1 is a queue processing method characterized by eliminating
! ? It will be done.

Example The present invention will be described in detail below using the drawings.

FIG. 1 is a schematic block diagram of an embodiment of the present invention, which includes a queue structure 1 using a first-in first-out system, a queue control unit 2,
It consists of a valid bit processing section 3 and a queue extraction section 4.

FIG. 2 is a diagram schematically showing the configuration of the queue structure 1 shown in FIG. 1. Group of multiple components 31.32.・
..., 3n are connectors 41, 42 .・・・・・・、
4n, the start pointer 11 points to the first component 31, and the end pointer 21 points to the last component 3n.

Also, valid bits 51.52. . . . , 5n indicates validity/invalidity of each corresponding component.

In this configuration, it is assumed that in each of the constituent elements 31 to 3n in the queue structure 1, all the corresponding valid bits are flagged as "valid" at the time of writing. In this state, a certain component 31 in queue @ structure 1
When canceling, according to the instruction from queue υ1 @ unit 1, valid bit processing unit 3
In order to invalidate the valid bit 51 corresponding to 1, set it to “invalid”.
Set a flag indicating.

Thereafter, when there is a retrieval request from the queue control section 2, the queue retrieval section 4 performs processing operations according to the processing procedure shown in FIG. That is, in the queue retrieval process, as shown in FIG. 3, the first component is first retrieved, and it is checked whether the corresponding valid bit is set to "valid". If the valid bit is "invalid", that component is discarded and the next component is taken out. From now on, this operation will be repeated one after another.

By doing this, when canceling a component connected to a queue structure, it is sufficient to simply set the valid bit to ``invalid'', and during the queue retrieval process, the state of this valid bit is determined and the element is set to ``invalid''. If it is, all that is needed is to discard that component and take out the next first component, which not only shortens the processing time, but also eliminates the need to change the connection method.

Effects of the Invention As described above, according to the present invention, a valid bit corresponding to each component connected to a queue structure is provided in advance, and for a component whose connected state is to be canceled, the corresponding valid bit is set in advance. It is only necessary to set the ``invalid'' state to ``invalid'', which has the effect of significantly shortening the processing time and making it unnecessary to change the connection method.

[Brief explanation of the drawing]

FIG. 1 is a schematic block diagram of an embodiment of the present invention, FIG. 2 is a schematic diagram that does not show the queue structure applied to the embodiment of the present invention, and FIG. 3 is a flowchart showing the operation of the embodiment of the present invention. be. Explanation of symbols of main parts 1...Queue structure 3...Valid bit processing section 4...Queue extraction section 31-3n...Components 41-4n・・・・・・Connector

Claims (1)

[Claims] A queue processing method in a first-in, first-out queue structure that has a group of queue components and connectors that connect these components to each other, the queue processing method comprising a bit; means for invalidating the valid bit corresponding to the component to be canceled in response to a request to cancel the component in the queue structure; A queue processing method characterized by providing means for excluding a corresponding component if the result is determined to be invalid.