@inproceedings{06080fb2f6384d749383c623f93e465d,
title = "On the Volume Calculation for Conditional DAG Tasks: Hardness and Algorithms",
abstract = "The hardness of analyzing conditional directed acyclic graph (DAG) tasks remains unknown so far. For example, previous researches asserted that the conditional DAG's volume can be solved in polynomial time. However, these researches all assume well-nested structures that are recursively composed by single-source-single-sink parallel and conditional components. For conditional DAGs in general that do not comply with this assumption, the hardness and algorithms of volume computation are still open. In this paper, we construct counterexamples to show that previous work cannot provide a safe upper bound of the conditional DAG's volume in general. Moreover, we prove that the volume computation problem for conditional DAGs is strongly \textbackslash{}mathcal\{N\}\textbackslash{}mathcal\{P\}-hard. Finally, we propose an exact algorithm for computing the conditional DAG's volume. Experiments show that our method can significantly improve the accuracy of the conditional DAG's volume estimation.",
keywords = "Conditional branches, DAG, NP-hard, Volume",
author = "Jinghao Sun and Yaoyao Chi and Tianfei Xu and Lei Cao and Nan Guan and Zhishan Guo and Wang Yi",
note = "Publisher Copyright: {\textcopyright} 2020 EDAA.; 2020 Design, Automation and Test in Europe Conference and Exhibition, DATE 2020 ; Conference date: 09-03-2020 Through 13-03-2020",
year = "2020",
month = mar,
doi = "10.23919/DATE48585.2020.9116559",
language = "英语",
series = "Proceedings of the 2020 Design, Automation and Test in Europe Conference and Exhibition, DATE 2020",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "204--209",
editor = "\{Di Natale\}, Giorgio and Cristiana Bolchini and Elena-Ioana Vatajelu",
booktitle = "Proceedings of the 2020 Design, Automation and Test in Europe Conference and Exhibition, DATE 2020",
address = "美国",
}