liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Data Freshness and Overload Handling in Embedded Systems
Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory. Linköping University, The Institute of Technology.
2006 (English)In: 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2006, Los Alamitos, CA, USA: IEEE Computer Society, 2006, 173-182 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we consider data freshness and overload handling in embedded systems. The requirements on data management and overload handling are derived from an engine control software. Data items need to be up-to-date, and to achieve this data dependencies must be considered, i.e., updating a data item requires other data items are up-to-date. We also note that a correct result of a calculation can in some cases be calculated using a subset of the inputs. Hence, data dependencies can be divided into required and not required data items, e.g., only a subset of data items affecting the fuel calculation in an engine control needs to be calculated during a transient overload in order to reduce the number of calculations. Required data items must always be up-to-date, whereas not required data items can be stale. We describe an algorithm that dynamically determines which data items need to be updated taking workload, data freshness, and data relationships into consideration. Performance results show that the algorithm suppresses transient overloads better than $(m,k)$- and skip-over scheduling combined with established algorithms to update data items. The performance results are collected from an implementation of a real-time database on the real-time operating system $\mu$C/OS-II. To investigate whether the system is occasionally overloaded an offline analysis algorithm estimating period times of updates is presented.

Place, publisher, year, edition, pages
Los Alamitos, CA, USA: IEEE Computer Society, 2006. 173-182 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-35575DOI: 10.1109/RTCSA.2006.25ISI: 000240851900024Local ID: 27689ISBN: 0-7695-2676-4 (print)OAI: oai:DiVA.org:liu-35575DiVA: diva2:256423
Conference
12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications(RTCSA 2006), 16-18 August 2006, Sydney, Australia
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2012-11-16

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Gustafsson, ThomasHansson, Jörgen

Search in DiVA

By author/editor
Gustafsson, ThomasHansson, Jörgen
By organisation
RTSLAB - Real-Time Systems LaboratoryThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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