2013/06/06 by Joël Goossens, Goossens, Joël, Pascal Richard +1
Computer Science · #FOS: Computer and information sciences #Interconnection Networks and Systems #Operating Systems (cs.OS) #Petri Nets in System Modeling #Real-Time Systems Scheduling #cs.OS
paper · pdf · doi:10.48550/arxiv.1306.1316
arxiv created 2013/06/06 · openalex publication_date 2013/06/06 · arxiv updated 2013/06/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the partitioned scheduling problem of multimode 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 method is offline/optimal and computes a static allocation of tasks schedulable and respecting both tasks and transition deadlines (if any). The second approach is subject to a sufficient condition in order to ensure online First Fit based allocation to satisfy the timing constraints.