157 search results - page 2 / 32 » The Case for Fair Multiprocessor Scheduling |
SOSP
1989
ACM
13 years 6 months ago
1989
ACM
Shared-memory multiprocessors are frequently used in a timesharing style with multiple parallel applications executing at the same time. In such an environment, where the machine ...
ECRTS
2002
IEEE
13 years 10 months ago
2002
IEEE
We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...
PPOPP
2009
ACM
14 years 5 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
RTCSA
2005
IEEE
13 years 10 months ago
2005
IEEE
We consider the problem of task reweighting in fair-scheduled multiprocessor systems wherein each task’s processor share is specified as a weight. When a task is reweighted, a ...
SIGMETRICS
2012
ACM
11 years 7 months ago
2012
ACM
Competition for shared memory resources on multiprocessors is the most dominant cause for slowing down applications and makes their performance varies unpredictably. It exacerbate...