Document Open Access Logo

Replication-Based Scheduling of Parallel Real-Time Tasks

Authors Federico Aromolo, Geoffrey Nelissen, Alessandro Biondi

PDF
Thumbnail PDF

File

LIPIcs.ECRTS.2023.18.pdf
  • Filesize: 0.81 MB
  • 23 pages

Document Identifiers

Author Details

Federico Aromolo
  • Scuola Superiore Sant’Anna, Pisa, Italy
Geoffrey Nelissen
  • Eindhoven University of Technology, Eindhoven, The Netherlands
Alessandro Biondi
  • Scuola Superiore Sant’Anna, Pisa, Italy

Acknowledgements

The authors would like to thank José Fonseca for the fruitful discussions that triggered the idea for the approach presented in the paper.

Cite AsGet BibTex

Federico Aromolo, Geoffrey Nelissen, and Alessandro Biondi. Replication-Based Scheduling of Parallel Real-Time Tasks. In 35th Euromicro Conference on Real-Time Systems (ECRTS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 262, pp. 18:1-18:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ECRTS.2023.18

Abstract

Multiprocessors have become the standard computing platform for real-time embedded systems. To efficiently leverage the computational power of such platforms, software tasks are often characterized by an internal structure where concurrent subtasks can execute in parallel on different processors. Existing strategies for the scheduling of parallel real-time tasks on multiprocessor platforms, such as partitioned, global, and federated scheduling, were inspired by earlier techniques that were not conceived to explicitly support parallel tasks, thus carrying advantages but also well-known limitations. This paper introduces replication-based scheduling, a specialized scheduling paradigm for parallel real-time DAG tasks. Replication-based scheduling leverages the internal structure of the parallel tasks to assign replicas of the subtasks to different processors, while ensuring that exactly one replica of each subtask will be executed at runtime for every task instance. This approach aims at preserving the advantages of partitioned scheduling while simplifying the timing analysis. The replication-based scheduling framework is first defined, together with a strategy for implementing replication-based scheduling in real-time operating systems. Then, offline allocation strategies for subtask replicas and a response-time analysis are presented. In the provided experiments, the schedulability achieved with replication-based scheduling is compared with that of existing techniques for the scheduling of parallel real-time tasks on multiprocessors.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Real-time systems
  • Software and its engineering → Real-time schedulability
Keywords
  • Real-Time Systems
  • Scheduling Algorithms
  • Schedulability Analysis
  • Parallel Tasks

Metrics

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

References

  1. Ishfaq Ahmad and Yu-Kwong Kwok. On exploiting task duplication in parallel program scheduling. IEEE Transactions on Parallel and Distributed Systems, 9(9):872-892, 1998. Google Scholar
  2. Federico Aromolo, Alessandro Biondi, Geoffrey Nelissen, and Giorgio Buttazzo. Event-driven delay-induced tasks: Model, analysis, and applications. In Proceedings of the 27th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2021), pages 53-65. IEEE, 2021. Google Scholar
  3. Neil Audsley, Alan Burns, Mike Richardson, Ken Tindell, and Andy J Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering, 8(5):284-292, 1993. Google Scholar
  4. Philip Axer, Sophie Quinton, Moritz Neukirchner, Rolf Ernst, Björn Döbel, and Hermann Härtig. Response-time analysis of parallel fork-join workloads with real-time constraints. In Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), pages 215-224. IEEE, 2013. Google Scholar
  5. Sanjoy Baruah. Improved multiprocessor global schedulability analysis of sporadic DAG task systems. In Proceedings of the 26th Euromicro Conference on Real-Time Systems (ECRTS 2014), pages 97-105. IEEE, 2014. Google Scholar
  6. Sanjoy Baruah. The federated scheduling of constrained-deadline sporadic DAG task systems. In Proceedings of the 18th IEEE Design, Automation and Test in Europe Conference and Exhibition (DATE 2015), pages 1323-1328. IEEE, 2015. Google Scholar
  7. Sanjoy Baruah. Federated scheduling of sporadic DAG task systems. In Proceedings of the 29th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2015), pages 179-186. IEEE, 2015. Google Scholar
  8. Andrea Bastoni, Björn Brandenburg, and James Anderson. Cache-related preemption and migration delays: Empirical approximation and impact on schedulability. In Proceedings of the 6th International Workshop on Operating Systems Platforms for Embedded Real-Time Applications (OSPERT 2010), pages 33-44, 2010. Google Scholar
  9. Andrea Bastoni, Björn B. Brandenburg, and James H. Anderson. An empirical comparison of global, partitioned, and clustered multiprocessor EDF schedulers. In Proceedings of the 31st IEEE Real-Time Systems Symposium (RTSS 2010), pages 14-24. IEEE, 2010. Google Scholar
  10. Enrico Bini and Giorgio C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30(1-2):129-154, 2005. Google Scholar
  11. Alessandro Biondi and Youcheng Sun. On the ineffectiveness of 1/m-based interference bounds in the analysis of global EDF and FIFO scheduling. Real-Time Systems, 54:515-536, 2018. Google Scholar
  12. Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller, and Andreas Wiese. Feasibility analysis in the sporadic DAG task model. In Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), pages 225-233. IEEE, 2013. Google Scholar
  13. Daniel Casini, Alessandro Biondi, Geoffrey Nelissen, and Giorgio Buttazzo. Partitioned fixed-priority scheduling of parallel tasks without preemptions. In Proceedings of the 39th IEEE Real-Time Systems Symposium (RTSS 2018), pages 421-433. IEEE, 2018. Google Scholar
  14. Jian-Jia Chen, Geoffrey Nelissen, Wen-Hung Huang, Maolin Yang, Björn Brandenburg, Konstantinos Bletsas, Cong Liu, Pascal Richard, Frédéric Ridouard, Neil Audsley, Raj Rajkumar, and Georg von der Brüggen. Many suspensions, many problems: A review of self-suspending tasks in real-time systems. Real-Time Systems, 55(1):144-207, 2019. Google Scholar
  15. Son Dinh, Christopher Gill, and Kunal Agrawal. Efficient deterministic federated scheduling for parallel real-time tasks. In Proceedings of the 26th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2020), pages 1-10. IEEE, 2020. Google Scholar
  16. José Fonseca. Multiprocessor Scheduling and Mapping Techniques for Real-Time Parallel Applications. PhD thesis, Faculdade de Engenharia da Universidade do Porto, 2019. Google Scholar
  17. 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 (RTNS 2017), pages 28-37. ACM, 2017. Google Scholar
  18. 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
  19. José Fonseca, Geoffrey Nelissen, Vincent Nélis, and Luís Miguel Pinho. Response time analysis of sporadic DAG tasks under partitioned scheduling. In Proceedings of the 11th IEEE Symposium on Industrial Embedded Systems (SIES 2016), pages 1-10. IEEE, 2016. Google Scholar
  20. Xu Jiang, Nan Guan, Haochun Liang, Yue Tang, Lei Qiao, and Wang Yi. Virtually-federated scheduling of parallel real-time tasks. In Proceedings of the 42nd IEEE Real-Time Systems Symposium (RTSS 2021), pages 482-494. IEEE, 2021. Google Scholar
  21. Xu Jiang, Nan Guan, Xiang Long, and Wang Yi. Semi-federated scheduling of parallel real-time tasks on multiprocessors. In Proceedings of the 38th IEEE Real-Time Systems Symposium (RTSS 2017), pages 80-91. IEEE, 2017. Google Scholar
  22. Karthik Lakshmanan, Shinpei Kato, and Ragunathan Rajkumar. Scheduling parallel real-time tasks on multi-core processors. In Proceedings of the 31st IEEE Real-Time Systems Symposium (RTSS 2010), pages 259-268. IEEE, 2010. 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 Proceedings of the 26th Euromicro Conference on Real-Time Systems (ECRTS 2014), pages 85-96. IEEE, 2014. Google Scholar
  24. Alessandra Melani, Marko Bertogna, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, and Giorgio C. Buttazzo. Response-time analysis of conditional DAG tasks in multiprocessor systems. In Proceedings of the 27th Euromicro Conference on Real-Time Systems (ECRTS 2015), pages 211-221. IEEE, 2015. Google Scholar
  25. Alessandra Melani, Maria A Serrano, Marko Bertogna, Isabella Cerutti, Eduardo Quinones, and Giorgio Buttazzo. A static scheduling approach to enable safety-critical OpenMP applications. In Procedings of the 22nd Asia and South Pacific Design Automation Conference (ASP-DAC 2017), pages 659-665. IEEE, 2017. Google Scholar
  26. Amir Nahir, Ariel Orda, and Danny Raz. Replication-based load balancing. IEEE Transactions on Parallel and Distributed Systems, 27(2):494-507, 2015. Google Scholar
  27. Geoffrey Nelissen, Vandy Berten, Joël Goossens, and Dragomir Milojevic. Techniques optimizing the number of processors to schedule multi-threaded tasks. In Proceedings of the 24th Euromicro Conference on Real-Time Systems (ECRTS 2012), pages 321-330. IEEE, 2012. Google Scholar
  28. Abusayeed Saifullah, Jing Li, Kunal Agrawal, Chenyang Lu, and Christopher Gill. Multi-core real-time scheduling for generalized parallel task models. Real-Time Systems, 49(4):404-435, 2013. Google Scholar
  29. Niklas Ueter, Georg Von Der Brüggen, Jian-Jia Chen, Jing Li, and Kunal Agrawal. Reservation-based federated scheduling for parallel real-time tasks. In Proceedings of the 39th IEEE Real-Time Systems Symposium (RTSS 2018), pages 482-494. IEEE, 2018. Google Scholar
  30. Roberto Vargas, Eduardo Quinones, and Andrea Marongiu. OpenMP and timing predictability: A possible union? In Proceedings of the 18th IEEE Design, Automation and Test in Europe Conference and Exhibition (DATE 2015), pages 617-620. IEEE, 2015. 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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact