Sciweavers

80 search results - page 10 / 16
» WCET Analysis for Preemptive Scheduling
Sort
View
CP
2004
Springer
14 years 26 days ago
Decomposition and Learning for a Hard Real Time Task Allocation Problem
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Ma...
RTS
2006
138views more  RTS 2006»
13 years 7 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
TII
2008
169views more  TII 2008»
13 years 7 months ago
Fine-Tuning MAC-Level Protocols for Optimized Real-Time QoS
In distributed real-time systems, meeting the real-time constraints is mandatory but the satisfaction of other application-dependent criteria is most generally required as well. I...
Mathieu Grenier, Nicolas Navet
POPL
2011
ACM
12 years 10 months 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...
RTSS
2005
IEEE
14 years 1 months ago
ParaScale: Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
Sibin Mohan, Frank Mueller, William Hawkins, Micha...