2026-07-20T05:09:22Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:676 2024-03-06T10:28:23Z ddc:004 open_access

A Framework for the Busy Time Calculation of Multiple Correlated Events Schliecker, Simon Ivers, Matthias Staschulat, Jan Ernst, Rolf Response time analysis multiple memory accesses multiprocessor hard real-time busy time Many approaches to determine the response time of a task have difficulty to model tasks with multiple memory or coprocessor accesses with variable access times during the execution. As the request times highly depend on system setup and state, they can not be trivially bounded. If they are bounded by a constant value, large discrepancies between average and worst case make the focus on single worst cases vulnerable to overestimation. We present a novel approach to include remote busy time in the execution time analysis of tasks. We determine the time for multiple requests by a task efficiently and and far less conservative than previous approaches. These requests may be disturbed by other events in the system. We show how to integrate such a multiple event busy time analysis to take into account behavior of tasks that voluntarily suspend themselves and require multiple data from remote parts of the system. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Simon Schliecker and Matthias Ivers and Jan Staschulat and Rolf Ernst 2006 Is Part Of OASIcs, Volume 4, 6th International Workshop on Worst-Case Execution Time Analysis (WCET'06) (2006) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.WCET.2006.676 urn:nbn:de:0030-drops-6767 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2006.676 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode