Sciweavers

457 search results - page 5 / 92
» Decay-Usage Scheduling in Multiprocessors
Sort
View
ECRTS
2002
IEEE
14 years 13 days ago
Robustness results concerning EDF scheduling upon uniform multiprocessors
—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...
Sanjoy K. Baruah
OSDI
2000
ACM
13 years 8 months ago
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors
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...
Abhishek Chandra, Micah Adler, Pawan Goyal, Prasha...
ICDCS
1996
IEEE
13 years 11 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
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, ...
Babak Hamidzadeh, David J. Lilja
OPODIS
2008
13 years 9 months ago
Deadline Monotonic Scheduling on Uniform Multiprocessors
The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented a...
Sanjoy K. Baruah, Joël Goossens
RTCSA
2007
IEEE
14 years 1 months ago
Real-Time Scheduling with Task Splitting on Multiprocessors
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...
Shinpei Kato, Nobuyuki Yamasaki