Document Open Access Logo

Response Time Bounds for DAG Tasks with Arbitrary Intra-Task Priority Assignment

Authors Qingqiang He, Mingsong Lv, Nan Guan



PDF
Thumbnail PDF

File

LIPIcs.ECRTS.2021.8.pdf
  • Filesize: 1.07 MB
  • 21 pages

Document Identifiers

Author Details

Qingqiang He
  • Department of Computing, The Hong Kong Polytechnic University, Hong Kong
Mingsong Lv
  • Department of Computing, The Hong Kong Polytechnic University, Hong Kong
Nan Guan
  • Department of Computing, The Hong Kong Polytechnic University, Hong Kong

Cite AsGet BibTex

Qingqiang He, Mingsong Lv, and Nan Guan. Response Time Bounds for DAG Tasks with Arbitrary Intra-Task Priority Assignment. In 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 196, pp. 8:1-8:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.ECRTS.2021.8

Abstract

Most parallel real-time applications can be modeled as directed acyclic graph (DAG) tasks. Intra-task priority assignment can reduce the nondeterminism of runtime behavior of DAG tasks, possibly resulting in a smaller worst-case response time. However, intra-task priority assignment incurs dependencies between different parts of the graph, making it a challenging problem to compute the response time bound. Existing work on intra-task task priority assignment for DAG tasks is subject to the constraint that priority assignment must comply with the topological order of the graph, so that the response time bound can be computed in polynomial time. In this paper, we relax this constraint and propose a new method to compute response time bound of DAG tasks with arbitrary priority assignment. With the benefit of our new method, we present a simple but effective priority assignment policy, leading to smaller response time bounds. Comprehensive evaluation with both single-DAG systems and multi-DAG systems demonstrates that our method outperforms the state-of-the-art method with a considerable margin.

Subject Classification

ACM Subject Classification
  • Software and its engineering → Real-time schedulability
Keywords
  • real-time systems
  • response time bound
  • DAG tasks
  • intra-task priority assignment

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Openmp-api-specification-5.0.pdf. https://www.openmp.org/wp-content/uploads/OpenMP-API-Specification-5.0.pdf. (Accessed on 03/01/2021).
  2. Theodore P Baker and Sanjoy K Baruah. Sustainable multiprocessor scheduling of sporadic task systems. In 2009 21st Euromicro Conference on Real-Time Systems, pages 141-150. IEEE, 2009. Google Scholar
  3. Sanjoy Baruah. Improved multiprocessor global schedulability analysis of sporadic dag task systems. In 2014 26th Euromicro conference on real-time systems, pages 97-105. IEEE, 2014. Google Scholar
  4. Sanjoy Baruah. The federated scheduling of constrained-deadline sporadic dag task systems. In 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE), pages 1323-1328. IEEE, 2015. Google Scholar
  5. Sanjoy Baruah. Federated scheduling of sporadic dag task systems. In 2015 IEEE International Parallel and Distributed Processing Symposium, pages 179-186. IEEE, 2015. Google Scholar
  6. Sanjoy Baruah. The federated scheduling of systems of conditional sporadic dag tasks. In Proceedings of the 12th International Conference on Embedded Software, pages 1-10. IEEE Press, 2015. Google Scholar
  7. Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller, and Andreas Wiese. Feasibility analysis in the sporadic dag task model. In 2013 25th Euromicro conference on real-time systems, pages 225-233. IEEE, 2013. Google Scholar
  8. Alan Burns and Sanjoy Baruah. Sustainability in real-time scheduling. Journal of Computing Science and Engineering, 2(1):74-97, 2008. Google Scholar
  9. Peng Chen, Weichen Liu, Xu Jiang, Qingqiang He, and Nan Guan. Timing-anomaly free dynamic scheduling of conditional dag tasks on multi-core systems. ACM Transactions on Embedded Computing Systems (TECS), 18(5s):1-19, 2019. Google Scholar
  10. Daniel Cordeiro, Grégory Mounié, Swann Perarnau, Denis Trystram, Jean-Marc Vincent, and Frédéric Wagner. Random graph generation for scheduling simulations. In Proceedings of the 3rd international ICST conference on simulation tools and techniques, page 60. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 2010. Google Scholar
  11. Alejandro Duran, Xavier Teruel, Roger Ferrer, Xavier Martorell, and Eduard Ayguade. Barcelona openmp tasks suite: A set of benchmarks targeting the exploitation of task parallelism in openmp. In Parallel Processing, 2009. ICPP'09. International Conference on, pages 124-131. IEEE, 2009. Google Scholar
  12. José Fonseca, Geoffrey Nelissen, and Vincent Nélis. Improved response time analysis of sporadic dag tasks for global fp scheduling. In Proceedings of the 25th international conference on real-time networks and systems, pages 28-37, 2017. Google Scholar
  13. José Fonseca, Geoffrey Nelissen, and Vincent Nélis. Schedulability analysis of dag tasks with arbitrary deadlines under global fixed-priority scheduling. Real-Time Systems, 55(2):387-432, 2019. Google Scholar
  14. José Fonseca, Geoffrey Nelissen, Vincent Nelis, and Luís Miguel Pinho. Response time analysis of sporadic dag tasks under partitioned scheduling. In 2016 11th IEEE Symposium on Industrial Embedded Systems (SIES), pages 1-10. IEEE, 2016. Google Scholar
  15. Vladimir Gajinov, Srđan Stipić, Igor Erić, Osman S Unsal, Eduard Ayguadé, and Adrián Cristal. Dash: a benchmark suite for hybrid dataflow and shared memory programming models: with comparative evaluation of three hybrid dataflow models. In Proceedings of the 11th ACM conference on computing frontiers, page 4. ACM, 2014. Google Scholar
  16. Meiling Han, Nan Guan, Jinghao Sun, Qingqiang He, Qingxu Deng, and Weichen Liu. Response time bounds for typed dag parallel tasks on heterogeneous multi-cores. IEEE Transactions on Parallel and Distributed Systems, 30(11):2567-2581, 2019. Google Scholar
  17. Qingqiang He, Xu Jiang, Nan Guan, and Zhishan Guo. Intra-task priority assignment in real-time scheduling of dag tasks on multi-cores. IEEE Transactions on Parallel and Distributed Systems, 30(10):2283-2295, 2019. Google Scholar
  18. John E Hopcroft, Rajeev Motwani, and Jeffrey D Ullman. Introduction to automata theory, languages, and computation. Acm Sigact News, 32(1):60-65, 2001. Google Scholar
  19. H KASAHARA and S NARITA. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE transactions on computers, 33(11):1023-1029, 1984. Google Scholar
  20. Yu-Kwong Kwok and Ishfaq Ahmad. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE transactions on parallel and distributed systems, 7(5):506-521, 1996. Google Scholar
  21. Yu-Kwong Kwok and Ishfaq Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys (CSUR), 31(4):406-471, 1999. Google Scholar
  22. Jing Li, Kunal Agrawal, Chenyang Lu, and Christopher Gill. Outstanding paper award: Analysis of global edf for parallel tasks. In 2013 25th Euromicro Conference on Real-Time Systems, pages 3-13. IEEE, 2013. Google Scholar
  23. Jing Li, Jian Jia Chen, Kunal Agrawal, Chenyang Lu, Chris Gill, and Abusayeed Saifullah. Analysis of federated and global scheduling for parallel real-time tasks. In 2014 26th Euromicro Conference on Real-Time Systems, pages 85-96. IEEE, 2014. Google Scholar
  24. Jing Li, David Ferry, Shaurya Ahuja, Kunal Agrawal, Christopher Gill, and Chenyang Lu. Mixed-criticality federated scheduling for parallel real-time tasks. Real-time systems, 53(5):760-811, 2017. Google Scholar
  25. Alessandra Melani, Marko Bertogna, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, and Giorgio C Buttazzo. Response-time analysis of conditional dag tasks in multiprocessor systems. In 2015 27th Euromicro Conference on Real-Time Systems, pages 211-221. IEEE, 2015. Google Scholar
  26. Risat Pathan, Petros Voudouris, and Per Stenström. Scheduling parallel real-time recurrent tasks on multicore platforms. IEEE Transactions on Parallel and Distributed Systems, 29(4):915-928, 2017. Google Scholar
  27. Jinghao Sun, Feng Li, Nan Guan, Wentao Zhu, Minjie Xiang, Zhishan Guo, and Wang Yi. On computing exact wcrt for dag tasks. In 2020 57th ACM/IEEE Design Automation Conference (DAC), pages 1-6. IEEE, 2020. Google Scholar
  28. Petros Voudouris, Per Stenström, and Risat Pathan. Timing-anomaly free dynamic scheduling of task-based parallel applications. In Real-Time and Embedded Technology and Applications Symposium (RTAS), 2017 IEEE, pages 365-376. IEEE, 2017. Google Scholar
  29. Shuai Zhao, Xiaotian Dai, Iain Bate, Alan Burns, and Wanli Chang. Dag scheduling and analysis on multiprocessor systems: Exploitation of parallelism and dependency. In IEEE Real-Time Systems Symposium. IEEE, 2020. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail