40 search results - page 2 / 8 » Locking in Pfair-Scheduled Multiprocessor Systems |
RTSS
2000
IEEE
15 years 2 months ago
2000
IEEE
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling ...
108
click to vote
ECRTS
2009
IEEE
14 years 7 months ago
2009
IEEE
Reader preference, writer preference, and task-fair readerwriter locks are shown to cause undue blocking in multiprocessor real-time systems. A new phase-fair reader-writer lock i...
ECRTS
2005
IEEE
15 years 3 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
14 years 9 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 ...
ECRTS
2003
IEEE
15 years 2 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 ...