Dynamic Command Scheduling for Real-Time Memory Controllers

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00221846" target="_blank" >RIV/68407700:21230/14:00221846 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Dynamic Command Scheduling for Real-Time Memory Controllers

Popis výsledku v původním jazyce

Memory controller design is challenging as realtime embedded systems feature an increasing diversity of realtime and non-real-time applications with variable transaction sizes. To satisfy the requirements of the applications, tight bounds on the worst-case execution time (WCET) of memory transactions must be provided to real-time applications, while the lowest possible average execution time must be given to the rest. Existing real-time memory controllers cannot efficiently achieve this goal as they either bound the WCET by sacrificing the average execution time, or are not scalable to directly support variable transaction sizes, or both. In this paper, we propose to use dynamic command scheduling, which is capable of efficiently dealing with transactions with variable sizes. The three main contributions of this paper are: 1) a back-end architecture for a real-time memory controller with a dynamic command scheduling algorithm, 2) a formalization of the timings of the memory transaction

Název v anglickém jazyce

Dynamic Command Scheduling for Real-Time Memory Controllers

Popis výsledku anglicky

Memory controller design is challenging as realtime embedded systems feature an increasing diversity of realtime and non-real-time applications with variable transaction sizes. To satisfy the requirements of the applications, tight bounds on the worst-case execution time (WCET) of memory transactions must be provided to real-time applications, while the lowest possible average execution time must be given to the rest. Existing real-time memory controllers cannot efficiently achieve this goal as they either bound the WCET by sacrificing the average execution time, or are not scalable to directly support variable transaction sizes, or both. In this paper, we propose to use dynamic command scheduling, which is capable of efficiently dealing with transactions with variable sizes. The three main contributions of this paper are: 1) a back-end architecture for a real-time memory controller with a dynamic command scheduling algorithm, 2) a formalization of the timings of the memory transaction

Druh

D - Stať ve sborníku

CEP obor

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

OECD FORD obor

—

Projekt

<a href="/cs/project/EE2.3.30.0034" target="_blank" >EE2.3.30.0034: Podpora zkvalitnění týmů výzkumu a vývoje a rozvoj intersektorální mobility na ČVUT v Praze</a><br>

Návaznosti

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

Rok uplatnění

2014

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

Proceedings of the 26th Euromicro Conference on Real-Time Systems (ECRTS)

ISBN

978-1-4799-5798-9

ISSN

1068-3070

e-ISSN

—

Počet stran výsledku

12

Strana od-do

3-14

Název nakladatele

Euromicro

Místo vydání

Sangt Augustin

Místo konání akce

Madrid

Datum konání akce

8. 7. 2014

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

WRD - Celosvětová akce

Kód UT WoS článku

000349236400003