A task polling method, task arrangement method and related device

Abstract

The embodiment of the present invention discloses a task polling method, a task arranging method and a related device. Multiple queues for arranging tasks are set in a computer system, and the delay time of the tasks arranged in the queues is in line with the queues. In the corresponding time interval, only the tasks in the queue are polled for a queue, so the number of tasks that need to be polled at a time is obviously less than the traditional method. For the first queue among the multiple queues, poll the tasks in the first queue according to the polling cycle of the first queue, and calculate the delay time of the polled task, if the delay time of the first task is polled In the time interval corresponding to the second queue, the first task is taken out of the first queue and arranged to the second queue with a smaller polling period. When the delay time of the first task is short, it can be arranged to The second queue with a short polling period can be polled more frequently to improve the possibility that the first task can be executed in time when the delay time of the first task returns to zero.

Description

technical field [0001] The invention relates to the field of data processing, in particular to a task polling method, a task arranging method and related devices. Background technique [0002] In a computer system, some services need to be implemented at a predetermined time in the future, such as pushing information at a fixed time each day, launching certain activities at a specific time or date, and so on. If you rely solely on manual methods, and wait for the scheduled time to arrive to implement this type of business through a computer system, it will bring high costs and uncertainty. [0003] The traditional approach is to use pre-created tasks with delay characteristics, such tasks can be set to a delay time, such as 10 seconds, 10 minutes, 10 days, etc. The delay time can be shortened as time goes by in a countdown manner. For example, the delay time of creating a task at time 0 is 10 seconds, and after 8 seconds at time 0, the delay time of this task will become 10...

AI Technical Summary

Problems solved by technology

[0005] However, the problem with this task polling method is that in order to ensure that all tasks with delay characteristics can be monitored when the delay time returns to zero, it is necessary for the computer system to save the tasks in the storage area in each polling cycle All tasks are polled once, and in view of the short delay time of some tasks, the polling cycle of the computer system needs to be set correspondingly shorter, which leads to the need for the computer system to repeatedly poll a large number of tasks in a short time interval , so that the polling task consumes a lot of system resources and affects the performance of the computer system

Images