Process for optimizing ordering processing for multiple affairs

Abstract

The invention provides an optimization sequencing processing method for multiple transactions. The optimization sequencing processing method includes the following steps: identification information is endowed to each transaction according to the time when each transaction sends a request; each transaction is respectively fallen under a primary queue or a secondary queue in a current transaction processing end according to the class information of each transaction; when the transaction processing end is in an idle condition, whether the latency time of a first transaction sorted according to the time in the primary queue is larger than the time threshold value of the primary queue is interpreted; if the latency time in the primary queue is larger than the time threshold value of the primary queue, the transaction processing end processes the first transaction in the primary queue, and if not, whether the latency time of the first transaction sorted according to the time in the secondary queue is larger than the time threshold value of the secondary queue is further judged; if the latency time in the secondary queue is larger than the time threshold value of the secondary queue, the transaction processing end processes the first transaction in the secondary queue, and if not, the transaction processing end processes the first transaction in the primary queue. The invention can search out the transaction with the highest PRI from the queue by logical calculus in a real time way.

Description

Technical field [0001] The present invention relates to the technical field of computer data processing, in particular to a method and system for performing optimized sorting processing for multiple transactions. Background technique [0002] When a computer terminal receives multiple task requests within a certain period of time, but cannot complete them at the same time, they are generally processed in a queue, and transactions with higher priority can be placed in the front of the queue for priority processing. Queue is a first-in, first-out linear table. It only allows inserts at one end of the table and deletes elements at the other end. In the queue, the end that is allowed to be inserted is called the end of the queue, and the end that is allowed to be deleted is called the head of the queue. [0003] Queuing technology also has many applications in other technical fields. For example, existing financial business outlets often receive multiple business requests at the same...

AI Technical Summary

Problems solved by technology

[0005] Although the above prior art can solve the problem that multiple services cannot be processed at the same time to a certain extent, it simply sorts according to the time when the service requests are made, which will lead to the following defects:

[0007] In addition, because the existing technology is only a simple sorting, the priority of VIP customers in the queue must be higher than that of ordinary customers. In fact, as the waiting time prolongs, the priority of ordinary customers should also change. However, the existing queuing technology cannot be adjusted in time, resulting in a discrepancy between the actual processing word order and the actual priority word order

[0008] From a technical point of view, there is an inaccurate problem in the queue technology's sorting of pending transactions, which leads to the failure of timely processing of important transactions, resulting in poor processing efficiency and results; from a business point of view, it leads to excessive waiting time for customers Long, customer satisfaction is reduced, customer complaints occur frequently, and even cause customer loss, especially the loss of high-end customers

Images