Statistical quality analysis of schedulers under soft-real-time constraints

H.E. Baarsma, Johann L. Hurink, P.G. Jansen

Research output: Book/ReportReportProfessional

21 Downloads (Pure)

Abstract

This paper describes an algorithm to determine the performance of real-time systems with tasks using stochastic processing times. Such an algorithm can be used for guaranteeing Quality of Service of periodic tasks with soft real-time constraints. We use a discrete distribution model of processing times instead of worst case times like in hard real-time systems. Such a model gives a more realistic view on the actual requirements of the system. The presented algorithm works for all deterministic scheduling systems, which makes it more general than existing 6algorithms and allows us to compare performance between these systems. To demonstrate our method, we make a comparison between the performance of the well known scheduling algorithms Earliest Deadline First and Rate Monotonic. We show that the complexity of our method can compete with other algorithms that work for a wide range of schedulers.
Original languageUndefined
Place of PublicationEnschede
PublisherCentre for Telematics and Information Technology (CTIT)
Number of pages8
Publication statusPublished - 4 Apr 2007

Publication series

NameCTIT Technical Report Series
No.07-26
ISSN (Print)1381-3625

Keywords

  • METIS-241564
  • EWI-9620
  • MSC-68M20
  • IR-67051
  • CAES-PS: Pervasive Systems

Cite this

Baarsma, H. E., Hurink, J. L., & Jansen, P. G. (2007). Statistical quality analysis of schedulers under soft-real-time constraints. (CTIT Technical Report Series; No. 07-26). Enschede: Centre for Telematics and Information Technology (CTIT).
Baarsma, H.E. ; Hurink, Johann L. ; Jansen, P.G. / Statistical quality analysis of schedulers under soft-real-time constraints. Enschede : Centre for Telematics and Information Technology (CTIT), 2007. 8 p. (CTIT Technical Report Series; 07-26).
@book{14c5f3d4f3e642d7ae0b4abda7a0640f,
title = "Statistical quality analysis of schedulers under soft-real-time constraints",
abstract = "This paper describes an algorithm to determine the performance of real-time systems with tasks using stochastic processing times. Such an algorithm can be used for guaranteeing Quality of Service of periodic tasks with soft real-time constraints. We use a discrete distribution model of processing times instead of worst case times like in hard real-time systems. Such a model gives a more realistic view on the actual requirements of the system. The presented algorithm works for all deterministic scheduling systems, which makes it more general than existing 6algorithms and allows us to compare performance between these systems. To demonstrate our method, we make a comparison between the performance of the well known scheduling algorithms Earliest Deadline First and Rate Monotonic. We show that the complexity of our method can compete with other algorithms that work for a wide range of schedulers.",
keywords = "METIS-241564, EWI-9620, MSC-68M20, IR-67051, CAES-PS: Pervasive Systems",
author = "H.E. Baarsma and Hurink, {Johann L.} and P.G. Jansen",
year = "2007",
month = "4",
day = "4",
language = "Undefined",
series = "CTIT Technical Report Series",
publisher = "Centre for Telematics and Information Technology (CTIT)",
number = "07-26",
address = "Netherlands",

}

Baarsma, HE, Hurink, JL & Jansen, PG 2007, Statistical quality analysis of schedulers under soft-real-time constraints. CTIT Technical Report Series, no. 07-26, Centre for Telematics and Information Technology (CTIT), Enschede.

Statistical quality analysis of schedulers under soft-real-time constraints. / Baarsma, H.E.; Hurink, Johann L.; Jansen, P.G.

Enschede : Centre for Telematics and Information Technology (CTIT), 2007. 8 p. (CTIT Technical Report Series; No. 07-26).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - Statistical quality analysis of schedulers under soft-real-time constraints

AU - Baarsma, H.E.

AU - Hurink, Johann L.

AU - Jansen, P.G.

PY - 2007/4/4

Y1 - 2007/4/4

N2 - This paper describes an algorithm to determine the performance of real-time systems with tasks using stochastic processing times. Such an algorithm can be used for guaranteeing Quality of Service of periodic tasks with soft real-time constraints. We use a discrete distribution model of processing times instead of worst case times like in hard real-time systems. Such a model gives a more realistic view on the actual requirements of the system. The presented algorithm works for all deterministic scheduling systems, which makes it more general than existing 6algorithms and allows us to compare performance between these systems. To demonstrate our method, we make a comparison between the performance of the well known scheduling algorithms Earliest Deadline First and Rate Monotonic. We show that the complexity of our method can compete with other algorithms that work for a wide range of schedulers.

AB - This paper describes an algorithm to determine the performance of real-time systems with tasks using stochastic processing times. Such an algorithm can be used for guaranteeing Quality of Service of periodic tasks with soft real-time constraints. We use a discrete distribution model of processing times instead of worst case times like in hard real-time systems. Such a model gives a more realistic view on the actual requirements of the system. The presented algorithm works for all deterministic scheduling systems, which makes it more general than existing 6algorithms and allows us to compare performance between these systems. To demonstrate our method, we make a comparison between the performance of the well known scheduling algorithms Earliest Deadline First and Rate Monotonic. We show that the complexity of our method can compete with other algorithms that work for a wide range of schedulers.

KW - METIS-241564

KW - EWI-9620

KW - MSC-68M20

KW - IR-67051

KW - CAES-PS: Pervasive Systems

M3 - Report

T3 - CTIT Technical Report Series

BT - Statistical quality analysis of schedulers under soft-real-time constraints

PB - Centre for Telematics and Information Technology (CTIT)

CY - Enschede

ER -

Baarsma HE, Hurink JL, Jansen PG. Statistical quality analysis of schedulers under soft-real-time constraints. Enschede: Centre for Telematics and Information Technology (CTIT), 2007. 8 p. (CTIT Technical Report Series; 07-26).