A Multiframe Model for Real-Time Tasks
IEEE Transactions on Software Engineering
Minimizing Aperiodic Response Times in a Firm Real-Time Environment
IEEE Transactions on Software Engineering
Real-Time Systems
Estimating probabilistic timing performance for real-time embedded systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - System Level Design
Elastic Scheduling for Flexible Workload Management
IEEE Transactions on Computers
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
Real-Time Systems
Enhanced Utilization Bounds for QoS Management
IEEE Transactions on Computers
A New Scheduling Algorithm and a Compensation Strategy for Imprecise Computation
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Efficient Reclaiming in Reservation-Based Real-Time Systems with Variable Execution Times
IEEE Transactions on Computers
A faster exact schedulability analysis for fixed-priority scheduling
Journal of Systems and Software
Exact Response Time Scheduling Analysis of Accumulatively Monotonic Multiframe Real Time Tasks
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Energy-efficiency for multiframe real-time tasks on a dynamic voltage scaling processor
CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Schedulability of aperiodic tasks in hybrid process model
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Real-time digital signal processing of component-oriented phased array radars
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Capacity sharing for overrun control
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Schedulability analysis of non-preemptive recurring real-time tasks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Feasibility analysis of real-time transactions
Real-Time Systems
| Hi-index | 0.02 |
The well-known periodic task model of Liu and Layland (1973) assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a task is much longer than the average. We give a multiframe real-time task model which allows the execution time of a task to vary from one instance to another by specifying the execution time of a task in terms of a sequence of numbers. We investigate the schedulability problem for this model for the preemptive fixed priority scheduling policy. We show that a significant improvement in the utilization bound can be established in our model.