A task packaging and scheduling method and system for multi-type context dependence

Abstract

The invention discloses a task packaging and scheduling method and system for multi-type context dependence. The method comprises the steps of defining the task types and the context dependence relations for different data types and tasks; determining the task scheduling information according to the task type and context dependence of the new task; judging whether the new task meets the dependencyrelationship or not, if yes, setting the task state of the new task, packaging the new task and the task scheduling information into a task object, and adding the task object into a task queue; otherwise, failing to add; extracting the task object with the highest priority in the ready state from the task queue; if the dependency relationship is met, running the current task object; and otherwise, scheduling the precursor task object to run, scheduling the current task object to run if the precursor task runs successfully, and abandoning scheduling the current task object if the precursor task runs unsuccessfully. According to the invention, the unified management of different types of tasks is realized, the control on task packaging and scheduling is realized, and the use experience of auser is improved.

Description

technical field [0001] The invention belongs to the field of computer information processing, and in particular relates to a multi-type context dependent task encapsulation and scheduling method and system. Background technique [0002] With the continuous development of computer information processing technology, a large number of information processing systems need to process and respond to short-term interactive tasks and long-term batch tasks. In these systems, the processing of the same data set requires multiple steps of tasks with back-and-forth dependencies, and the tasks of processing different data sets are often different. [0003] At present, for these tasks, one processing method is to manually select the tasks to execute one by one according to the actual situation. The execution of the next task must wait for the completion of the current task. This method is time-consuming, laborious and inefficient. However, the scheduling method of executing tasks accordin...

AI Technical Summary

Problems solved by technology

[0003] At present, for these tasks, one processing method is to manually select the tasks to execute one by one according to the actual situation. The execution of the next task must wait for the completion of the current task. This method is time-consuming, laborious and inefficient.

However, the scheduling method of executing tasks according to priority in the existing task scheduling method cannot meet the efficient management of complex and diverse tasks. Users need to rewrite different task scheduling methods for different tasks according to the requirements of the scene, which cannot be realized. Unified and efficient management of various types of tasks

Images