Sciweavers

192 search results - page 3 / 39
» Preemptive Scheduling with Rejection
Sort
View
RTS
1998
104views more  RTS 1998»
13 years 4 months ago
Real-Time Schedulability Tests for Preemptive Multitasking
When developing multitasking real-time systems, schedulability tests are used to formally prove that a given task set will meet its deadlines. A wide range of such tests have appe...
Colin J. Fidge
CODES
2007
IEEE
13 years 11 months ago
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
Razvan Racu, Li Li, Rafik Henia, Arne Hamann, Rolf...
RTS
2011
123views more  RTS 2011»
12 years 11 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
BROADNETS
2006
IEEE
13 years 10 months ago
Minimum Rejection Scheduling in All-Photonic Networks
Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to per...
Nahid Saberi, Mark Coates
RTCSA
2009
IEEE
13 years 11 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna