Advanced

The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks

Bini, Enrico LU (2015) In IEEE Transactions on Computers 64(2). p.593-599
Abstract
In high throughput applications, such as in multimedia, it is preferable to fully utilize computing resources, even at the price of some (bounded) delay. However, in real-time systems, where the maximum admissible delay is modeled by a deadline, most of the theory is developed with the assumption of a task deadline smaller than or equal to the task period. The reason of this limitation is in the intrinsic difficulty of the schedulability analysis in the arbitrary deadline case. The most notable guarantee test for sets of arbitrary deadline tasks was due to Lehoczky in 1990. In this paper, we propose the quadratic utilization bound applicable to tasks with arbitrary deadline, which extends Lehoczky’s result. The improvement is made possible... (More)
In high throughput applications, such as in multimedia, it is preferable to fully utilize computing resources, even at the price of some (bounded) delay. However, in real-time systems, where the maximum admissible delay is modeled by a deadline, most of the theory is developed with the assumption of a task deadline smaller than or equal to the task period. The reason of this limitation is in the intrinsic difficulty of the schedulability analysis in the arbitrary deadline case. The most notable guarantee test for sets of arbitrary deadline tasks was due to Lehoczky in 1990. In this paper, we propose the quadratic utilization bound applicable to tasks with arbitrary deadline, which extends Lehoczky’s result. The improvement is made possible by providing some information about the task periods. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
IEEE Transactions on Computers
volume
64
issue
2
pages
593 - 599
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000348053400024
  • scopus:84921419400
ISSN
0018-9340
DOI
10.1109/TC.2013.209
language
English
LU publication?
yes
id
7cee5e24-b732-46b4-87fc-0eb230cc2fb8 (old id 4178544)
date added to LUP
2013-12-02 09:48:49
date last changed
2017-01-01 06:07:56
@article{7cee5e24-b732-46b4-87fc-0eb230cc2fb8,
  abstract     = {In high throughput applications, such as in multimedia, it is preferable to fully utilize computing resources, even at the price of some (bounded) delay. However, in real-time systems, where the maximum admissible delay is modeled by a deadline, most of the theory is developed with the assumption of a task deadline smaller than or equal to the task period. The reason of this limitation is in the intrinsic difficulty of the schedulability analysis in the arbitrary deadline case. The most notable guarantee test for sets of arbitrary deadline tasks was due to Lehoczky in 1990. In this paper, we propose the quadratic utilization bound applicable to tasks with arbitrary deadline, which extends Lehoczky’s result. The improvement is made possible by providing some information about the task periods.},
  author       = {Bini, Enrico},
  issn         = {0018-9340},
  language     = {eng},
  number       = {2},
  pages        = {593--599},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  series       = {IEEE Transactions on Computers},
  title        = {The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks},
  url          = {http://dx.doi.org/10.1109/TC.2013.209},
  volume       = {64},
  year         = {2015},
}