uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Modeling and verification of dynamic command scheduling for real-time memory controllers
Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands.
CISTER INESC TEC, ISEP, Oporto, Portugal.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Embedded Systems)
Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands.
2016 (English)In: 2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), IEEE Computer Society, 2016Conference paper, Published paper (Refereed)
Abstract [en]

In modern multi-core systems with multiple real-time (RT) applications, memory traffic accessing the shared SDRAM is increasingly diverse, e.g., transactions have variable sizes. RT memory controllers with dynamic command scheduling can efficiently address the diversity by issuing appropriate commands subject to the SDRAM timing constraints. However, the scheduling dependencies between commands make it challenging to derive tight bounds for the worst-case response time (WCRT) and the worst-case bandwidth (WCBW) of a memory controller. Existing modeling and analysis techniques either do not provide tight WCRT and WCBW bounds for diverse memory traffic with variable transaction sizes or are difficult to adapt to different RT memory controllers. This paper models a memory controller using Timed Automata (TA), where model checking is applied for analysis. Our TA model is modular and accurately captures the behavior of a RT memory controller with dynamic command scheduling. We obtain WCRT and WCBW bounds, which are validated by simulating the worst-case transaction traces obtained by model checking with a cycle-accurate model of the memory controller. Our method outperforms three state-of-the-art analysis techniques. We reduce WCRT bound by up to 20%, while the average improvement is 7.7%, and increase the WCBW bound by up to 25% with an average improvement of 13.6%. In addition, our modeling is generic enough to extend to memory controllers with different mechanisms.

Place, publisher, year, edition, pages
IEEE Computer Society, 2016.
Series
IEEE Real-Time and Embedded Technology and Applications Symposium, ISSN 1545-3421
National Category
Computer Engineering
Research subject
Computer Science with specialization in Real Time Systems
Identifiers
URN: urn:nbn:se:uu:diva-283426ISI: 000381748500022ISBN: 9781467386418 (print)OAI: oai:DiVA.org:uu-283426DiVA: diva2:919069
Conference
22nd IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) 2016, April 11–14, Vienna, Austria
Available from: 2016-04-12 Created: 2016-04-12 Last updated: 2017-02-02Bibliographically approved

Open Access in DiVA

No full text

Authority records BETA

Lampka, Kai

Search in DiVA

By author/editor
Lampka, Kai
By organisation
Computer Systems
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 348 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf