Script issuing scheduling method based on time wheel

Abstract

The invention relates to the technical field of data structures, and discloses a script issuing scheduling method based on a time wheel. The method comprises the following steps: S1, receiving a scheduling task through the time wheel; S2, splitting the scheduling task into task queues according to time, and distributing the task queues into time slots corresponding to a time wheel; S3, storing the task queue into a time slot through a preset priority heap; S4, presetting a time wheel execution rule, and executing the task queue stored in the time wheel according to the time wheel execution rule. A time wheel is used as a scheduling basic data structure, a priority heap is added, and accurate scheduling of tasks is completed with small expenditure.

Description

technical field [0001] The present invention relates to the technical field of data structures, specifically, a method for dispatching scripts based on a time wheel, which is used to optimize the dispatching strategy for dispatching scripts. The data structure of the time wheel is used to reduce the scheduling of dispatching scripts, so that tasks The execution is more punctual, the complexity of task implementation is smaller, and the resource overhead in task execution is reduced. Background technique [0002] There are often some scheduling tasks in security software, most of which are timing and periodic tasks, such as timing detection of asset status, timing collection of asset resource status, and periodic execution of scripts. Take the bastion host as an example. As a security software, the bastion host has some scheduling tasks, most of which are periodic tasks, and some scheduled tasks, the longest period of which will not exceed one year. If there are a large numb...

AI Technical Summary

Problems solved by technology

[0003] 1. If a large number of scheduling tasks use their own scheduler to manage the life cycle of the task, it will waste cpu resources and be very inefficient, and there will often be delays in task execution

[0004] 2. Use third-party components to complete task scheduling, some third-party components cannot fully meet the needs, and some large and comprehensive third-party components will consume some unnecessary resources

[0005] 3. In general, for simple tasks, use the timer to check every 1 second, and each time you need to traverse the entire task queue, causing unnecessary overhead

[0006] 4. Use a linear table as a scheduling model to solve scheduling tasks. Every second, you need to query which tasks need to be executed. You need to query row by row and column by row, which will cause inaccurate task execution time.

[0007] 5. Sort the data structure according to the execution time, so that the task closest to the front can be taken each time, but the time required for sorting itself should not be underestimated, which will cause inaccurate task execution time

Images