SAP SE
SORTING TASKS WITH DEPENDENCIES AND RESOURCE SHARING

Abstract:

Disclosed herein are system, method, and computer program product embodiments for resolving an execution order for a plurality of tasks, such as solving complex calculations in order, installing new software in order, or scheduling instructions by compilers in order. The approach uses a dependency graph to perform a topological sort, and applies a heuristic to determine which node to execute next from remaining nodes without dependency issues. The approach favors reducing resource conflicts with a resource used by a previous node, resolving larger numbers of dependencies early, and forcing early resolution of resource conflicts.