Paper Info
Title
Schedulability Analysis for Real-Time P-FRP Tasks under Fixed Priority Scheduling
Abstract
This paper studies the schedulability of real-time tasks in the Priority-based Functional Reactive Programming (P-FRP) model under fixed priority scheduling, one of the influential scheduling policies. Since the abort-and-restart execution paradigm of the P-FRP model is different from that of the classic pre-emptive model, the schedulability analysis for P-FRP tasks under fixed priority scheduling differs widely. In P-FRP, for a synchronous n-task set under fixed priority scheduling, the least common multiple (LCM) of all n task periods is the typical length of a testing interval for an exact (necessary and sufficient) schedulability test. In this paper, we propose and prove an optimal simulation based exact schedulability test in the P-FRP model under fixed priority scheduling for a given priority order, covering scenarios from synchronous task release to asynchronous task release with the initial busy condition, and from implicit deadlines to constrained deadlines. The length of a testing interval for the exact test is the LCM of the first n-1 task periods and its optimality is proved.
Year
DOI
Venue
2015
10.1109/RTCSA.2015.28
Real-Time Computing Systems and Applications
Keywords
Field
DocType
real-time system, schedulability analysis, functional reactive programming (FRP), priority-based FRP, fixed priority scheduling, response time analysis, feasibility interval
Priority ceiling protocol,Fixed-priority pre-emptive scheduling,Computer science,Deadline-monotonic scheduling,Real-time computing,Priority inversion,Rate-monotonic scheduling,Priority inheritance,Earliest deadline first scheduling,Dynamic priority scheduling,Distributed computing
Conference
ISSN
Citations 
PageRank 
1533-2306
3
0.40
References 
Authors
36
3
Name
Order
Citations
PageRank
Yu Jiang1111.88
Albert M. K. Cheng230739.69
Xingliang Zou3173.68