Two Protocols Without Periodicity for the Global and Preemptive Scheduling Problem of Multi-Mode Real-Time Systems upon Multiprocessor Platforms
Ref: HURRAY-TR-090501 Publication Date: 1 to 3, Jul, 2009
Two Protocols Without Periodicity for the Global and Preemptive Scheduling Problem of Multi-Mode Real-Time Systems upon Multiprocessor Platforms
Ref: HURRAY-TR-090501 Publication Date: 1 to 3, Jul, 2009Abstract:
We consider the global and
preemptive scheduling problem of multi-mode real-time
systems upon identical multiprocessor platforms.
Since it is a multi-mode system, the system can change from
one mode to another such that the current task set is replaced
with a new task set. Ensuring that deadlines are met
requires not only that a schedulability test is performed on
tasks in each mode but also that (i) a protocol for transitioning
from one mode to another is specified and (ii) a schedulability
test for each transition is performed. We propose
two protocols which ensure that all the expected requirements
are met during every transition between every pair of
operating modes of the system. Moreover, we prove the correctness
of our proposed algorithms by extending the theory
about the makespan determination problem.
Vincent Nélis
Joel Goossens
Björn AnderssonDocument:
View
DownloadNotes: Published with the title "Two Protocols for Scheduling Multi-mode Real-Time Systems upon Identical Multiprocessor Platforms"
Record Date: 4, May, 2009