As parallel processing became ubiquitous in modern computing systems, parallel task models have been proposed to describe the structure of parallel applications. The workflow scheduling problem has been studied extensively over past years, focusing on multiprocessor systems and distributed environments (e.g. grids, clusters). In workflow scheduling, applications are modeled as directed acyclic graphs (DAGs). DAGs have also been introduced in the real-time scheduling community to model the execution of multi-threaded programs on a multi-core architecture. The DAG model assumes, in most cases, a fixed DAG structure capturing only straight-line code. Only recently, more general models have been proposed. In particular, the conditional DAG model allows the presence of control structures such as conditional (if-then-else) constructs. While first algorithmic results have been presented for the conditional DAG model, the complexity of schedulability analysis remains wide open. We perform a thorough analysis on the worst-case makespan (latest completion time) of a conditional DAG task under list scheduling (a.k.a. fixed-priority scheduling). We show several hardness results concerning the complexity of the optimization problem on multiple processors, even if the conditional DAG has a well-nested structure. For general conditional DAG tasks, the problem is intractable even on a single processor. Complementing these negative results, we show that certain practice-relevant DAG structures are very well tractable.

complexity, conditional DAG, makespan, parallel processing
34th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2020
Life Sciences and Health

Marchetti Spaccamela, A, Megow, N, Schlote, J, Skutella, M, & Stougie, L. (2020). On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems. In Proceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, IPDPS 2020 (pp. 1061–1070). doi:10.1109/IPDPS47924.2020.00112