Specifying real-time properties with metric temporal logic
Real-Time Systems
A practitioner's handbook for real-time analysis
A practitioner's handbook for real-time analysis
Preemptive priority-based scheduling: an appropriate engineering approach
Advances in real-time systems
Bringing real-time scheduling theory and practice closer for multimedia computing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IRTAW '97 Proceedings of the eighth international workshop on Real-Time Ada
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Specification and Compositional Verification of Real-Time Systems
Specification and Compositional Verification of Real-Time Systems
Process Algebra with Timing
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Limited Preemptible Scheduling to Embrace Cache Memory in Real-Time Systems
LCTES '98 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Scheduling Fixed-Priority Tasks with Preemption Threshold
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Use of preferred preemption points in cache-based real-time systems
IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
The Limited-Preemption Uniprocessor Scheduling of Sporadic Task Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Non-Preemptive Robustness under Reduced System Load
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Sufficient real-time analysis for an engine control unit with constant angular velocities
Proceedings of the Conference on Design, Automation and Test in Europe
Proceedings of the 21st International conference on Real-Time Networks and Systems
Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines
Proceedings of the 21st International conference on Real-Time Networks and Systems
Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption
Proceedings of the 21st International conference on Real-Time Networks and Systems
Sufficient real-time analysis for an engine control unit
Proceedings of the 21st International conference on Real-Time Networks and Systems
Explicit reservation of cache memory in a predictable, preemptive multitasking real-time system
ACM Transactions on Embedded Computing Systems (TECS)
Limited preemptive scheduling of non-independent task sets
Proceedings of the Eleventh ACM International Conference on Embedded Software
A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems
ACM SIGBED Review - Special Issue on the 3rd Embedded Operating System Workshop (EWiLi 2013)
| Hi-index | 0.00 |
Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the literature as a viable alternative to fixed-priority pre-emptive scheduling (FPPS), that obviates the need for non-trivial resource access protocols and reduces the cost of arbitrary preemptions.This paper shows that existing worst-case response time analysis of hard real-time tasks under FPDS, arbitrary phasing and relative deadlines at most equal to periods is pessimistic and/or optimistic. The same problem also arises for fixed-priority non-pre-emptive scheduling (FPNS), being a special case of FPDS. This paper provides a revised analysis, resolving the problems with the existing approaches. The analysis is based on known concepts of critical instant and busy period for FPPS. To accommodate for our scheduling model for FPDS, we need to slightly modify existing definitions of these concepts. The analysis assumes a continuous scheduling model, which is based on a partitioning of the timeline in a set of non-empty, right semi-open intervals. It is shown that the critical instant, longest busy period, and worst-case response time for a task are suprema rather than maxima for all tasks, except for the lowest priority task. Hence, that instant, period, and response time cannot be assumed for any task, except for the lowest priority task. Moreover, it is shown that the analysis is not uniform for all tasks, i.e. the analysis for the lowest priority task differs from the analysis of the other tasks. These anomalies for the lowest priority task are an immediate consequence of the fact that only the lowest priority task cannot be blocked. To build on earlier work, the worst-case response time analysis for FPDS is expressed in terms of known worst-case analysis results for FPPS. The paper includes pessimistic variants of the analysis, which are uniform for all tasks, illustrates the revised analysis for an advanced model for FPDS, where tasks are structured as flow graphs of subjobs rather than sequences, and shows that our analysis is sustainable.