Scheduling method for data acquisition task

Abstract

The invention provides a scheduling method for a data acquisition task. The scheduling method comprises the following steps that: a task scheduler receives a data acquisition task; a resource monitor collects the use condition of bandwidth resources in a current system; when the task scheduler processes the current task and the system can meet the bandwidth resource requirement of the current task, the task is allocated with required resources; if the bandwidth resources in the system are insufficient, the bandwidth resources used by the tasks which are in execution and have the priority lower than that of the current task in the system is reduced until the requirement of the current task is met; the current task and the corresponding task list of which the bandwidth is limited to be used are stored; the task of which the resources are allocated is executed; and when the task exits, the bandwidth limitation of all the tasks in the task list which correspond to the task and are limited to use the bandwidth is released. According to the scheduling method for the data acquisition task, sufficient resources are provided for execution of the high-priority task under the condition that the low-priority task does not need to be deleted.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a scheduling method for data acquisition tasks. Background technique [0002] In a distributed system, task execution needs to use a part of system resources, which makes it necessary to determine the allocation of system resources according to the priority of tasks in the task scheduling process to ensure that high-priority tasks are completed in time. At present, such problems can be solved The preemptive scheduling strategy is adopted, that is, when the high priority task arrives and the resources in the system are insufficient, the low priority task is deleted and the resources occupied by it are deprived so that the high priority task can be executed. The preemptive scheduling strategy solves tasks of different priority Conflicts on resources, but it will cause repeated execution of low-priority tasks, resulting in waste of time. For data acquisition tasks, the main resour...

AI Technical Summary

Problems solved by technology

[0002] In a distributed system, task execution needs to use a part of system resources, which makes it necessary to determine the allocation of system resources according to the priority of tasks in the task scheduling process to ensure that high-priority tasks are completed in time. At present, such problems can be solved The preemptive scheduling strategy is adopted, that is, when the high priority task arrives and the resources in the system are insufficient, the low priority task is deleted and the resources occupied by it are deprived so that the high priority task can be executed. The preemptive scheduling strategy solves tasks of different priority Conflicts on resources, but it will cause repeated execution of low-priority tasks, resulting in waste of time. For data acquisition tasks, the main resource used is bandwidth. If the preemptive scheduling strategy is used, the low-priority It is difficult to save the state of the task before it is preempted (for example, the data acquisition target does not support breakpoint resume), and the acquired data will be wasted. Therefore, for data acquisition tasks, the preemptive scheduling strategy is not the best solution

Images