Optimal Priority Assignment for Scheduling Mixed CAN and CAN-FD Frames

Park, Tae‐Ju; Shin, Kang G.

doi:10.1109/rtas.2019.00024

Cited by 3 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Davis et al [14] later showed that a reliable CAN utilization over 80% can be achieved using Audley's Optimal Priority Assignment (AOPA) algorithm [3]. AOPA has become the reference priority assignment scheme in many real-time systems and has been proved to be optimal when there are no priority inversions [38]. Davis et al [12] introduced an improvement of the AOPA -the Robust Priority Assignment algorithm (RPA) -which, in addition to being optimal, maximizes the number of tolerable transmission errors in CAN.…”

Section: Related Workmentioning

confidence: 99%

“…As is the case with most, if not all, real-time and/or time-sensitive preemptive systems, an appropriate priority-to-ow assignment policy plays a central role in the resulting performance of both 1-level and multi-level preemption schemes to avoid the over-provisioning and/or the sub-optimal use of hardware resources. In this scope, the so-called Audsley's Optimal Priority Assignment algorithm (AOPA) has become the reference in many real-time systems 1 provided that there are no priority inversions [13,38]. This is not the case in preemptive TSN [32,34].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Configuration Framework for Multi-level Preemption Schemes in Time Sensitive Networking

Yomsi

Almeida

2022

Proceedings of the 30th International Conference on Real-Time Networks and Systems

View full text Add to dashboard Cite

To reduce the latency of time-sensitive flows in Ethernet networks, the IEEE TSN Task Group introduced the IEEE 802.1Qbu Standard, which specifies a 1-level preemption scheme for IEEE 802.1 networks. Recently, serious limitations of this scheme w.r.t. flows responsiveness were exposed and the so-called multi-level preemption approach was proposed to address these drawbacks. As is the case with most, if not all, real-time and/or timesensitive preemptive systems, an appropriate priority-to-flow assignment policy plays a central role in the resulting performance of both 1-level and multi-level preemption schemes to avoid the over-provisioning and/or the suboptimal use of hardware resources. Yet on another front, the multi-level preemption scheme raises new configuration challenges. Specifically, the right number of preemption level(s) to enable for swift transmission of flows; and the flow-to-preemption-class assignment synthesis remain open problems. To the best of our knowledge, there is no prior work in the literature addressing these important challenges. In this work, we address these three challenges. We demonstrate the applicability of our proposed solution by using both synthetic and real-life use-cases. Our experimental results show that multi-level preemption schemes improve the schedulability of flows by over 12% as compared to a 1-level preemption scheme, and at a higher abstraction level, the proposed configuration framework improves the schedulability of flows by up to 6% as compared to the dominant Deadline Monotonic Priority Ordering.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%