457 search results - page 5 / 92 » Decay-Usage Scheduling in Multiprocessors |
120
click to vote
ECRTS
2002
IEEE
15 years 9 months ago
2002
IEEE
—Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s fo...
120
click to vote
OSDI
2000
ACM
2000
ACM
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors
15 years 5 months ago
In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric multiprocessors. We first show that the infeasibility of certain...
180
Voted
ICDCS
1996
IEEE
15 years 8 months ago
1996
IEEE
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
148
click to vote
OPODIS
2008
15 years 5 months ago
2008
The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented a...
149
click to vote
RTCSA
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...