Sciweavers

157 search results - page 5 / 32
» The Case for Fair Multiprocessor Scheduling
Sort
View
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
14 years 2 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
COCOON
2007
Springer
14 years 1 months ago
Online Interval Scheduling: Randomized and Multiprocessor Cases
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zhen...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 1 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel
VTC
2006
IEEE
117views Communications» more  VTC 2006»
14 years 1 months ago
Optimum Fair Bandwidth Allocation Scheme for IEEE 802.16 Mesh Mode with Directional Antenna
— The IEEE 802.16 standard is providing support for Mesh networks of which two scheduling mechanisms (i.e., centralized scheduling and distributed scheduling) are proposed. Centr...
Yanbin Lu, Guoqing Zhang
ECRTS
2006
IEEE
14 years 1 months ago
Task Reweighting under Global Scheduling on Multiprocessors
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...
Aaron Block, James H. Anderson, UmaMaheswari C. De...