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

Memory Positioning of Real-Time Code for Smaller Worst-Case Execution Times

Fulltext:


Research group:


Publication Type:

Conference/Workshop Paper

Venue:

Proceedings of the 16th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2011)

Publisher:

IEEE


Abstract

The process of determining the worst-case execution time (WCET) is challenged in the presence of caches due to their unpredictable effect on the speed of memory references. In particular, when cache conflicts between program lines are common, thrashing occurs and this inadvertently increases the WCET, sometimes significantly so. One way to minimise the cache impact on the WCET, therefore, is to judiciously lay out code and data in memory to avoid cache conflicts.In this paper, we show how to formulate the WCET-aware code placement problem as a Constraint-Optimization Problem (COP), which can then be efficiently solved by off-the-shelf COP solvers. Experimental evaluation of our proposed analysis shows that the proposed analysis successfully identified code positioning that yields the minimum WCET for over half of the problems within manageable time.

Bibtex

@inproceedings{Marref2088,
author = {Amine Marref and Adam Betts},
title = {Memory Positioning of Real-Time Code for Smaller Worst-Case Execution Times},
month = {April},
year = {2011},
booktitle = {Proceedings of the 16th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2011)},
publisher = {IEEE},
url = {http://www.es.mdh.se/publications/2088-}
}