15 search results - page 2 / 3 » Deadline Monotonic Scheduling on Uniform Multiprocessors |
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can b...
RTAS
2006
IEEE
14 years 1 months ago
2006
IEEE
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on...
RTS
2006
13 years 7 months ago
2006
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...
RTS
2011
12 years 10 months ago
2011
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances ma...