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

Contention-Free Execution of Automotive Applications on a Clustered Many-Core Platform

Fulltext:


Authors:

Matthias Becker, Dakshina Dasari , Borislav Nicolic , Benny Åkesson , Vincent Nélis , Thomas Nolte

Publication Type:

Conference/Workshop Paper

Venue:

28th Euromicro Conference on Real-Time Systems


Abstract

Next generations of compute-intensive real-time applications in automotive systems will require more powerful computing platforms. One promising power-efficient solution for such applications is to use clustered many-core architectures. However, ensuring that real-time requirements are satisfied in the presence of contention in shared resources, such as memories, remains an open issue. This work presents a novel contention-free execution framework to execute automotive applications on such platforms. Privatization of memory banks together with defined access phases to shared memory resources is the backbone of the framework. An Integer Linear Programming (ILP) formulation is presented to find the optimal time-triggered schedule for the on-core execution as well as for the access to shared memory. Additionally a heuristic solution is presented that generates the schedule in a fraction of the time required by the ILP. Extensive evaluations show that the proposed heuristic performs only 0.5% away from the optimal solution while it outperforms a baseline heuristic by 67%. The applicability of the approach to industrially sized problems is demonstrated in a case study of a software for Engine Management Systems.

Bibtex

@inproceedings{Becker4346,
author = {Matthias Becker and Dakshina Dasari and Borislav Nicolic and Benny {\AA}kesson and Vincent N{\'e}lis and Thomas Nolte},
title = {Contention-Free Execution of Automotive Applications on a Clustered Many-Core Platform},
month = {July},
year = {2016},
booktitle = {28th Euromicro Conference on Real-Time Systems},
url = {http://www.es.mdh.se/publications/4346-}
}