JPS63291154A - Queue processing system - Google Patents

Abstract

PURPOSE:To prevent the generation of the competition of resources by executing the processing of a lot of information input requests on a center with an execution unit when a lot of information input requests are generated from a terminal on an on-line system. CONSTITUTION:For input information registrated to queues 4-6, with delivering means 71-73 in one execution unit, at first, the delivering means 71-73 execute extraction 107 of the input information from the queue 4 and registering 110 to a queue 8. After completing it, the delivering means 72 executes removing 108 of the input information from the queue 5 and registering 111 to the queue 8. After completing it, in the same way, the delivering means 73 executes removing 109 from the queue 6 and registering 112 to the queue 8. The delivering means 71-73 successively execute deliverings by a housing to one execution unit. Thus, without generating the competition to the queue 8, the processing can be executed.

Description

[Detailed Description of the Invention] (Industrial Application Field) The present invention relates to data input processing of an online system.
In particular, it relates to queue processing methods.

(Prior Art) Conventionally, in online systems where many information input requests occur, information input requests are accepted according to the amount of information input requests generated, and
A known method is to create a plurality of execution units for executing operations for classification and editing, and to create queues for storage means.

FIG. 8 is a block diagram showing an example of a queue processing method according to the prior art. In FIG. 8, 1 to 3 are calculating means, 9 is a storage means, and 10 is a queue. In FIG. 8, calculation means 1 to 3 sequentially accept, classify,
and an execution unit for executing editing, and creates a queue 10 in the storage means 9.

(Problems to be Solved by the Invention) In the conventional information input request queue processing method described above, the input information queue is distributed, but information input requests are not received, classified, and edited in response to occurrences. Since a plurality of execution units are used for the arithmetic means that executes, there is a drawback that resource contention occurs in the storage means in terms of calculations. That is, firstly, as the number of execution units increases, resource contention also increases, and this contention causes waiting time, which increases the response time to information input requests.Secondly, the storage means Since a queue is created in this queue, there is a drawback that registrations and retrievals are concentrated only in this queue, and risk distribution cannot be achieved. This increases the length of the queue, so there is a disadvantage that it is necessary to ensure a sufficient length.Fourth, the concentration of the queue increases, and when registering this queue, there is a possibility of failure due to contention. This retry has the disadvantage of increasing response time.

An object of the present invention is to create multiple queues and registers between multiple receptions, classifications, and edits until registering a queue for storing the input information when accepting many information input requests. Queue processing that eliminates the above drawbacks by introducing passing and executing processing so that multiple passes can be performed on one or a small number of execution units, and configured so that resource contention does not occur. The purpose is to provide a method.

(Means for solving the problem) The queue processing method according to the present invention includes a set of calculation means,
When many information input requests are generated from the terminals in an online system comprising a set of delivery means, a storage means, and a set of queuing means and consisting of a plurality of terminals and a center, many information input requests are made on the center. The configuration is such that information input requests can be processed in units of execution.

One set of calculation means is for executing a plurality of receptions, classifications, and edits when accepting information input requests.

The set of transfer means is for performing multiple transfers in one or a small number of execution units.

The storage means is for storing input information.

-a queue means is associated with a set of calculation means and a set of delivery means.

(Example) Next, the present invention will be explained with reference to the drawings.

FIG. 1 is a block diagram illustrating one embodiment of a queue processing method according to the present invention.

In FIG. 1, 1 to 3 are arithmetic means with an execution unit, F, 71 to 73 are transfer means for performing three transfers to one execution unit, 9 is a storage means with an execution unit, and 4 to
Reference numeral 6 represents a queue that connects the calculation means 1 to 3 and the delivery means F, and reference numeral 8 represents a queue that connects the delivery means F and the storage means 9. Each execution unit is a unit capable of parallel processing, and - each means in the execution unit cannot perform parallel processing. A large number of information input requests 101 to 103 are received, classified, and edited by three calculation means 1 to 3 that can be processed in parallel, and three queues are created corresponding to the calculation means 1 to 3. 4 to 6 are registered. .

FIG. 2 is an explanatory diagram showing an example of the processing means in FIG. 1. Parallel processing is executed without conflict from reception 101 to queue registration 104, from reception 102 to queue registration 1081, and from reception 103 to queue registration 106, and after completion of queue registration, the next It becomes possible to accept information input requests.

The input information registered in the queues 4 to B in FIG. 2 is transferred by the transfer means 71 to 73 in the execution unit. , performs registration 110 in the queue 8. After completion, the transfer means 2 retrieves 108 the input information from the queue 5 and registers 111 it in the queue 8. After completion, the transfer means 3 similarly performs the removal 109 from the queue 6 and the registration 112 in the queue 8.

The above-mentioned delivery means 71 to 3 perform delivery sequentially by storing in -execution units. In this case, it becomes possible to execute the process without causing a conflict in the queue 8.

The input information registered in the queue 8 is retrieved 113 by the storage means 9, which is a separate execution unit, and reflected in the storage means 9. Since the storage means 9 is a separate execution unit, the extraction 113 from the queue 8 is performed by the queue 8.
It does not wait for all the registrations 110, 111, and 112, but the registration 11 in the queue 8 by the delivery means F1.
0 is completed, the input information is retrieved from the queue 1
Start 13. Delivery means 2. In response to the registration 111 and 112 of F3 to the queue 8, the storage means 9 similarly performs the extraction 113 from the queue 8.

In other words, the three calculation means 1 to 3, the delivery means 71 to 73 corresponding to the three transfers, and the storage means 9 are in a state where they can perform parallel processing by registering and taking out each queue.

(Effects of the Invention) As described above, the present invention registers a preliminary queue for storing input information after performing multiple receptions, classifications, and aggregations when accepting many information input requests. In the meantime, by introducing passing and executing processing so that multiple queues and multiple passing can be performed on one or a few execution units, it is possible to handle many information input requests. , firstly, the resource contention for the storage means is reduced and the contention waiting time is reduced; secondly, the queue for the storage means is distributed;
This has the effect of dispersing risks by preventing concentration of registration and retrieval.Eighthly, by distributing queues, the length of one queue can be reduced.Fourthly, the length of one queue can be reduced. There are no failures and no retries required when registering to this queue, since there are no conflicts between registrations to
This has the effect that no increase in response time due to retries occurs.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an embodiment of the queue processing method according to the present invention. FIG. 2 is a block diagram showing an example of the processing procedure in FIG. 1. Figure @3 is a block diagram showing an example of implementing a queue processing method according to the conventional technology. 1-3...Arithmetic means 4-6.8.10...Queue queue f, 71-F3...Delivery means 11-13...Input information 101-113...Salary processing procedure

Claims (1)

[Claims] a set of calculation means for performing multiple receptions, classifications, and edits when accepting information input requests; a set of delivery means for performing multiple deliveries on one or a small number of execution units; An online system comprising a plurality of terminals and a center, comprising a storage means for storing the input information, and a set of queue means associated with the set of calculation means and the set of delivery means. A queue processing method characterized in that, when many information input requests are generated from the terminals, processing of the many information input requests can be performed in execution units on the center.