Timed task scheduling method, server and storage device

Abstract

The invention discloses a timed task scheduling method, a server and a storage device, and the timed task scheduling method comprises the steps: detecting a current moment, and determining a timed task corresponding to the current moment in a time wheel; wherein each unit time scale of the time wheel corresponds to one timed task; and scheduling and executing the timed task through the schedulingnode corresponding to the timed task. In this way, the timed task corresponds to the corresponding unit time scale in the time wheel;, so the timed task is scheduled to be executed when the corresponding moment is detected, so that the performance overhead caused by frequent sorting of the timed task can be effectively reduced, the efficiency of polling the timed task is effectively improved, andmeanwhile, the situation that the timed task is out of date and is not executed due to the fact that polling of the timed task is not timely is also avoided.

Description

technical field [0001] The present application relates to the technical field of scheduling scheduled tasks, and in particular to a scheduling method, server and storage device for scheduled tasks. Background technique [0002] Nowadays, with the rapid development of the IoT (Internet of Things, Internet of Things) field, smart devices connected to the Internet also show explosive growth. Among the smart devices that are connected to the Internet, a large part of them need to automatically complete some tasks regularly, which makes it particularly important to provide an efficient and stable timing scheduling system to complete the scheduling of a large number of timing tasks. [0003] Usually, when the amount of timed tasks that need to be scheduled is small, all timed tasks can be stored in a persistent database, and the timed tasks that need to be executed recently can be queried and loaded from the same database through the scheduling node, so as to wait until the specif...

AI Technical Summary

Problems solved by technology

[0005] The present application provides a timing task scheduling method, server and storage device. The scheduling method can solve the serious performance overhead caused by sorting when the scheduling node frequently sorts and queries all the tasks in the task list of the database. The resulting inefficiency, and because the scheduled tasks are stored in the database, the scheduling node frequently reads and writes the database, resulting in excessive IO overhead and slow operation, resulting in failure to expire due to untimely query of the scheduled tasks execution problem

Images