Projects per year
Abstract
Controller Area Network (CAN) is widely used in automotive
applications. With CAN, the network utilisation that may be
obtained while ensuring that all messages meet their deadlines is
strongly dependent on the policy used for priority (message
identifier) assignment. This paper addresses the problem of
priority assignment when some message identifiers are fixed.
There are two variants of this problem: P1 where the gaps
between fixed identifiers are large enough to accommodate the
freely assignable messages and P2 when the gaps are too small.
For problem P1, we provide algorithms that give optimal and
robust priority orderings based on an adaptation of existing
techniques. Problem P2 is more difficult to solve. We show via a
counter example that the algorithms derived for P1 and others
recently published can fail to find a schedulable priority ordering
when the gaps are small, even though one exists. We derive an
optimal and robust solution to this problem with respect to a
simple form of schedulability analysis which assumes the same
upper bound on the length of all messages.
applications. With CAN, the network utilisation that may be
obtained while ensuring that all messages meet their deadlines is
strongly dependent on the policy used for priority (message
identifier) assignment. This paper addresses the problem of
priority assignment when some message identifiers are fixed.
There are two variants of this problem: P1 where the gaps
between fixed identifiers are large enough to accommodate the
freely assignable messages and P2 when the gaps are too small.
For problem P1, we provide algorithms that give optimal and
robust priority orderings based on an adaptation of existing
techniques. Problem P2 is more difficult to solve. We show via a
counter example that the algorithms derived for P1 and others
recently published can fail to find a schedulable priority ordering
when the gaps are small, even though one exists. We derive an
optimal and robust solution to this problem with respect to a
simple form of schedulability analysis which assumes the same
upper bound on the length of all messages.
| Original language | English |
|---|---|
| Title of host publication | RTNS '15 |
| Subtitle of host publication | Proceedings of the 23rd International Conference on Real Time and Networks Systems |
| Place of Publication | New York |
| Publisher | ACM |
| Pages | 279-288 |
| ISBN (Print) | 978-1-4503-3591-1 |
| DOIs | |
| Publication status | Published - Nov 2015 |
| Event | 23rd International conference on Real-Time Networks and Systems (RTNS 2015) - , United Kingdom Duration: 4 Nov 2015 → 6 Nov 2015 |
Conference
| Conference | 23rd International conference on Real-Time Networks and Systems (RTNS 2015) |
|---|---|
| Country/Territory | United Kingdom |
| Period | 4/11/15 → 6/11/15 |
Keywords
- CONTROLLER AREA NETWORK
- priority assignment
- real time systems
- scheduling
Projects
- 2 Finished
-
-
MCC: Mixed Criticality Embedded Systems on Many-Core Platforms
Burns, A. (Principal investigator), Bate, I. J. (Co-investigator), Davis, R. I. (Co-investigator), Soares Indrusiak, L. (Co-investigator) & Harbin, J. R. (Researcher)
1/04/13 → 30/09/16
Project: Research project (funded) › Research