Recent technological advances have led to an increasing gap between memory and processor performance, since memory bandwidth is progressing at a much slower pace than processor bandwidth. Pre-fetching techniques are traditionally used to bridge this gap and achieve high processor utilization while tolerating high memory latencies. Following this trend, new computational models have been proposed to split task execution in two consecutive phases: a memory phase in which the required instructions and data are pre-fetched to local memory (M-phase), and an execution phase in which the task is executed with no memory contention (C-phase). Decoupling memory and execution phases not only simplifies the timing analysis, but also allows a more efficient (and predictable) pipelining of memory and execution phases through proper co-scheduling algorithms. This paper takes a further step towards the design of smart co-scheduling algorithms for sporadic real-time tasks complying with the memory-computation (M/C) model, by proposing a theoretical framework aimed at tightly characterizing the schedulability improvement obtainable with the adopted M/C task model on single-core systems. In particular, a critical instant is identified for M/C tasks scheduled with fixed priority and an exact response time analysis with pseudo-polynomial complexity is provided. Then, we investigate the problem of priority assignment for M/C tasks, showing that a necessary condition to achieve optimality is to allow different priorities for the two phases. Our experiments show that the proposed techniques provide a significant schedulability improvement with respect to classic execution models, placing an important building block towards the design of more efficient partitioned multi-core systems.

Exact Response Time Analysis for Fixed Priority Memory-Processor Co-scheduling / Melani, Alessandra; Bertogna, Marko; Davis, Robert; Bonifaci, Vincenzo; Marchetti Spaccamela, Alberto; Buttazzo, Giorgio. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - 66:4(2017), pp. 631-646. [10.1109/TC.2016.2614819]

Exact Response Time Analysis for Fixed Priority Memory-Processor Co-scheduling

BERTOGNA, Marko;
2017

Abstract

Recent technological advances have led to an increasing gap between memory and processor performance, since memory bandwidth is progressing at a much slower pace than processor bandwidth. Pre-fetching techniques are traditionally used to bridge this gap and achieve high processor utilization while tolerating high memory latencies. Following this trend, new computational models have been proposed to split task execution in two consecutive phases: a memory phase in which the required instructions and data are pre-fetched to local memory (M-phase), and an execution phase in which the task is executed with no memory contention (C-phase). Decoupling memory and execution phases not only simplifies the timing analysis, but also allows a more efficient (and predictable) pipelining of memory and execution phases through proper co-scheduling algorithms. This paper takes a further step towards the design of smart co-scheduling algorithms for sporadic real-time tasks complying with the memory-computation (M/C) model, by proposing a theoretical framework aimed at tightly characterizing the schedulability improvement obtainable with the adopted M/C task model on single-core systems. In particular, a critical instant is identified for M/C tasks scheduled with fixed priority and an exact response time analysis with pseudo-polynomial complexity is provided. Then, we investigate the problem of priority assignment for M/C tasks, showing that a necessary condition to achieve optimality is to allow different priorities for the two phases. Our experiments show that the proposed techniques provide a significant schedulability improvement with respect to classic execution models, placing an important building block towards the design of more efficient partitioned multi-core systems.
2017
66
4
631
646
Exact Response Time Analysis for Fixed Priority Memory-Processor Co-scheduling / Melani, Alessandra; Bertogna, Marko; Davis, Robert; Bonifaci, Vincenzo; Marchetti Spaccamela, Alberto; Buttazzo, Giorgio. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - 66:4(2017), pp. 631-646. [10.1109/TC.2016.2614819]
Melani, Alessandra; Bertogna, Marko; Davis, Robert; Bonifaci, Vincenzo; Marchetti Spaccamela, Alberto; Buttazzo, Giorgio
File in questo prodotto:
File Dimensione Formato  
TC16-2.pdf

Open access

Tipologia: Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione 958.67 kB
Formato Adobe PDF
958.67 kB Adobe PDF Visualizza/Apri
Exact_Response_Time_Analysis_for_Fixed_Priority_Memory-Processor_Co-Scheduling.pdf

Accesso riservato

Tipologia: Versione pubblicata dall'editore
Dimensione 883.74 kB
Formato Adobe PDF
883.74 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1118772
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 7
social impact