Predictable Two-Level Bus Arbitration for Heterogeneous Task Sets - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Predictable Two-Level Bus Arbitration for Heterogeneous Task Sets

Abstract

In a multicore processor, arbitrating the shared resources so as to ensure predictable latencies for hard real-time tasks is challenging. In [1], we have introduced a two-level bus arbitration scheme that fits the needs of heterogeneous task sets, when some tasks have a higher demand to memory than others. In this paper, we show how this scheme can be used to optimise the overall utilisation of the cores while enforcing the schedulability of the whole task set. Our approach both configures the bus arbiter and maps the tasks onto the cores. Experimental results show that it reduces the global utilisation of the cores compared to the traditional round-robin scheme.
Fichier principal
Vignette du fichier
bourgade_12337.pdf (359.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04084581 , version 1 (28-04-2023)

Identifiers

Cite

Roman Bourgade, Christine Rochange, Pascal Sainrat. Predictable Two-Level Bus Arbitration for Heterogeneous Task Sets. 26th International Conference on Architecture of Computing Systems (ARCS 2013), Feb 2013, Prague, Czech Republic. pp.341-351, ⟨10.1007/978-3-642-36424-2_29⟩. ⟨hal-04084581⟩
28 View
19 Download

Altmetric

Share

Gmail Facebook X LinkedIn More