mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Schedulability analysis of GMF-modeled messages over controller area networks with mixed-queues
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (IS)ORCID iD: 0000-0001-9736-8490
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (IS)ORCID iD: 0000-0002-1687-930X
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (IS)ORCID iD: 0000-0001-6132-7945
2014 (English)In: IEEE Int. Workshop Factory Commun. Syst. Proc. WFCS, 2014, Article number 6837606- p.Conference paper (Refereed)
Abstract [en]

The Controller Area Network (CAN) is widely utilized in many industrial real-time applications. As a real-time communication network, the predictability of timing behaviors is very important. Therefore, many works have been proposed regarding the schedulability analysis of CAN messages. Most of the existing analysis approaches are based on a traditional periodic message model. However, in some applications, the transmission of a message may follow a certain pattern instead of repeating the same transmission period by period. In these cases, applying the existing analysis methods may lead to quite pessimistic results. In order to tackle this problem, in this paper we apply the Generalized Multi-Frame (GMF) task model on CAN messages, where both priority-based and FIFO-based message queues are taken into account. We present a corresponding sufficient schedulability analysis. According to the experimental evaluations, our analysis can provide tighter results compared to the existing CAN message response time analysis in the context of GMF-modeled messages. 

Place, publisher, year, edition, pages
2014. Article number 6837606- p.
Series
IEEE International Workshop on Factory Communication Systems - Proceedings, WFCS
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:mdh:diva-25720DOI: 10.1109/WFCS.2014.6837606ISI: 000356767300031Scopus ID: 2-s2.0-84904016213ISBN: 9781479932351 (print)OAI: oai:DiVA.org:mdh-25720DiVA: diva2:735480
Conference
10th IEEE Workshop on Factory Communication Systems, WFCS 2014, 5 May 2014 through 7 May 2014, Toulouse
Available from: 2014-07-28 Created: 2014-07-25 Last updated: 2015-07-16Bibliographically approved
In thesis
1. On Improving Resource Utilization in Distributed Real-Time Embedded Systems
Open this publication in new window or tab >>On Improving Resource Utilization in Distributed Real-Time Embedded Systems
2014 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

In our modern life, embedded systems are playing an essential role. An embedded system is a computer system embedded into a certain device, in order to achieve computing functions. Beyond all doubt, as a validated system, the functional correctness must be guaranteed. However, for many embedded systems, timeliness also plays an important role in addition to the correctness of the functionalities. For example, in an automotive braking system, the braking function needs to be processed within a limited time duration in order to avoid accidents. Such systems are known as real-time embedded systems.

In these systems, there can be plenty of software programs (called tasks) sharing limited computing resources (e.g. processors, memories). If the system executes tasks in a random way, the whole system will become unpredictable. As a result, the system designers will not be able to verify if the system design can fulfill all the timing requirements or not. In other words, the system is not guaranteed to be safe. Therefore, system designers need to carefully implement algorithms to schedule all the tasks in a predictable manner. Regarding each scheduling algorithm, schedulability analyses are proposed which are used to check if the requirements can be satisfied.

Unfortunately, many real-time systems reserve too much computing resource for the sake of fulfilling timing requirements, without taking into account resource utilization. As a result, system resources cannot be efficiently utilized, which can cause significant resource waste in reality. Therefore, in this thesis, we aim to improve resource utilization in modern distributed real-time embedded systems. We try to tackle this problem from the following two aspects.

  1. Investigating tighter timing analyses. Due to the difficulty in performing precise mathematical schedulability analyses, most of the existing analyses include varying degrees of pessimism. In other words, the actual performance of the system can be much better than the predictions. If we can reduce the pessimism in schedulability analyses, we can then admit more workload into the system.
  2. Proposing new scheduling frameworks. It is difficult to find a scheduling algorithm which is suitable for all the situations. Therefore, we need different mechanisms to handle specific system characteristics in order to improve the resource utilization. 
Place, publisher, year, edition, pages
Västerås: Mälardalen University, 2014
Series
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 190
National Category
Embedded Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-26519 (URN)978-91-7485-177-9 (ISBN)
Presentation
2014-12-18, Delta, Västerås, 13:30 (English)
Opponent
Supervisors
Projects
START
Available from: 2014-11-12 Created: 2014-11-11 Last updated: 2014-12-09Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Liu, MengBehnam, MorisNolte, Thomas
By organisation
Embedded Systems
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 37 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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