Sciweavers

57 search results - page 6 / 12
» Static-Priority Periodic Scheduling on Multiprocessors
Sort
View
STOC
2002
ACM
123views Algorithms» more  STOC 2002»
14 years 7 months ago
Optimal rate-based scheduling on multiprocessors
The PD2 Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally scheduling periodic tasks on multiprocessors. In this paper, we prove that PD2 is als...
Anand Srinivasan, James H. Anderson
RTSS
2009
IEEE
14 years 2 months ago
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. Thi...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
JPDC
2010
181views more  JPDC 2010»
13 years 5 months ago
T-L plane-based real-time scheduling for homogeneous multiprocessors
We consider optimal real-time scheduling of periodic tasks on multiprocessors—i.e., satisfying all task deadlines, when the total utilization demand does not exceed the ion capa...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
ICPPW
2005
IEEE
14 years 1 months ago
The Partitioned Scheduling of Sporadic Real-Time Tasks on Multiprocessor Platforms
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...
Sanjoy K. Baruah, Nathan Fisher
RTS
2006
138views more  RTS 2006»
13 years 7 months ago
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
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...
Theodore P. Baker