Optimal Priority Assignment to Control Tasks
(2014) In ACM Transactions on Embedded Computing Systems 13. p.161-161- Abstract
- In embedded real-time systems, task priorities are often assigned to meet deadlines. However, in control tasks, a late completion of a task has no catastrophic consequence. Rather, it has a quantifiable impact in the control performance achieved by the task. In this paper, we address the problem of determining the optimal assignment of priorities and periods of sampled-data control tasks that run over shared computation unit. We show that the minimization of the overall cost can be performed efficiently using a branch and bound algorithm, which can be further speeded up by allowing for a small degree of sub-optimality. Detailed numerical simulations are presented to show the advantages of various branching alternatives, the overall... (More)
- In embedded real-time systems, task priorities are often assigned to meet deadlines. However, in control tasks, a late completion of a task has no catastrophic consequence. Rather, it has a quantifiable impact in the control performance achieved by the task. In this paper, we address the problem of determining the optimal assignment of priorities and periods of sampled-data control tasks that run over shared computation unit. We show that the minimization of the overall cost can be performed efficiently using a branch and bound algorithm, which can be further speeded up by allowing for a small degree of sub-optimality. Detailed numerical simulations are presented to show the advantages of various branching alternatives, the overall algorithm effectiveness, and its scalability with the number of tasks. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/4580338
- author
- Mancuso, Guilio M. ; Bini, Enrico LU and Pannocchia, Gabriele
- organization
- publishing date
- 2014
- type
- Contribution to journal
- publication status
- published
- subject
- in
- ACM Transactions on Embedded Computing Systems
- volume
- 13
- pages
- 161 - 161
- publisher
- Association for Computing Machinery (ACM)
- external identifiers
-
- wos:000346416300017
- scopus:84908212097
- ISSN
- 1558-3465
- DOI
- 10.1145/2660496
- language
- English
- LU publication?
- yes
- id
- 5161961f-98ff-4cfb-8b1d-7cffe83df1ba (old id 4580338)
- date added to LUP
- 2016-04-01 10:13:57
- date last changed
- 2022-04-04 03:42:11
@article{5161961f-98ff-4cfb-8b1d-7cffe83df1ba,
abstract = {{In embedded real-time systems, task priorities are often assigned to meet deadlines. However, in control tasks, a late completion of a task has no catastrophic consequence. Rather, it has a quantifiable impact in the control performance achieved by the task. In this paper, we address the problem of determining the optimal assignment of priorities and periods of sampled-data control tasks that run over shared computation unit. We show that the minimization of the overall cost can be performed efficiently using a branch and bound algorithm, which can be further speeded up by allowing for a small degree of sub-optimality. Detailed numerical simulations are presented to show the advantages of various branching alternatives, the overall algorithm effectiveness, and its scalability with the number of tasks.}},
author = {{Mancuso, Guilio M. and Bini, Enrico and Pannocchia, Gabriele}},
issn = {{1558-3465}},
language = {{eng}},
pages = {{161--161}},
publisher = {{Association for Computing Machinery (ACM)}},
series = {{ACM Transactions on Embedded Computing Systems}},
title = {{Optimal Priority Assignment to Control Tasks}},
url = {{http://dx.doi.org/10.1145/2660496}},
doi = {{10.1145/2660496}},
volume = {{13}},
year = {{2014}},
}