You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Hierarchical Scheduling of CAN using Server-Based Techniques

Fulltext:


Authors:

Thomas Nolte, Mikael Sjödin, Hans Hansson

Publication Type:

Conference/Workshop Paper

Venue:

Proceedings of the 3rd International Workshop on Real-Time Networks (RTN04) in conjunction with the 16th Euromicro International Conference on Real-Time Systems (ECRTS04)

Publisher:

Universidade de Aveiro, Campo Universitario de Santiago, 3810-193 Aveiro, Portugal, ISBN 972-789-136-5

Abstract

Server-based scheduling of CAN has been proposed as a way of fair scheduling of the Controller Area Network (CAN). By separating streams of messages by using network access servers (N-Servers), scheduling is performed at three layers where native CAN message arbitration is the scheduling at the lowest level. On top of this is the server-based scheduling to separate different streams of messages within the system. Looking at a single N-Server, several streams might share one server. Hence, scheduling is performed at the third level every time the N-Server is being scheduled for message transmission. Here different queuing policies play a role in the scheduling performed.This paper discusses the hierarchical scheduling of CAN, as a way of fair separation of message streams while providing a flexible core mechanism, the server-based scheduling of CAN.

Bibtex

@inproceedings{Nolte600,
author = {Thomas Nolte and Mikael Sj{\"o}din and Hans Hansson},
title = {Hierarchical Scheduling of CAN using Server-Based Techniques},
editor = {Luis Almeida},
pages = {27--30},
month = {June},
year = {2004},
booktitle = {Proceedings of the 3rd International Workshop on Real-Time Networks (RTN04) in conjunction with the 16th Euromicro International Conference on Real-Time Systems (ECRTS04)},
publisher = {Universidade de Aveiro, Campo Universitario de Santiago, 3810-193 Aveiro, Portugal, ISBN 972-789-136-5},
url = {http://www.es.mdu.se/publications/600-}
}