Task polling method, task arrangement method and relevant device

Abstract

The embodiment of the invention discloses a task polling method, a task arrangement method and a relevant device. According to the task polling method, multiple queues used for arranging tasks are setin a computer system, wherein delay time of the arranged tasks in the queues conforms to time intervals corresponding to the queues, polling is only performed on the tasks in the corresponding queues, and therefore the quantity of tasks needing to be polled at a time is obviously smaller than that in a traditional mode. For the first queue in the queues, the tasks in the first queue are polled according to a polling cycle of the first queue, and delay time of polled tasks is calculated; and if the delay time of the polled first task is in the time interval corresponding to the second queue, the first task is extracted from the first queue and arranged into the second queue with a shorter polling cycle. When the delay time of the first task is short, the first task can be arranged into thesecond queue with the shorter polling cycle, and the possibility that the first task can be timely executed when the delay time of the first task is zero is improved through frequent polling.

Description

technical field [0001] The invention relates to the field of data processing, in particular to a task polling method, a task arrangement method and related devices. Background technique [0002] In the computer system, some services need to be realized at a predetermined time in the future, such as pushing information at a fixed time every day, launching certain activities at specific times or dates, etc. If relying solely on manual methods and waiting for the scheduled time to arrive to implement this type of business through the computer system, it will bring high costs and uncertainties. [0003] The traditional method is to use pre-created tasks with delay characteristics, such tasks can set a delay time, such as 10 seconds, 10 minutes, 10 days, and so on. The delay time can be shortened with the passage of time in a countdown manner. For example, the delay time of creating a task at time 0 is 10 seconds. After 8 seconds at time 0, the delay time of this task will becom...

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