An efficient configuration methodology for time-division multiplexed single resources

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00229904" target="_blank" >RIV/68407700:21230/15:00229904 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/RTAS.2015.7108439" target="_blank" >http://dx.doi.org/10.1109/RTAS.2015.7108439</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/RTAS.2015.7108439" target="_blank" >10.1109/RTAS.2015.7108439</a>

Jazyk výsledku

angličtina

Název v původním jazyce

An efficient configuration methodology for time-division multiplexed single resources

Popis výsledku v původním jazyce

Complex contemporary systems contain multiple applications, some which have firm real-time requirements while others do not. These applications are deployed on multi-core platforms with shared resources, such as processors, interconnect, and memories. However, resource sharing causes contention between sharing applications that must be resolved by a resource arbiter. Time-Division Multiplexing (TDM) is a commonly used arbiter, but it is challenging to configure such that the bandwidth and latency requirements of the real-time resource clients are satisfied, while minimizing their total allocation to improve the performance of non-real-time clients. This work addresses this problem by presenting an efficient TDM configuration methodology. The five maincontributions are: 1) An analysis to derive a bandwidth and latency guarantee for a TDM schedule with arbitrary slot assignment, 2) A formulation of the TDM configuration problem and a proof that it is NP-hard, 3) An integer-linear progra

Název v anglickém jazyce

An efficient configuration methodology for time-division multiplexed single resources

Popis výsledku anglicky

Complex contemporary systems contain multiple applications, some which have firm real-time requirements while others do not. These applications are deployed on multi-core platforms with shared resources, such as processors, interconnect, and memories. However, resource sharing causes contention between sharing applications that must be resolved by a resource arbiter. Time-Division Multiplexing (TDM) is a commonly used arbiter, but it is challenging to configure such that the bandwidth and latency requirements of the real-time resource clients are satisfied, while minimizing their total allocation to improve the performance of non-real-time clients. This work addresses this problem by presenting an efficient TDM configuration methodology. The five maincontributions are: 1) An analysis to derive a bandwidth and latency guarantee for a TDM schedule with arbitrary slot assignment, 2) A formulation of the TDM configuration problem and a proof that it is NP-hard, 3) An integer-linear progra

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Real-Time and Embedded Technology and Applications Symposium

ISBN

978-1-4799-8603-3

ISSN

1545-3421

e-ISSN

—

Počet stran výsledku

11

Strana od-do

161-171

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Seattle, Washington

Datum konání akce

13. 4. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—