Sensitivity analysis of the minimum task period for arbitrary deadline real-time systems

Fengxiang Zhang; Alan Burns; Sanjoy Baruah

doi:10.1109/PRDC.2010.16

Sensitivity analysis of the minimum task period for arbitrary deadline real-time systems

Fengxiang Zhang^*, Alan Burns, Sanjoy Baruah

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The most important character of real-time systems is that they have stringent timing deadlines that must be guaranteed. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set, it is useful in an engineering context to know what changes to period can be made to a task that will deliver a schedulable system. In this paper, we develop the sensitivity analysis of task period for EDF scheduled systems on a uniprocessor. We prove that a minimum task period can be determined by a single pass of the QPA algorithm; an improved scheme is presented by using different initial values of the period. The approaches developed for sensitivity analysis of task period are therefore as efficient as QPA, and are easily incorporated into a system design support tool.

Original language	English
Title of host publication	Proceedings of the 16th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC)
Publisher	IEEE Computer Society
Pages	101-108
Number of pages	8
ISBN (Print)	9780769542898
DOIs	https://doi.org/10.1109/PRDC.2010.16
Publication status	Published - 2010
Event	16th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2010 - Tokyo, United Kingdom Duration: 13 Dec 2010 → 15 Dec 2010

Conference

Conference	16th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2010
Country/Territory	United Kingdom
City	Tokyo
Period	13/12/10 → 15/12/10

Keywords

Performance and reliability
Real-time and embedded systems
System design and control

Access to Document

10.1109/PRDC.2010.16

Cite this

@inproceedings{300d9b9a9d0a40ec96a3a45db2fe83f2,

title = "Sensitivity analysis of the minimum task period for arbitrary deadline real-time systems",

abstract = "The most important character of real-time systems is that they have stringent timing deadlines that must be guaranteed. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set, it is useful in an engineering context to know what changes to period can be made to a task that will deliver a schedulable system. In this paper, we develop the sensitivity analysis of task period for EDF scheduled systems on a uniprocessor. We prove that a minimum task period can be determined by a single pass of the QPA algorithm; an improved scheme is presented by using different initial values of the period. The approaches developed for sensitivity analysis of task period are therefore as efficient as QPA, and are easily incorporated into a system design support tool.",

keywords = "Performance and reliability, Real-time and embedded systems, System design and control",

author = "Fengxiang Zhang and Alan Burns and Sanjoy Baruah",

year = "2010",

doi = "10.1109/PRDC.2010.16",

language = "English",

isbn = "9780769542898",

pages = "101--108",

booktitle = "Proceedings of the 16th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC)",

publisher = "IEEE Computer Society",

address = "United States",

note = "16th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2010 ; Conference date: 13-12-2010 Through 15-12-2010",

}

Zhang, F, Burns, A & Baruah, S 2010, Sensitivity analysis of the minimum task period for arbitrary deadline real-time systems. in Proceedings of the 16th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC)., 5703233, IEEE Computer Society, pp. 101-108, 16th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2010, Tokyo, United Kingdom, 13/12/10. https://doi.org/10.1109/PRDC.2010.16

Sensitivity analysis of the minimum task period for arbitrary deadline real-time systems. / Zhang, Fengxiang; Burns, Alan; Baruah, Sanjoy.
Proceedings of the 16th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC). IEEE Computer Society, 2010. p. 101-108 5703233.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Sensitivity analysis of the minimum task period for arbitrary deadline real-time systems

AU - Zhang, Fengxiang

AU - Burns, Alan

AU - Baruah, Sanjoy

PY - 2010

Y1 - 2010

N2 - The most important character of real-time systems is that they have stringent timing deadlines that must be guaranteed. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set, it is useful in an engineering context to know what changes to period can be made to a task that will deliver a schedulable system. In this paper, we develop the sensitivity analysis of task period for EDF scheduled systems on a uniprocessor. We prove that a minimum task period can be determined by a single pass of the QPA algorithm; an improved scheme is presented by using different initial values of the period. The approaches developed for sensitivity analysis of task period are therefore as efficient as QPA, and are easily incorporated into a system design support tool.

AB - The most important character of real-time systems is that they have stringent timing deadlines that must be guaranteed. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set, it is useful in an engineering context to know what changes to period can be made to a task that will deliver a schedulable system. In this paper, we develop the sensitivity analysis of task period for EDF scheduled systems on a uniprocessor. We prove that a minimum task period can be determined by a single pass of the QPA algorithm; an improved scheme is presented by using different initial values of the period. The approaches developed for sensitivity analysis of task period are therefore as efficient as QPA, and are easily incorporated into a system design support tool.

KW - Performance and reliability

KW - Real-time and embedded systems

KW - System design and control

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

U2 - 10.1109/PRDC.2010.16

DO - 10.1109/PRDC.2010.16

M3 - Conference contribution

AN - SCOPUS:79951840618

SN - 9780769542898

SP - 101

EP - 108

BT - Proceedings of the 16th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC)

PB - IEEE Computer Society

T2 - 16th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2010

Y2 - 13 December 2010 through 15 December 2010

ER -

Sensitivity analysis of the minimum task period for arbitrary deadline real-time systems

Abstract

Conference

Keywords

Access to Document

Other files and links

Cite this