DocumentCode :
592124
Title :
Extending Task-level to Job-level Fixed Priority Assignment and Schedulability Analysis Using Pseudo-deadlines
Author :
Hoon Sung Chwa ; Back, H. ; Sanjian Chen ; Jinkyu Lee ; Easwaran, Arvind ; Insik Shin ; Insup Lee
Author_Institution :
Dept. of Comput. Sci., KAIST, Daejeon, South Korea
fYear :
2012
fDate :
4-7 Dec. 2012
Firstpage :
51
Lastpage :
62
Abstract :
In global real-time multiprocessor scheduling, a recent analysis technique for Task-level Fixed-Priority (TFP) scheduling has been shown to outperform many of the analyses for Job-level Fixed-Priority (JFP) scheduling on average. Since JFP is a generalization of TFP scheduling, and the TFP analysis technique itself has been adapted from an earlier JFP analysis, this result is counter-intuitive and in our opinion highlights the lack of good JFP scheduling techniques. Towards generalizing the superior TFP analysis to JFP scheduling, we propose the Smallest Pseudo-Deadline First (SPDF) JFP scheduling algorithm. SPDF uses a simple task-level parameter called pseudo-deadline to prioritize jobs, and hence can behave as a TFP or JFP scheduler depending on the values of the pseudodeadlines. This natural transition from TFP to JFP scheduling has enabled us to incorporate the superior TFP analysis technique in an SPDF schedulability test. We also present a pseudo-deadline assignment algorithm for SPDF scheduling that extends the well-known Optimal Priority Assignment (OPA) algorithm for TFP scheduling. We show that our algorithm is optimal for the derived schedulability test, and also present a heuristic to overcome the computational complexity issue of the optimal algorithm. Our simulation results show that the SPDF algorithm with the new analysis significantly outperforms state-of-the-art TFP and JFP analysis.
Keywords :
computational complexity; multiprocessing systems; processor scheduling; OPA algorithm; SPDF schedulability test; TFP scheduling; computational complexity; job prioritization; job-level fixed priority assignment; optimal priority assignment algorithm; real-time multiprocessor scheduling; schedulability analysis; smallest pseudodeadline first JFP scheduling algorithm; task-level fixed priority assignment; task-level parameter; Algorithm design and analysis; Interference; Lead; Schedules; Scheduling; Scheduling algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Real-Time Systems Symposium (RTSS), 2012 IEEE 33rd
Conference_Location :
San Jan
ISSN :
1052-8725
Print_ISBN :
978-1-4673-3098-5
Type :
conf
DOI :
10.1109/RTSS.2012.58
Filename :
6424790
Link To Document :
بازگشت