Digitala Vetenskapliga Arkivet

Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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
The Safe and Effective Use of Optimistic Period Predictions
Washington Univ, St Louis, MO 14263 USA..
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Computer Systems.
Univ Bremen, Bremen, Germany..
La Sapienza, Rome, Italy..
Show others and affiliations
2024 (English)In: 2024 32ND INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS, RTNS 2024, Association for Computing Machinery (ACM), 2024, p. 197-206Conference paper, Published paper (Refereed)
Abstract [en]

Parameters characterizing safety critical systems are generally assigned very conservative values for reasons of safety assurance. Provisioning computing resources on the basis of such conservatively assigned parameter values can lead to system implementations that make inefficient use of platform resources during run time. We address the problem of achieving more efficient implementations of sporadic task systems where, in addition to a conservatively assigned value for the period parameter of each task, we also have a more optimistic (i.e., larger), but perhaps incorrect, prediction of this value. We devise an algorithm that executes the system more efficiently during runtime if the prediction is correct, without compromising safety if it turns out to be incorrect.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2024. p. 197-206
Keywords [en]
Algorithms using predictions, sporadic task systems, uniprocessor EDF schedulability analysis
National Category
Computer Sciences Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-555414DOI: 10.1145/3696355.3696356ISI: 001446181700017Scopus ID: 2-s2.0-85218340406ISBN: 979-8-4007-1724-6 (print)OAI: oai:DiVA.org:uu-555414DiVA, id: diva2:1955002
Conference
32nd International Conference on Real-Time Networks and Systems, NOV 06-08, 2024, Porto, PORTUGAL
Funder
Swedish Research Council, 2018-04446Swedish Research Council, 2023-04586Available from: 2025-04-28 Created: 2025-04-28 Last updated: 2025-04-28Bibliographically approved

Open Access in DiVA

fulltext(847 kB)13 downloads
File information
File name FULLTEXT01.pdfFile size 847 kBChecksum SHA-512
9dc41df6790871ad5ed22803e2599b40ed591621e96a844e7c73c15b84c4ff2d411aaa0a9e912067f9c21db9163280fca63c67a7316771866e7d20dde1145948
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Ekberg, Pontus
By organisation
Computer SystemsDivision of Computer Systems
Computer SciencesComputer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 13 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

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

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