Skip to main content

Evaluation of a hybrid real-time bus scheduling mechanism for CAN

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1586))

Included in the following conference series:

Abstract

As a common resource, the CAN bus has to be shared by all computing nodes. Access to the bus has to be scheduled in a way that distributed computations meet their deadlines in spite of competition for the communication medium. The paper presents an evaluation of a resource scheduling scheme for CAN, which is based on time-slot reservation and dynamic priorities. The processing overhead as well as the schedulability parameters of the hybrid bus scheduling scheme are analyzed and compared with TDMA and the fixed priority assignment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. CiA: “CAN Application Layer (CAL) for Industrial Applications” CiA Draft Standards 201..207, May 1993.

    Google Scholar 

  2. CiA: “CANopen Communication Profile for Industrial Systems”, CiA Draft Standard 301, Oct. 1996.

    Google Scholar 

  3. R.M. Crovella: “SDS: A CAN Protocol for Plant Floor Control”, Proc. 1st Int’l CAN Conference, 1994.

    Google Scholar 

  4. R. Davis: “Dual Priority Scheduling: A Means of Providing Flexibility in Hard Real-time Systems”, Report No. YCS230, University of York, UK, May 1994.

    Google Scholar 

  5. H. Kopetz and G. Grünsteidl, “TTP-A Time-Triggered Protocol for Fault-Tolerant Real-Time Systems”, Research Report No. 12/92, Institut für Technische Informatik, Technical University of Vienna 1992.

    Google Scholar 

  6. M.A. Livani, J. Kaiser, W. Jia: “Scheduling Hard and Soft Real-Time Communication in Controller Area Network (CAN)”, 23rd IFAC/IFIP Workshop on Real Time Programming, Shantou, China, June 1998.

    Google Scholar 

  7. D. Noonen, S. Siegel, P. Maloney: “DeviceNet Application Protocol”, Proc. 1st Int’l CAN Conference, 1994.

    Google Scholar 

  8. ROBERT BOSCH GmbH, “CAN Specification Version 2.0”, Sep. 1991.

    Google Scholar 

  9. Siemens, AG: “C167, CMOS, User’s Manual“, Published by Semiconductor Group, Siemens AG, 1996.

    Google Scholar 

  10. K. Tindell and A. Burns: “Guaranteeing Message Latencies on Control Area Network (CAN)”, Proceedings of the 1 st International CAN Conference, 1994.

    Google Scholar 

  11. K. Tindell, A. Burns, A. Wellings: “Analysis of Hard Real-Time Communications”, J. Real-Time Systems, 9(2), Sep. 1995.

    Google Scholar 

  12. K.M. Zuberi and K.G. Shin: “Non-Preemptive Scheduling of messages on Controller Area Network for Real-Time Control Applications”, Proc. Real-Time Techn. and Appl. Symposium, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Livani, M.A., Kaiser, J. (1999). Evaluation of a hybrid real-time bus scheduling mechanism for CAN. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0097927

Download citation

  • DOI: https://doi.org/10.1007/BFb0097927

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics