Sciweavers

2 search results - page 1 / 1
» Multiple-Resource Periodic Scheduling Problem: how much fair...
Sort
View
RTSS
2003
IEEE
13 years 10 months ago
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...
Dakai Zhu, Daniel Mossé, Rami G. Melhem
TPDS
2008
175views more  TPDS 2008»
13 years 5 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...