Userland Approximate Slack Stealer with Low Time Complexity - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Userland Approximate Slack Stealer with Low Time Complexity

Damien Masson
Serge Midonnet

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).
Fichier principal
Vignette du fichier
hal.pdf (164.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00620349 , version 1 (30-09-2011)

Identifiers

  • HAL Id : hal-00620349 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More