Kernel scheduling based on precedence constraints and/or artificial intelligence techniques

摘要

A device may receive information that identifies a set of tasks to be executed and precedence constraints associated with the set of tasks. The device may store the set of tasks in a data structure including a directed acyclic graph, and may determine a set of paths based on the information that identifies the set of tasks and the precedence constraints associated with the set of tasks. Each path, of the set of paths, may include particular tasks of the set of tasks. The device may determine a set of path execution times, for the set of paths, based on an artificial intelligence technique. The device may determine a critical path, of the set of paths, based on the set of path execution times. The device may determine an execution priority of the set of tasks based on the critical path. The device may provide the set of tasks for execution based on the execution priority.