In singlecore processors timing analysis involves a step of Execution Time Analysis at task level that yields an Execution Time Bound (ETB) for the task, and one of schedulability analysis, where the scheduling attributes of the individual tasks, including the ETB, are studied from a system level perspective. Response Time Analysis serves as a compositional bridge between those two steps by accounting for the contention that arises from resource sharing. In this paper, we show that the advent of multicore processors challenges the viability of this two-step approach. This stems from the fact that inter-task interference effects in a multicore are much more intricate in nature than what can be compositionally captured in response time analysis by widening the tasks' ETB with the time intervals during which tasks cannot progress while actually holding the CPU; we also show how contention in the access to hardware shared resources creates a circular dependence between the task ETB and its actual scheduling at run time. Finally, we show how various degrees of time composability can help breaking this knot.

Introduction to partial time composability for COTS multicores

Vardanega T.
Supervision
;
2015

Abstract

In singlecore processors timing analysis involves a step of Execution Time Analysis at task level that yields an Execution Time Bound (ETB) for the task, and one of schedulability analysis, where the scheduling attributes of the individual tasks, including the ETB, are studied from a system level perspective. Response Time Analysis serves as a compositional bridge between those two steps by accounting for the contention that arises from resource sharing. In this paper, we show that the advent of multicore processors challenges the viability of this two-step approach. This stems from the fact that inter-task interference effects in a multicore are much more intricate in nature than what can be compositionally captured in response time analysis by widening the tasks' ETB with the time intervals during which tasks cannot progress while actually holding the CPU; we also show how contention in the access to hardware shared resources creates a circular dependence between the task ETB and its actual scheduling at run time. Finally, we show how various degrees of time composability can help breaking this knot.
2015
Proceedings of the ACM Symposium on Applied Computing
30th Annual ACM Symposium on Applied Computing, SAC 2015
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/3329248
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 1
  • OpenAlex ND
social impact