Paper Info
Title
Minimal Schedulability Testing Interval for Real-Time Periodic Tasks with Arbitrary Release Offsets
Abstract
The concept of feasibility (or schedulability) interval plays a very important role in the schedulability analysis in real-time systems. Existing results on the schedulability testing interval of real-time task sets under fixed priority scheduling with arbitrary release offsets (or phases) have limitations for certain scenarios in constructing a schedule for testing the schedulability of a given task set. In this paper, we propose a transforming method for deriving minimal schedulability testing interval of real-time n-task sets with arbitrary release offsets under fixed priority scheduling in both the classical pre-emptive model and the Priority-based Functional Reactive Programming (P-FRP) model on uniprocessor. The complexity of our transforming method is O(n), and the validity is also proved by theoretical analysis.
Year
DOI
Venue
2014
10.1109/HPCC.2014.93
HPCC/CSS/ICESS
Keywords
Field
DocType
classical preemptive model,processor scheduling,real-time n-task sets,uniprocessor,task analysis,priority-based functional reactive programming (p-frp) model,fixed priority scheduling,feasibility interval,real-time system,priority-based functional reactive programming,computational complexity,arbitrary release offsets,functional programming,p-frp model,transforming method,schedulability analysis,minimal schedulability testing interval,real-time systems,schedules,programming,silicon,real time systems,testing,tin
Functional reactive programming,Uniprocessor system,Computer science,Parallel computing,Real-time computing,Real-time operating system,Schedule,Priority scheduling,Periodic graph (geometry),Distributed computing
Conference
Citations 
PageRank 
References 
2
0.36
9
Authors
4
Name
Order
Citations
PageRank
Yu Jiang1111.88
Qiang Zhou251.11
Xingliang Zou3173.68
Albert M. K. Cheng430739.69