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

Mapping Real-Time Tasks onto Many-Core Systems considering Message Flows

Authors:

Matthias Becker, Kristian Sandström, Moris Behnam, Thomas Nolte

Note:

Work-in-Progress

Research group:

Complex Real-Time Embedded Systems

Publication Type:

Conference/Workshop Paper

Venue:

20th IEEE Real-Time and Embedded Technology and Applications Symposium

Abstract

In this work we focus on the task mapping problem for many-core real-time systems. The growing number of cores connected by a Network-on-Chip (NoC) calls for sophisticated mapping techniques to meet the growing demands of real-time applications. Hardware should be used in an efficient way such that unnecessary resource usage is avoided. Because of the NP-hardness of the problem, heuristic and meta-heuristic techniques are used to find good solutions. We further consider periodic communication between tasks and we focus on a static mapping solution.

Bibtex

@inproceedings{Becker3501,
author = {Matthias Becker and Kristian Sandstr{\"o}m and Moris Behnam and Thomas Nolte},
title = {Mapping Real-Time Tasks onto Many-Core Systems considering Message Flows},
note = {Work-in-Progress},
month = {April},
year = {2014},
booktitle = {20th IEEE Real-Time and Embedded Technology and Applications Symposium},
url = {http://www.es.mdu.se/publications/3501-}
}