New Response Time Bounds for Fixed Priority Multiprocessor Scheduling

Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. This paper contains two contributions. First, to improve the analysis precision, we apply Baruah's window analysis fram...

Full description

Saved in:
Bibliographic Details
Published in:2009 30th IEEE Real-Time Systems Symposium pp. 387 - 397
Main Authors: Nan Guan, Stigge, M., Wang Yi, Ge Yu
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2009
Subjects:
Computer science
Computer Science with specialization in Embedded Systems
Datavetenskap
Datavetenskap med inriktning mot inbyggda system
Delay
fixed priority scheduling
Information analysis
Information technology
Informationsteknik
Multicore processing
Multiprocessing systems
multiprocessor
Performance analysis
Processor scheduling
Real time systems
real-time scheduling
response time analysis
TECHNOLOGY
TEKNIKVETENSKAP
Upper bound
ISBN:9780769538754, 0769538754
ISSN:1052-8725
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. This paper contains two contributions. First, to improve the analysis precision, we apply Baruah's window analysis framework to response time analysis for poradic tasks on multiprocessor systems where the deadlines of tasks are within their periods. The crucial observation is that for global fixed priority scheduling, a response time bound of each task can be efficiently estimated by fixed-point computation without enumerating all the busy window sizes as in for schedulability analysis. The technique is proven to dominate theoretically state-of-the-art techniques for response time analysis for multiprocessor systems. Our experiments also show that the technique results in significant performance improvement compared with several existing techniques for multiprocessor schedulability analysis. As the second main contribution of this paper, we extend the proposed technique to task systems with arbitrary deadlines, allowing tasks to have deadlines beyond the end of their periods. This is a non-trivial extension even for single-processor systems. To our best knowledge, this is the first work of response time analysis for multiprocessor systems in this setting, which involves sophisticated techniques for the characterization and computation of response time bounds.
ISBN:9780769538754
0769538754
ISSN:1052-8725
DOI:10.1109/RTSS.2009.11