Task application device and method based on task pre-allocation

Abstract

The invention relates to a task application device based on task pre-allocation, which comprises a memory and a processor, and is characterized in that an instruction is stored in the memory and is suitable for being loaded by the processor and executing the following steps: generating a task by a client; judging whether the generated task is a high-priority task; if the current task is a high-priority task, putting the current task into a high-priority queue; if the current task is not the high-priority task, selecting an entry user of the executable task, and putting the task into a pre-allocated task queue of the entry user of the executable task; entering a task application request initiated by a user; if the high-priority queue is not empty and the task with the application permissionof the input user exists, immediately applying for the task with the highest priority in the tasks by the current input user; otherwise, allocating the task with the highest priority to the current input user from the pre-allocated task queue of the current input user; and after the input user acquires the task, returning the detail data to the input user by the client.

Description

technical field [0001] The invention relates to a task application device and method based on task pre-allocation, and belongs to the technical field of office automation. Background technique [0002] The task application system is mainly used for the identification and entry of bills. Divide the fields in a single bill into multiple input tasks, and these input tasks have different priorities according to customers and types. The entry user applies to the task application system for entry authority, and the entry task with the highest priority is entered. [0003] The existing task application system mainly adopts the method of database transaction lock table to ensure that the input user first applies for the high priority input task in the task pool, and the same input task will not be applied by other input users. [0004] The limitations of this approach mainly lie in the following aspects: [0005] 1. Most of the calculations are performed after the entry user send...

AI Technical Summary

Problems solved by technology

[0005] 1. Most of the calculations are performed after the entry user sends the entry task application, such as calculating the task set that the user can enter according to the user's skill authority, the highest priority task set that the user can currently enter, etc.;

[0006] 2. The input speed of input users is very fast, and the concurrency of application tasks is very large. A large number of concurrency will consume a lot of lock resources, resulting in the system being very stuck during the peak period of ticket volume, which seriously affects the input efficiency of input users;

[0007] 3. With the increase of data volume, the performance of traditional relational databases is very obvious; however, the data volume of input tasks is often very large, which can reach tens of millions in a few days, and verification affects system performance;

[0008] 4. The task application logic is written in the storage process of the database. Due to the single-point characteristics of the traditional relational database, horizontal expansion cannot be done. In the case of a large amount of input tasks, the processing capacity of the system cannot be expanded horizontally by increasing hardware resources

Images