Sciweavers

287 search results - page 34 / 58
» Test of preemptive real-time systems
Sort
View
POPL
2011
ACM
14 years 15 days ago
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling pr...
Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Pe...
RTS
2006
138views more  RTS 2006»
14 years 9 months ago
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
A new feasibility test for preemptive scheduling of periodic or sporadic real-time tasks on a single-queue m-server system allows for arbitrary fixed task priorities and arbitrary...
Theodore P. Baker
RTAS
2008
IEEE
15 years 4 months ago
Equivalence between Schedule Representations: Theory and Applications
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
Matthieu Lemerre, Vincent David, Christophe Aussag...
IESS
2007
Springer
110views Hardware» more  IESS 2007»
15 years 3 months ago
Run-Time efficient Feasibility Analysis of Uni-Processor Systems with Static Priorities
: The performance of feasibility tests is crucial in many applications. When using feasibility tests online only a limited amount of analysis time is available. Run-time efficiency...
Karsten Albers, Frank Bodmann, Frank Slomka
RTSS
2009
IEEE
15 years 4 months ago
Gang EDF Scheduling of Parallel Task Systems
The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called Gang EDF, which applies the Earliest Deadline First (EDF) policy ...
Shinpei Kato, Yutaka Ishikawa