JPH0385641A - Data processing precedence control system - Google Patents

Abstract

PURPOSE:To correctly execute priority processing without reversing designated precedence by processing the data of the high precedence among the data requested to process by carrying up its precedence. CONSTITUTION:A data processing requesting part 4 receives the data requested to process, and enqueues it in the processing waiting queue (precedence 1) 1 of the highest precedence. A data processing part 5 executes the processing when the precedence of the data dequeued from the processing waiting queue 1 coincides with the precedence of the processing waiting queue 1, and at the time excepting this time, after it repeats to enqueue the data to the processing waiting queue 2 (precedence 2) of the next precedence by the prescribed number of times, it executes the processing similarly in respect of the processing waiting queue 3 (precedence 3) of the next precedence. Accordingly, the data of the high precedence among the data requested to process comes to be processed by being carried up in its precedence. Thus, the priority processing can be executed without reversing the designated precedence.

Description

[Detailed Description of the Invention] [Summary] Regarding the pig processing priority control method in which data is processed according to the specified priority, the requested data is processed by moving up the priority of the data with the highest priority. In order to perform priority processing without reversing the priorities, we set up a processing queue that corresponds to the priority, and sequentially enqueues the data requested for processing to the processing queue with the highest priority. Starting from the queue with the highest priority, processing is performed when the priority of the dequeued data matches the priority of the queue, and at other times it is enqueued to the queue with the next priority. After repeating the process a predetermined number of times, the process is configured to perform the same process on the queue with the next priority.

[Industrial application field]

The present invention processes data according to specified priorities. This paper relates to a data processing priority control method that performs data processing. Data processing performed on computers has become more diverse and massive,
There are various types of data to be processed, including those that require immediate processing and those that only need to be completed the next day. There is a need for a mechanism to control the priority of processing, such as giving priority to those that need to be processed as much as possible within the limited computing power, and processing those that are not urgent at a later time.

[Prior art and the problem to be solved by the invention] Conventional processing priority control involves setting up a processing queue corresponding to the priority, and processing the requested data according to the priority. Enqueue to processing queue. Then, the data processing unit retrieves data from the processing queue with a high priority and processes it a predetermined number of times according to the priority, and then retrieves data from the processing queue with a high priority and processes it. I tried to do it repeatedly.

Therefore, if a large amount of data is enqueued in a high-priority processing queue, and a small amount of data is enqueued in a later requested processing queue with a low priority, low-priority data may be enqueued. There was a problem in that a situation occurred where the process was processed first.

An object of the present invention is to move up the order of requested data and process it with higher priority, and to perform priority processing without reversing the specified priority.

[Means to solve problems]

Means for solving the problem will be explained with reference to FIG.

In FIG. 1, processing queues 1, 2, 3, etc. are processing queues that are associated with priorities.

The data processing unit 5 determines that the priority of the data dequeued from the processing queue 1.2.3, etc. is set to the processing queue 1.2.3.
Processing is performed when the priority matches the priority, such as 2.3, and enqueued to the processing waiting queue of the next priority at other times.

[Effect]

As shown in FIG. 1, the present invention enqueues data that has been requested to be processed into the processing queue 1 with the highest priority, and the data processing unit 5 dequeues the data from the processing queue 1 with the highest priority. Processing is performed when the priority of the data matches the priority of the processing queue 1, and enqueuing it to the processing queue of the next priority is repeated a predetermined number of times, and then the data is enqueued to the processing queue of the next priority. Processing is performed in the same way for the queue waiting to be processed.

Therefore, by moving up the order of the requested data and processing it with a higher priority, priority processing can be performed without reversing the designated priority.

〔Example〕

Next, the configuration and operation of one embodiment of the present invention will be explained in detail using FIGS. 1 to 3.

In FIG. 1, a processing queue 1.2.3 is a processing queue that is associated with a priority, and for example, a processing queue that is associated with a priority such as "express delivery" or "non-urgent" for e-mail. It's a queue.

The data processing request unit 4 receives the data requested to be processed and enqueues it in the processing queue 1 having the highest priority (priority 1).

The data processing unit 5 determines that the priority of the data dequeued from the processing queue 1.2.3 is the corresponding processing queue l, 2.
The processing is performed when the priority matches the priority level 3, and the process is enqueued to the processing waiting queue of the next priority at other times.

Next, the operation of the configuration shown in FIG. 1 will be explained in detail in accordance with the order shown in the flowchart of FIG.

In FIG. 2, ■ enqueues the data requested by the data processing requesting unit into the processing queue with the highest priority. Then, the data processing request unit 4 in FIG. 1 enqueues the requested data into the processing queue (priority 1) 1 having the highest priority.

In [phase], the processing queue with the highest priority is targeted for processing by the data processing unit.

[Phase] dequeues and retrieves data from the queue waiting to be processed in the data processing unit.

(2) determines whether data exists or not. This is ■
Determine whether the data to be retrieved exists. YES
In this case, perform [phase]. In the case of NO, since there is no data in the processing queue, [phase] is performed.

[Phase] determines whether the priority of the retrieved data and the priority of the processing queue are the same. If YES, data is processed in [phase]. In the case of NO, the data is enqueued to the processing waiting queue of the next priority.

[Phase] determines whether the predetermined number of times of processing of the queue currently being processed has been exceeded. If YES, perform [phase]. If No, the predetermined number of times of processing has not yet been exceeded, so the steps after [phase] are repeated.

[Phase] determines whether there is a queue waiting to be processed with the next priority. If YES, the processing queue with the next priority in [Phase] is targeted for processing by the data processing unit, and [
Phase] Repeat the following steps. On the other hand, in the case of NO, since there is no waiting queue with the next priority, the processing queue with the highest priority in @ is set as the processing target of the data processing section, and the process is repeated from the beginning.

As described above, all data is initially enqueued to the processing queue 1 with the highest priority, dequeued from this processing queue 1 with the highest priority, and processed when the priority is the same as that of the processing queue 1. , At other times, after repeating enqueuing to the processing queue of the next priority a predetermined number of times, the same process is performed for the processing queue of the next priority, thereby giving priority to the requested data. It becomes possible to carry out processing by increasing the degree.

Next, a specific example will be explained using FIG.

This means that the number of times priority 1 data is processed is 5 times, the number of priority 2 data processing is 3 times, and the number of priority 3 data processing is 1 time.
This is the case when Here, as shown in ■ of the data processing requesting unit 4, two data b and d of priority l are
A case will be explained in which there are two pieces of data a and c of priority 2 and one piece of data e of priority 3.

■: Data processing request unit 4 sends data a (priority 2), b (priority 1), C (priority 2), d (priority 1), e (priority 3) in the order shown in the figure. Request processing of your data.

■: Enqueue to processing queue 1 with the highest priority 1 as shown in the figure.

■: Dequeue and retrieve data in order from the head of processing queue 1 with priority 1. Only the retrieved data b and d with priority 1 are processed, and the other data are enqueued into the next processing queue 2. Here, since the processing has been performed a predetermined number of times 5 (or when there is no more data to be dequeued from the processing queue 1), processing moves to the next processing queue 2 with priority level 2. In this state,
As shown in the diagram, data a (priority 2), data C (priority 2)
), e (priority level 3) are enqueued into processing queue 2 (■).

(2): Dequeue and retrieve data in order from the head of the processing queue 2 with priority 2. Only the retrieved data a and c of priority 2 are processed, and the other data are enqueued to the next processing queue 3. Here, since the processing has been performed a predetermined number of times 3 (or when there is no more data to be dequeued from the processing queue 2), processing moves to the next processing queue 3 with priority level 3. In this state,
As shown in the figure, one of the data e (priority 3) is enqueued in the processing queue 3 (■).

■: Dequeue and retrieve data from the head of the processing queue 3 with priority level 3. The retrieved data e with priority level 3 is processed. Here, since the process has been performed a predetermined number of times l (or when there is no more data to be dequeued from the processing queue 3), the process is terminated and the process is repeated from the beginning.

〔Effect of the invention〕

As explained above, according to the present invention, requested data is enqueued to the processing queue with the highest priority, and the data dequeued and retrieved from the processing queue has the same priority as the processing queue. Sometimes processing is done,
At other times, after repeating enqueuing to the processing queue of the next priority a predetermined number of times, the same process is repeated for the processing queue of the next priority, and processing is performed in order of priority. Therefore, among the data requested to be processed, data with a high priority is processed by moving up the order, and priority processing can be performed accurately without reversing the specified priority.

[Brief explanation of drawings]

FIG. 1 is a block diagram of one embodiment of the present invention, FIG. 2 is a flowchart explaining the operation of the present invention, and FIG. 3 is a detailed explanatory diagram of the present invention. In the figure, 1.2.3 represents a processing queue, 4 represents a data processing request unit, and 5 represents a data processing unit. 1

Claims (1)

[Claims] In a data processing priority control method for processing data according to a specified priority, processing queues (1), (2), (
3) etc., the data requested to be processed is sequentially enqueued to the processing queue (1) with the highest priority, and the priority of the dequeued data, starting from this processing queue (1) with the highest priority, is Processing is performed when the priority of the processing queue (1) matches, and enqueuing to the processing queue of the next priority is repeated a predetermined number of times. A data processing priority control method characterized by being configured to perform processing on queues in the same way.