Document Open Access Logo

Toward Contention Analysis for Parallel Executing Real-Time Tasks

Authors Fabrice Guet, Luca Santinelli, Jérôme Morio, Guillaume Phavorin, Eric Jenn

PDF
Thumbnail PDF

File

OASIcs.WCET.2018.4.pdf
  • Filesize: 476 kB
  • 13 pages

Document Identifiers

Author Details

Fabrice Guet
  • ONERA - The French Aerospace Lab, Toulouse, France
Luca Santinelli
  • ONERA - The French Aerospace Lab, Toulouse, France
Jérôme Morio
  • ONERA - The French Aerospace Lab, Toulouse, France
Guillaume Phavorin
  • IRT Saint Exupery, Toulouse, France
Eric Jenn
  • IRT Saint Exupery, Toulouse, France

Cite As Get BibTex

Fabrice Guet, Luca Santinelli, Jérôme Morio, Guillaume Phavorin, and Eric Jenn. Toward Contention Analysis for Parallel Executing Real-Time Tasks. In 18th International Workshop on Worst-Case Execution Time Analysis (WCET 2018). Open Access Series in Informatics (OASIcs), Volume 63, pp. 4:1-4:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/OASIcs.WCET.2018.4

Abstract

In measurement-based probabilistic timing analysis, the execution conditions imposed to tasks as measurement scenarios, have a strong impact to the worst-case execution time estimates. The scenarios and their effects on the task execution behavior have to be deeply investigated. The aim has to be to identify and to guarantee the scenarios that lead to the maximum measurements, i.e. the worst-case scenarios, and use them to assure the worst-case execution time estimates.
We propose a contention analysis in order to identify the worst contentions that a task can suffer from concurrent executions. The work focuses on the interferences on shared resources (cache memories and memory buses) from parallel executions in multi-core real-time systems. Our approach consists of searching for possible task contenders for parallel executions, modeling their contentiousness, and classifying the measurement scenarios accordingly. We identify the most contentious ones and their worst-case effects on task execution times. The measurement-based probabilistic timing analysis is then used to verify the analysis proposed, qualify the scenarios with contentiousness, and compare them. A parallel execution simulator for multi-core real-time system is developed and used for validating our framework.
The framework applies heuristics and assumptions that simplify the system behavior. It represents a first step for developing a complete approach which would be able to guarantee the worst-case behavior.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Real-time system architecture
Keywords
  • Contention analysis
  • parallel executions
  • measurement-based probabilistic timing analysis
  • probabilistic worst-case execution time

Metrics

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

References

  1. J. Abella, E Quiñones, F. Wartel, T. Vardanega, and F. J. Cazorla. Heart of gold: Making the improbable happen to increase confidence in mbpta. In 2014 26th Euromicro Conference on Real-Time Systems, pages 255-265. IEEE, 2014. Google Scholar
  2. A. Al Badawi and A. Shatnawi. Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization. Computers &Operations Research, 40(10):2322-2328, 2013. Google Scholar
  3. Björn Andersson, Arvind Easwaran, and Jinkyu Lee. Finding an upper bound on the increase in execution time due to contention on the memory bus in cots-based multicore systems. SIGBED Rev., 7(1):4:1-4:4, 2010. Google Scholar
  4. J. Andersson, J. Gaisler, and R. Weigand. Next generation multipurpose microprocessor. In Int. Conf. on Data Systems in Aerospace (DASIA), Hungary, 2010. Google Scholar
  5. Dhruba Chandra, Fei Guo, Seongbeom Kim, and Yan Solihin. Predicting inter-thread cache contention on a chip multi-processor architecture. In High-Performance Computer Architecture, 2005. HPCA-11. 11th International Symposium on, pages 340-351. IEEE, 2005. Google Scholar
  6. Maxime Chéramy, Pierre-Emmanuel Hladik, and Anne-Marie Déplanche. Simso: A simulation tool to evaluate real-time multiprocessor scheduling algorithms. In 5th International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS), pages 6-p, 2014. Google Scholar
  7. L. Cucu-Grosjean, L. Santinelli, M. Houston, C. Lo, T. Vardanega, L. Kosmidis, J. Abella, E. Mezzeti, E. Quinones, and F. J. Cazorla. Measurement-Based Probabilistic Timing Analysis for Multi-path Programs. In the 24th Euromicro Conference on Real-Time Systems, 2012. Google Scholar
  8. F. Guet, L. Santinelli, and J. Morio. On the reliability of the probabilistic worst-case execution time estimates. In 8th European Congress on Embedded Real Time Software and Systems (ERTS), 2016. Google Scholar
  9. S. Law and I. Bate. Achieving appropriate test coverage for reliable measurement-based timing analysis. In 28th Euromicro Conference on Real-Time Systems ECRTS, Proceedings, 2016. Google Scholar
  10. Alessandra Melani, Marko Bertogna, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, and Giorgio Buttazzo. Response-time analysis of conditional DAG tasks in multiprocessor systems. In 27th Euromicro Conference on Real-Time Systems (ECRTS), Lund, Sweden, July, 2015. Google Scholar
  11. J. Nowotsch, M. Paulitsch, D. Buhler, H. Theiling, S. Wegener, and M. Schmidt. Multi-core interference-sensitive wcet analysis leveraging runtime resource capacity enforcement. In 2014 26th Euromicro Conference on Real-Time Systems, pages 109-118, 2014. Google Scholar
  12. Wolfgang Puffitsch, Eric Noulard, and Claire Pagetti. Off-line mapping of multi-rate dependent task sets to many-core platforms. Real-Time Systems, 51(5):526-565, Sep 2015. Google Scholar
  13. L. Santinelli, F. Guet, and J. Morio. Revising measurement-based probabilistic timing analysis. In Real-Time and Embedded Technology and Applications Symposium (RTAS), 2017 IEEE, pages 199-208. IEEE, 2017. Google Scholar
  14. L. Santinelli, W. Puffitsch, A. Dumerat, F. Boniol, C. Pagetti, and V. Jegu. A grouping approach to task scheduling with functional and non-functional requirements. In Embedded real-time software and systems (ERTS), 2014. Google Scholar
  15. L. Tang, J. Mars, and M. L. Soffa. Contentiousness vs. sensitivity: improving contention aware runtime systems on multicore architectures. In Proceedings of the 1st International Workshop on Adaptive Self-Tuning Computing Systems for the Exaflop Era, pages 12-21. ACM, 2011. Google Scholar
  16. E. Tomita, A. Tanaka, and H. Takahashi. The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science, 363(1):28-42, 2006. Google Scholar
  17. G. Yao, R. Pellizzoni, S. Bak, H. Yun, and M. Caccamo. Global real-time memory-centric scheduling for multicore systems. IEEE Transactions on Computers, 65:2739-2751, 2016. 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 About DROPS Imprint Privacy Contact