License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.WCET.2013.97
URN: urn:nbn:de:0030-drops-41269
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4126/
Go to the corresponding OASIcs Volume Portal

Kosmidis, Leonidas ; Vardanega, Tullio ; Abella, Jaume ; Quiñones, Eduardo ; Cazorla, Francisco J.

Applying Measurement-Based Probabilistic Timing Analysis to Buffer Resources

pdf-format:
11.pdf (0.6 MB)

Abstract

The use of complex hardware makes it difficult for current timing analysis techniques to compute trustworthy and tight worst-case execution time (WCET) bounds. Those techniques require detailed knowledge of the internal operation and state of the platform, at both the software and hardware level. Obtaining that information for modern hardware platforms is increasingly difficult. Measurement-Based Probabilistic Timing Analysis (MBPTA) reduces the cost of acquiring the knowledge needed for computing trustworthy and tight WCET bounds. MBPTA based on Extreme Value Theory requires the execution time of processor instructions to be independent and identically distributed (i.i.d.), which can be achieved with some hardware support. Previous proposals show how those properties can be achieved for caches. This paper considers, for the first time, the implications on MBPTA of using buffer resources. Buffers in general, and first-come first-served (FCFS) buffers in particular, are of
paramount importance as the complexity of hardware increases, since they allow managing contention in those resources where multiple requests may be pending. We show how buffers can be used in the context of MBPTA and provide illustrative examples.

BibTeX - Entry

@InProceedings{kosmidis_et_al:OASIcs:2013:4126,
  author =	{Leonidas Kosmidis and Tullio Vardanega and Jaume Abella and Eduardo Qui{\~n}ones and Francisco J. Cazorla},
  title =	{{Applying Measurement-Based Probabilistic Timing Analysis to Buffer Resources}},
  booktitle =	{13th International Workshop on Worst-Case Execution Time Analysis},
  pages =	{97--108},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-54-5},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{30},
  editor =	{Claire Maiza},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4126},
  URN =		{urn:nbn:de:0030-drops-41269},
  doi =		{10.4230/OASIcs.WCET.2013.97},
  annote =	{Keywords: WCET, Buffer, Probabilistic Timing Analysis}
}

Keywords: WCET, Buffer, Probabilistic Timing Analysis
Collection: 13th International Workshop on Worst-Case Execution Time Analysis
Issue Date: 2013
Date of publication: 08.07.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI