Sciweavers

CEE
2007
107views more  CEE 2007»
14 years 17 days ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl
RTCSA
1999
IEEE
14 years 4 months ago
Scheduling Fixed-Priority Tasks with Preemption Threshold
While it is widely believed that preemptability is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as co...
Yun Wang, Manas Saksena
RTCSA
2008
IEEE
14 years 7 months ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
Omar Kermia, Yves Sorel