Controller area network (CAN) schedulability analysis for messages with arbitrary deadlines in FIFO and work-conserving queues

Robert I. Davis, Nicolas Navet

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The majority of research into schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into arbitration on the bus. In practice; however, some CAN device drivers and communications stacks implement queuing policies that are not strictly priority-based, invalidating this assumption. In this paper, we introduce response time analysis for work conserving and FIFO queuing policies
for messages with arbitrary deadlines.
Original languageEnglish
Title of host publicationIEEE International Workshop on Factory Communication Systems
PublisherIEEE
Pages33-42
ISBN (Print)978-146731573-9
DOIs
Publication statusPublished - May 2012
Event9th IEEE International Workshop on Factory Communication Systems, WFCS 2012 - Lemgo, Germany
Duration: 21 May 201224 May 2012

Conference

Conference9th IEEE International Workshop on Factory Communication Systems, WFCS 2012
Country/TerritoryGermany
CityLemgo
Period21/05/1224/05/12

Keywords

  • controller area network
  • CAN
  • real-time
  • communication
  • networks
  • schedulability analysis
  • fifo

Cite this