Two protocols without periodicity for the global and preemptive scheduling problem of multi-mode real-time systems upon multiprocessor Platforms

Nélis, Vincent; Goossens, Joel; Andersson, Björn

http://hdl.handle.net/10400.22/3879

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
REL_VincentNelis_2009_CISTER.pdf		419.56 KB	Adobe PDF	Download

Send Feedback

Authors

Nélis, Vincent

Goossens, Joel

Andersson, Björn

Abstract(s)

We consider the problem of scheduling a multi-mode real-time system 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.