Sciweavers

50 search results - page 2 / 10
» Improved response time analysis of tasks scheduled under pre...
Sort
View
RTS
2011
123views more  RTS 2011»
13 years 4 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
DATE
2005
IEEE
169views Hardware» more  DATE 2005»
14 years 3 months ago
Context-Aware Scheduling Analysis of Distributed Systems with Tree-Shaped Task-Dependencies
In this paper we present a new technique which exploits timing-correlation between tasks for scheduling analysis in multiprocessor and distributed systems with tree-shaped task-de...
Rafik Henia, Rolf Ernst
RTSS
2005
IEEE
14 years 3 months ago
Hierarchical Fixed Priority Pre-Emptive Scheduling
This paper focuses on the hierarchical scheduling of systems where a number of separate applications reside on a single processor. It addresses the particular case where fixed pri...
Robert I. Davis, Alan Burns
RTCSA
2008
IEEE
14 years 4 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
ICPADS
2007
IEEE
14 years 4 months ago
On the relative value of local scheduling versus routing in parallel server systems
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
Rong Wu, Douglas G. Down