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
A Server-based Approach for Overrun Management in Multi-Core Real-Time Systems
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (Complex Real-Time Embedded Systems)ORCID iD: 0000-0001-9736-8490
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (Complex Real-Time Embedded Systems)ORCID iD: 0000-0002-1687-930X
Nagoya University, Nagoya, Japan.
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (Complex Real-Time Embedded Systems)ORCID iD: 0000-0001-6132-7945
2014 (English)Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents a server-based framework for task overrun management in multi-core real-time systems. Unlike most existing scheduling methods which usually assume a single upper bound of the Worst-Case Execution Time (WCET) for each task, our approach targets scenarios with task overruns. The main idea of our framework is to employ Synchronized Deferrable Servers (SDS) to deal with globally scheduled task overruns, while a partitioned scheduling approach is applied on regular task executions. Moreover, we provide a deterministic Worst- Case Response Time (WCRT) analysis focusing on hard timing constraints, along with a probabilistic analysis of Deadline Miss Ratio (DMR) for soft real-time applications. In the evaluation phase, we have implemented two types of experiments evaluating different timing constraints. 

Place, publisher, year, edition, pages
2014. Article number 7005114- p.
National Category
Embedded Systems
Identifiers
URN: urn:nbn:se:mdh:diva-26518DOI: 10.1109/ETFA.2014.7005114ISI: 000360999100065Scopus ID: 2-s2.0-84946690207ISBN: 978-147994846-8 (print)OAI: oai:DiVA.org:mdh-26518DiVA: diva2:762422
Conference
The 19th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'2014)
Projects
START
Available from: 2014-11-11 Created: 2014-11-11 Last updated: 2016-01-18Bibliographically 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
Embedded Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 19 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