Userland Approximate Slack Stealer with Low Time Complexity

Abstract : The aim of our work is to provide a mechanism to deal with soft real-time aperiodic traffic on top of a fixed priority scheduler, without any kind of modification on it. We want to reduce as most as possible the time and implementation complexities of this mechanism. Moreover, the overhead of the framework has to be completely integrated in the feasibility analysis process. We propose a naive but low cost slack time estimation algorithm and discuss the issue of its utilization at the user level. We validate our work by extensive simulations and illustrate its utility by an implementation on top of the Real-Time Specification for Java (RTSJ).
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00620349
Contributor : Damien Masson <>
Submitted on : Friday, September 30, 2011 - 4:26:38 PM
Last modification on : Tuesday, February 18, 2020 - 10:28:38 AM
Long-term archiving on: Tuesday, November 13, 2012 - 2:57:01 PM

File

hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00620349, version 1

Citation

Damien Masson, Serge Midonnet. Userland Approximate Slack Stealer with Low Time Complexity. RTNS 2008, Oct 2008, Rennes, France, France. pp.29--38. ⟨hal-00620349⟩

Share

Metrics

Record views

262

Files downloads

241