skip to main content
10.1145/2997465.2997484acmotherconferencesArticle/Chapter ViewAbstractPublication PagesrtnsConference Proceedingsconference-collections
research-article

A Practical Message ID Assignment Policy for Controller Area Network that Maximizes Extensibility

Published:19 October 2016Publication History

ABSTRACT

Controller Area Network (CAN) is widely used in automotive applications. Policies for message ID and thus priority assignment have a significant impact on schedulability. In addition, they also determine extensibility; the scope to add messages required by future upgrades without compromising schedulability. In this paper we address message ID assignment, such that the system is extensible. First, we provide an assessment metric that provides an in-depth view of the extensibility of a given ID-assignment, tailored for use in automotive applications. Second, we develop a practical ID-assignment policy which maximizes extensibility. This policy provides an upgrade pathway: it is used to provide the initial ID-assignment, and also used for ID-assignments during subsequent upgrades. The policy optimizes extensibility by maintaining Deadline minus Jitter Monotonic Priority Ordering, which ensures that it does not compromise either schedulability or robustness to errors on the bus. Evaluation using a simple automotive benchmark shows the effectiveness of the policy over multiple upgrades.

References

  1. N.C. Audsley. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical Report YCS 164, Department of Computer Science, University of York, 1991.Google ScholarGoogle Scholar
  2. N.C. Audsley. On priority assignment in fixed priority scheduling. Information Processing Letters, 79(1):39--44, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Bosch. CAN specification 2.0, 1991.Google ScholarGoogle Scholar
  4. Bosch. CAN with flexible data-rate specification 1.0, 2012.Google ScholarGoogle Scholar
  5. R. I. Davis, L. Cucu-Grosjean, M. Bertogna, and A. Burns. A review of priority assignment in real-time systems. Journal of Systems Architecture, 65(C):64--82, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. R.I. Davis and A. Burns. Robust priority assignment for fixed priority real-time systems. In IEEE Real-Time Systems Symposium (RTSS), pages 3--14, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R.I. Davis and A. Burns. Robust priority assignment for messages on Controller Area Network (CAN). Real-Time Systems, 41(2):152--180, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R.I. Davis, A. Burns, R. Bril, and J. Lukkien. Controller area network (CAN) schedulability analysis: Refuted, revisited and revised. Real-Time Systems, 35(3):239--272, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R.I. Davis, A. Burns, V. Pollex, and F. Slomka. On priority assignment for controller area network when some message identifiers are fixed. In International Conference on Real-Time Networks and Systems (RTNS), pages 279--288, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R.I. Davis, S. Kollmann, V. Pollex, and F. Slomka. Schedulability analysis for Controller Area Network (CAN) with FIFO queues priority queues and gateways. Real-Time Systems, 49(1):73--116, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R.I. Davis and N. Navet. Controller Area Network (CAN) schedulability analysis for messages with arbitrary deadlines in FIFO and work-conserving queues. In IEEE International Workshop on Factory Communication Systems (WFCS), pages 33--42, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  12. R.I. Davis and N. Navet. Traffic shaping to reduce jitter in Controller Area Network (CAN). In Work-in-Progress Session of Euromicro Conference on Real-Time Systems (ECRTS), 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. Emberson and I. Bate. Stressing search with scenarios for flexible solutions to real-time task allocation problems. IEEE Transaction on Software Engineering, 36(5):704--718, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Kramer, D. Ziegenbein, and A. Hamann. Real world automotive benchmarks for free. In International Workshop on Analysis and Methodologies for Embedded and Real-Time Systems (WATERS), 2015.Google ScholarGoogle Scholar
  15. J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In IEEE Real Time Systems Symposium (RTSS), pages 166--171, 1989.Google ScholarGoogle ScholarCross RefCross Ref
  16. F. Pölzlbauer, I. Bate, and E. Brenner. Optimized frame packing for embedded systems. IEEE Embedded Systems Letters, 4(3):65--68, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. F. Pölzlbauer, I. Bate, and E. Brenner. On extensible networks for embedded systems. In IEEE International Conference and Workshops on the Engineering of Computer Based Systems (ECBS), pages 69--77, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. F. Pölzlbauer, R.I. Davis, and I. Bate. A practical message ID assignment policy for Controller Area Network that maximizes extensibility. https://www.cs.york.ac.uk/ftpdir/reports/2016/YCS/504/YCS-2016-504.pdf Technical Report YCS-2016-504, Department of Computer Science, University of York, 2016.Google ScholarGoogle Scholar
  19. S. Punnekkat, R.I. Davis, and A. Burns. Sensitivity analysis of real-time task sets. In Advances in Computing Science -- ASIAN'97, volume 1345 of Lecture Notes in Computer Science, pages 72--82. 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. K. W. Schmidt. Robust priority assignments for extending existing controller area network applications. IEEE Transactions on Industrial Informatics, 10(1):578--585, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  21. K. Tindell and A. Burns. Guaranteeing message latencies on controller area network (CAN). In International CAN Conference, 1994.Google ScholarGoogle Scholar
  22. P. M. Yomsi, D. Bertrand, N. Navet, and R. I. Davis. Controller Area Network (CAN): Response time analysis with offsets. In IEEE International Workshop on Factory Communication Systems (WFCS), pages 43--52, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  23. H. Zeng, M. Di Natale, P. Giusto, and A. Sangiovanni-Vincentelli. Stochastic analysis of can-based real-time automotive systems. IEEE Transactions on Industrial Informatics, 5(4):388--401, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  24. W. Zheng, J. Chong, C. Pinello, S. Kanajan, and A. Sangiovanni-Vincentelli. Extensible and scalable time triggered scheduling. In International Conference on Application of Concurrency to System Design (ACSD), pages 132--141, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Q. Zhu, Y. Yang, E. Scholte, M. Di Natale, and A. Sangiovanni-Vincentelli. Optimizing extensibility in hard real-time distributed systems. In IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 275--284, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Qi Zhu, Yang Yang, M. Natale, E. Scholte, and A. Sangiovanni-Vincentelli. Optimizing the software architecture for extensibility in hard real-time distributed systems. IEEE Transactions on Industrial Informatics, 6(4):621--636, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  27. A. Zuhily and A. Burns. Optimality of (D-J)-monotonic priority assignment. Information Processing Letters, 103(6), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    RTNS '16: Proceedings of the 24th International Conference on Real-Time Networks and Systems
    October 2016
    353 pages
    ISBN:9781450347877
    DOI:10.1145/2997465

    Copyright © 2016 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 19 October 2016

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited

    Acceptance Rates

    RTNS '16 Paper Acceptance Rate34of75submissions,45%Overall Acceptance Rate119of255submissions,47%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader