Scheduling series-parallel task graphs to minimize peak memory

Abstract

We consider a variant of the well-known, NP-complete problem of minimum cut linear arrangement for directed acyclic graphs. In this variant, we are given a directed acyclic graph and we are asked to find a topological ordering such that the maximum number of cut edges at any point in this ordering is minimum. In our variant, the vertices and edges have weights, and the aim is to minimize the maximum weight of cut edges in addition to the weight of the last vertex before the cut. There is a known, polynomial time algorithm [Liu, SIAM J. Algebra. Discr., 1987] for the cases where the input graph is a rooted tree. We focus on the instances where the input graph is a directed series-parallel graph, and propose a polynomial time algorithm, thus expanding the class of graphs for which a polynomial time algorithm is known. Directed acyclic graphs are used to model scientific applications where the vertices correspond to the tasks of a given application and the edges represent the dependencies between the tasks. In such models, the problem we address reads as minimizing the peak memory requirement in an execution of the application. Our work, combined with Liu's work on rooted trees addresses this practical problem in two important classes of applications.

Driver Generation for IoT Nodes With Optimization of the Hardware/Software Interface

“…graphs that only comprise of series and parallel compositions of other SP-graphs and the base case of a single node. Optimal memory-aware scheduling of SP-graphs has been solved with a polynomial-time algorithm by [17] based on [21]. We implemented this algorithm and adjusted the task model to match that of DNN inference.…”

Resource management for moldable parallel tasks supporting slot time in the Cloud

“…Those methods always target to shorten the execution time by smartly selecting the execution route of DAG of the parallel tasks. Some scheduling methods not only try to shorten the execution time, but also try to improve performance of other aspects, such as reducing peak memory [27], the energy consumption [28,29,30] and so on. K. Enver et al, "tried to reduce the peak memory in a parallel execution environment.…”

Optimal memory-aware backpropagation of deep join networks

“…Sethi [4] showed that this problem is NP-complete for general task graphs. Further study showed that the problem is solvable in polynomial graphs for tree-shaped graphs [5], or recently series-parallel graphs [6].…”