2010/04/21 by Patrick Meumeu Yomsi, Yomsi, Patrick Meumeu, Vincent Nelis +3
Computer Science · #FOS: Computer and information sciences #Operating Systems (cs.OS) #cs.OS
paper · pdf · doi:10.48550/arxiv.1004.3687
arxiv created 2010/04/21 · arxiv updated 2010/04/22
In this paper, we address the scheduling problem of multi-mode real-time systems upon uniform multiprocessor platforms. We propose two transition protocols, specified together with their schedulability test, and provide the reader with two distinct upper bounds for the length of the transient phases during mode transitions, respectively for the cases where jobs priorities are known and unknown beforehand.