155 search results - page 2 / 31 » On Schedulability Bounds of Static Priority Schedulers |
106
click to vote
ECRTS
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract--Energy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic ...
FMSD
2007
14 years 11 months ago
2007
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
RTSS
2000
IEEE
15 years 4 months ago
2000
IEEE
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling ...
103
click to vote
DATE
2005
IEEE
15 years 5 months ago
2005
IEEE
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...
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...