liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The Multi-Domain Frame Packing Problem for CAN-FD
Virginia Tech, Blacksburg, VA, USA.
Virginia Tech, Blacksburg, VA, USA.
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering. General Motors, USA.
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering. General Motors, USA.
Show others and affiliations
2017 (English)In: 29th Euromicro Conference on Real-Time Systems (ECRTS 2017), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , 2017Conference paper, Published paper (Refereed)
Abstract [en]

The Controller Area Network with Flexible Data-Rate (CAN-FD) is a new communication protocol to meet the bandwidth requirements for the constantly growing volume of data exchanged in modern vehicles. The problem of frame packing for CAN-FD, as studied in the literature, assumes a single sub-system where one CAN-FD bus serves as the communication medium among several Electronic Control Units (ECUs). Modern automotive electronic systems, on the other hand, consist of several sub-systems, each facilitating a certain functional domain such as powertrain, chassis and suspension. A substantial fraction of all signals is exchanged across sub-systems. In this work, we study the frame packing problem for CAN-FD with multiple sub-systems, and propose a two-stage optimization framework. In the first stage, we pack the signals into frames with the objective of minimizing the bandwidth utilization. In the second stage, we extend Audsley's algorithm to assign priorities/identifiers to the frames. In case the resulting solution is not schedulable, our framework provides a potential repacking method. We propose two solution approaches: (a) an Integer Linear Programming (ILP) formulation that provides an optimal solution but is computationally expensive for industrial-size problems; and (b) a greedy heuristic that scales well and provides solutions that are comparable to optimal solutions. Experimental results show the efficiency of our optimization framework in achieving feasible solutions with low bandwidth utilization. The results also show a significant improvement over the case when there is no cross-domain consideration (as in prior work).

Place, publisher, year, edition, pages
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , 2017.
Series
Leibniz International Proceedings in Informatics (LIPIcs), ISSN 1868-8969
Keywords [en]
Frame Packing, CAN-FD, Integer Linear Programming, Audsley's Algorithm
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-142846DOI: 10.4230/LIPIcs.ECRTS.2017.12ISBN: 978-3-95977-037-8 (print)OAI: oai:DiVA.org:liu-142846DiVA, id: diva2:1154937
Conference
29th Euromicro Conference on Real-Time Systems (ECRTS 2017)
Available from: 2017-11-06 Created: 2017-11-06 Last updated: 2018-01-13

Open Access in DiVA

fulltext(4801 kB)10 downloads
File information
File name FULLTEXT01.pdfFile size 4801 kBChecksum SHA-512
88a2bd33dd049f27b5acf37f9d186a9f857bad5788028162e6fa026421a438c588e4b0a16a21a971ae6d308e5b052f6c5e13a970dfb9a4b4aac8e199123e3ec8
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Bordoloi, Unmesh D.Samii, Soheil
By organisation
Software and SystemsFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 10 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf