17 search results - page 3 / 4 » Group-Based Pfair Scheduling |
RTSS
2003
IEEE
13 years 11 months ago
2003
IEEE
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
ECRTS
2003
IEEE
13 years 11 months ago
2003
IEEE
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...
RTAS
2008
IEEE
14 years 4 days ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
ECRTS
2005
IEEE
13 years 11 months ago
2005
IEEE
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
RTS
2008
13 years 5 months ago
2008
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...