Exact scheduling analysis of non-accumulatively monotonic multiframe tasks

Areej Zuhily; Alan Burns

doi:10.1007/s11241-009-9085-6

Exact scheduling analysis of non-accumulatively monotonic multiframe tasks

Areej Zuhily, Alan Burns

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, we present exact analysis for the worst case response time of the general multiframe (MF) task model executing on a uniprocessor according to the fixed priority scheduling scheme. The analysis is developed in four stages. Firstly, we present the basic response time analysis where we optimize the number of frames that have to be considered in such analysis; we show how their number can be significantly reduced by eliminating non critical frames that are dominated by other frames. Secondly, we extend this analysis to be applicable to MF tasks with arbitrary deadlines. Thirdly, the basic analysis is extended to cope with frame specific deadlines. Lastly, the two models of frame specific deadlines and arbitrary deadlines are combined and the relative analysis is presented. An optimal priority assignment scheme for the frame specific deadline scenario is also presented in this paper.

Original language	English
Pages (from-to)	119-146
Number of pages	28
Journal	Real-Time Systems
Volume	43
Issue number	2
DOIs	https://doi.org/10.1007/s11241-009-9085-6
Publication status	Published - Oct 2009

Access to Document

10.1007/s11241-009-9085-6

http://dx.doi.org/10.1007/s11241-009-9085-6

Cite this

@article{ce4ec3be780f40cbae4bf04f0413c2dd,

title = "Exact scheduling analysis of non-accumulatively monotonic multiframe tasks",

abstract = "In this paper, we present exact analysis for the worst case response time of the general multiframe (MF) task model executing on a uniprocessor according to the fixed priority scheduling scheme. The analysis is developed in four stages. Firstly, we present the basic response time analysis where we optimize the number of frames that have to be considered in such analysis; we show how their number can be significantly reduced by eliminating non critical frames that are dominated by other frames. Secondly, we extend this analysis to be applicable to MF tasks with arbitrary deadlines. Thirdly, the basic analysis is extended to cope with frame specific deadlines. Lastly, the two models of frame specific deadlines and arbitrary deadlines are combined and the relative analysis is presented. An optimal priority assignment scheme for the frame specific deadline scenario is also presented in this paper. ",

author = "Areej Zuhily and Alan Burns",

year = "2009",

month = oct,

doi = "10.1007/s11241-009-9085-6",

language = "English",

volume = "43",

pages = "119--146",

journal = "Real-Time Systems",

issn = "1573-1383",

publisher = "Springer",

number = "2",

}

TY - JOUR

T1 - Exact scheduling analysis of non-accumulatively monotonic multiframe tasks

AU - Zuhily, Areej

AU - Burns, Alan

PY - 2009/10

Y1 - 2009/10

N2 - In this paper, we present exact analysis for the worst case response time of the general multiframe (MF) task model executing on a uniprocessor according to the fixed priority scheduling scheme. The analysis is developed in four stages. Firstly, we present the basic response time analysis where we optimize the number of frames that have to be considered in such analysis; we show how their number can be significantly reduced by eliminating non critical frames that are dominated by other frames. Secondly, we extend this analysis to be applicable to MF tasks with arbitrary deadlines. Thirdly, the basic analysis is extended to cope with frame specific deadlines. Lastly, the two models of frame specific deadlines and arbitrary deadlines are combined and the relative analysis is presented. An optimal priority assignment scheme for the frame specific deadline scenario is also presented in this paper.

AB - In this paper, we present exact analysis for the worst case response time of the general multiframe (MF) task model executing on a uniprocessor according to the fixed priority scheduling scheme. The analysis is developed in four stages. Firstly, we present the basic response time analysis where we optimize the number of frames that have to be considered in such analysis; we show how their number can be significantly reduced by eliminating non critical frames that are dominated by other frames. Secondly, we extend this analysis to be applicable to MF tasks with arbitrary deadlines. Thirdly, the basic analysis is extended to cope with frame specific deadlines. Lastly, the two models of frame specific deadlines and arbitrary deadlines are combined and the relative analysis is presented. An optimal priority assignment scheme for the frame specific deadline scenario is also presented in this paper.

UR - http://www.scopus.com/inward/record.url?scp=69549121641&partnerID=8YFLogxK

U2 - 10.1007/s11241-009-9085-6

DO - 10.1007/s11241-009-9085-6

M3 - Article

SN - 1573-1383

VL - 43

SP - 119

EP - 146

JO - Real-Time Systems

JF - Real-Time Systems

IS - 2

ER -

Exact scheduling analysis of non-accumulatively monotonic multiframe tasks

Abstract

Access to Document

Other files and links

Cite this