39 search results - page 2 / 8 » Quasi-Static Scheduling for Multiprocessor Real-Time Systems... |
ECRTS
2009
IEEE
13 years 2 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
13 years 10 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...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
RTCSA
2009
IEEE
13 years 11 months ago
2009
IEEE
Soft real-time sporadic multiprocessor task systems are considered that include processing pipelines. Conditions are presented for guaranteeing bounded deadline tardiness in such ...