Method for designing thread pool capable of ensuring temporal succession

Abstract

The invention relates to a method for designing a thread pool capable of ensuring temporal succession. The method comprises the following steps of: maintaining a task for the thread pool and marking the task into to a Hash mapping table of a thread ID, for managing the task distribution; adding an attribute parameter to thread parameters: a load (LThread) used for identifying the total quantity of the distributed tasks of each thread; and instead of sharing the same task queue by all the threads, configuring a corresponding task queue for each thread in the thread pool, wherein each thread can search for a new task from the corresponding task queue, and a single monitoring thread is arranged. The method provided by the invention has the advantages that: 1) by utilizing the new added function of the mapping table, the temporal successions for inputting and outputting data of each task can be guaranteed to be completely consistent, and 2) the loads on all threads can be guaranteed to be always consistent by the monitoring thread started at regular time, thereby achieving the best concurrent property.

Description

technical field [0001] The invention relates to a thread pool design method, in particular to a thread pool design method for ensuring time continuity. Background technique [0002] A thread pool is a form of multithreading. The thread pool will pre-create several threads to perform application tasks, and these threads are usually organized in the form of queues. Generally, the number of tasks that the thread pool needs to perform is greater than the number of threads in the thread pool. When a thread completes a task, it will request new tasks from the task queue to execute until all tasks in the task queue are completed. After that, the threads in the thread pool will be suspended or dormant until a new task arrives. [0003] Traditional thread pools have different priorities for the tasks executed, and treat tasks with the same priority completely equally. But complete equality does not apply to all application scenarios. For example, in a real-time database, there i...

AI Technical Summary

Problems solved by technology

For example, in a real-time database, there is a requirement for time continuity for all data, but since all tasks are executed in parallel in the thread pool, the task that arrives later may be completed before the previous task, so that the data output by the thread pool is consistent with the input The data for is reversed in time continuity

Images