Abstract
The HPC-DAG task model is a very general and feature-rich model that was developed for the purposes of representing real-time applications that are intended for implementation upon heterogeneous multiprocessor platforms. The computational complexity of determining feasibility for a task specified according to this model is considered, both for the general model and for some practically meaningful restricted variants.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
A contrived and highly simplified example: consider a cyber-physical system designed to operate in wet or dry weather; in darkness or well-lit conditions; under strong winds or in mild ones; etc. While the space of possible operating conditions has cardinality \(2\times 2\times \cdots \times 2=2^n\), it may be reasonable to assume that the conditions along each dimension—whether it is raining or not, the ambient light, the wind-speed, etc.—are all known at the start of each invocation of the task.
References
Arora S, Barak B (2009) Computational complexity—a modern approach. Cambridge University Press, Cambridge
Baruah S (2021) Feasibility analysis of conditional DAG tasks is co-\(\rm NP^{\text{NP}}\)-hard (why this matters). In: Proceedings of the twenty-ninth international conference on real-time and network systems, RTNS ’21, New York, NY, USA. ACM
Baruah S, Marchetti-Spaccamela A (2021) Feasibility analysis of conditional DAG tasks. In: Brandenburg BB (ed) 33rd Euromicro conference on real-time systems (ECRTS 2021), vol 196. Leibniz international proceedings in informatics (LIPIcs), Dagstuhl, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp 12:1–12:17
Baruah S, Bonifaci V, Marchetti-Spaccamela A, Stougie L, Wiese A (2012) A generalized parallel task model for recurrent real-time processes. In: Proceedings of the IEEE real-time systems symposium, RTSS 2012, San Juan, Puerto Rico, pp 63–72
Baruah S, Bertogna M, Buttazzo G (2015) Multiprocessor scheduling for real-time systems. Springer Publishing Company Incorporated, New York
Baruah S, Bonifaci V, Marchetti-Spaccamela A (2015) The global EDF scheduling of systems of conditional sporadic DAG tasks. In: Proceedings of the 2014 26th Euromicro conference on real-time systems, ECRTS ’15, Lund (Sweden). IEEE Computer Society Press, pp 222–231
Fonseca J, Nelis V, Raravi G, Pinho LM. A multi-DAG model for real-time parallel applications with conditional execution. In: Proceedings of the ACM/ SIGAPP symposium on applied computing (SAC), Salamanca, Spain, April (2015). ACM Press
Houssam-Eddine Z, Capodieci N, Cavicchioli R, Bertogna M, Lipari G (2020) The HPC-DAG task model for heterogeneous real-time systems. IEEE Trans Comput 70:1747–1761
Klaus J (1994) Analysis of scheduling problems with typed task systems. Discret Appl Math 52(3):223–232
Melani A, Bertogna M, Bonifaci V, Marchetti-Spaccamela A, Buttazzo G (2015) Response-time analysis of conditional DAG tasks in multiprocessor systems. In: Proceedings of the 2014 26th Euromicro conference on real-time systems, ECRTS ’15, Lund (Sweden). IEEE Computer Society Press, pp 222–231
Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Reading, MA
Stockmeyer L (1976) The polynomial-time hierarchy. Theoret Comput Sci 3:1–22
Wrathall C (1976) Complete sets and the polynomial-time hierarchy. Theoret Comput Sci 3:23–33
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Baruah, S. Feasibility analysis for HPC-DAG tasks. Real-Time Syst 58, 134–152 (2022). https://doi.org/10.1007/s11241-022-09380-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-022-09380-z