On the Complexity of Minimizing Energy Consumption of Partitioning DAG Tasks

Wei Liu, Jian-Jia Chen, Yongjie Yang

We study a graph partition problem where we are given a directed acyclic graph (DAG) whose vertices and arcs can be respectively regarded as tasks and dependencies among tasks. The…