Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Task Period Selection and Schedulability in Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Mode Change Protocols for Real-Time Systems: A Survey and a New Proposal
Real-Time Systems
Minimising Task Migration and Priority Changes in Mode Transitions
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Two Protocols for Scheduling Multi-mode Real-Time Systems upon Identical Multiprocessor Platforms
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Improving Real-Time Feasibility Analysis for Use in Linear Optimization Methods
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Global-EDF Scheduling of Multimode Real-Time Systems Considering Mode Independent Tasks
ECRTS '11 Proceedings of the 2011 23rd Euromicro Conference on Real-Time Systems
An integrated framework for multiprocessor, multimoded real-time applications
Ada-Europe'12 Proceedings of the 17th Ada-Europe international conference on Reliable Software Technologies
| Hi-index | 0.00 |
We consider the partitioned scheduling problem of multi-mode real-time systems upon identical multiprocessor platforms. During the execution of a multimode system, the system can change from one mode to another such that the current task set is replaced with a new one. In this paper, we consider a synchronous transition protocol in order to take into account mode-independent tasks, i.e., tasks of which the execution pattern must not be jeopardized by the mode changes. We propose two methods for handling mode changes in partitioned scheduling. The first approach is an offline/optimal method (i.e., Mixed Integer Linear Programming)and computes a static allocation of tasks schedulable and respecting both tasks and transition deadlines (if any). The second approach is based on an online First Fit allocation and a sufficient schedulability condition in order to satisfy the timing constraints.