DocumentCode
255058
Title
Improving the response time analysis of global fixed-priority multiprocessor scheduling
Author
Youcheng Sun ; Lipari, Giuseppe ; Nan Guan ; Wang Yi
Author_Institution
Scuola Superiore Sant´Anna, Pisa, Italy
fYear
2014
fDate
20-22 Aug. 2014
Firstpage
1
Lastpage
9
Abstract
In this paper we address the problem of schedulability analysis for a set of sporadic tasks with arbitrary deadlines running on a multiprocessor system with global fixed-priority preemptive scheduling. We prove the existence of a class of critical instants for releasing a task, one of which results in the worst-case response time of that task. Then, we propose a new analysis that improves over current state-of-the-art Response Time Analysis (RTA) by reducing its pessimism. We also observe that, in the case of unconstrained deadlines, the current RTA may underestimate the carry-in workload, and we propose a new formulation that corrects the problem. Finally, we evaluate the performance improvement of our new response time analysis method by empirical experiments with randomly generated task sets. Experimental results show that our new analysis method can successfully accept a considerable amount of task sets that have to be treated as unschedulable by existing methods.
Keywords
multiprocessing systems; processor scheduling; RTA; arbitrary deadlines; carry-in workload; global fixed-priority multiprocessor scheduling; global fixed-priority preemptive scheduling; multiprocessor system; randomly generated task sets; response time analysis; schedulability analysis; sporadic tasks; unconstrained deadlines; worst-case response time; Indexes; Interference; Processor scheduling; Real-time systems; Schedules; Time factors; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Embedded and Real-Time Computing Systems and Applications (RTCSA), 2014 IEEE 20th International Conference on
Conference_Location
Chongqing
Type
conf
DOI
10.1109/RTCSA.2014.6910543
Filename
6910543
Link To Document