A multiframe model for real-time tasks
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Load adjustment in adaptive real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Aperiodic servers in a deadline scheduling environmentReal-Time Systems, 1995
- New strategies for assigning real-time tasks to multiprocessor systemsIEEE Transactions on Computers, 1995
- The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environmentsIEEE Transactions on Computers, 1995
- Dual Priority Assignment: A Practical Method For Increasing Processor UtilisationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- MPEGCommunications of the ACM, 1991
- Scheduling periodic jobs that allow imprecise resultsIEEE Transactions on Computers, 1990
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973