Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems
Authors:
- Sanjoy BaruahSBSanjoy Baruah
- Nathan FisherNFNathan Fisher
- 1 April 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4 (15453421) , 248-257
Abstract
A hybrid scheduling algorithm is proposed, which integrates features of the fixed priority (FP) and earliest deadline first (EDF) scheduling policies. It is shown that this hybrid scheduling algorithm is a generalization of both FP and EDF, and tends to retain most of the desirable properties and features of both individual policies. An exact (i.e., necessary and sufficient) test is derived for the preemptive uniprocessor scheduling of resource- sharing sporadic task systems using this hybrid scheduling algorithm, with access to shared resources arbitrated using the stack resource policy (SRP).Keywords
This publication has 16 references indexed in Scilit:
- Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revisedReal-Time Systems, 2007
- Getting More Flexible Scheduling in the RTSJ2006
- Feasibility Analysis of Real-Time Periodic Tasks with OffsetsReal-Time Systems, 2005
- Response time analysis for tasks scheduled under EDF within fixed priorities2004
- The rate monotonic scheduling algorithm: exact characterization and average case behavior2003
- CALCULATING CONTROLLER AREA NETWORK (CAN) MESSAGE RESPONSE TIMES1995
- Feasibility problems for recurring tasks on one processorTheoretical Computer Science, 1993
- Stack-based scheduling of realtime processesReal-Time Systems, 1991
- Finding Response Times in a Real-Time SystemThe Computer Journal, 1986
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973