A multiframe model for real-time tasks

Author

Mok, Aloysius K. ; Chen, Deji

Author_Institution

Dept. of Comput. Sci., Texas Univ., Austin, TX, USA

fYear

1996

fDate

4-6 Dec 1996

Firstpage

22

Lastpage

29

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

computational complexity; real-time systems; resource allocation; scheduling; software performance evaluation; multiframe model; number sequence; periodic task model; preemptive fixed priority scheduling policy; real-time tasks; schedulability problem; utilization bound; worst-case execution time bound; Adaptive scheduling; Processor scheduling; Scheduling algorithm; Timing; Vehicles;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems Symposium, 1996., 17th IEEE

Conference_Location

Los Alamitos, CA

ISSN

1052-8725

Print_ISBN

0-8186-7689-2

Type

conf

DOI

10.1109/REAL.1996.563696

Filename

563696