Worst case delay analysis for memory interference in multicore systems

  • Authors:
  • Rodolfo Pellizzoni;Andreas Schranzhofer;Jian-Jia Chen;Marco Caccamo;Lothar Thiele

  • Affiliations:
  • University of Illinois at Urbana-Champaign, Urbana, IL;Swiss Federal Institute of Technology (ETH), Zurich, Switzerland;Swiss Federal Institute of Technology (ETH), Zurich, Switzerland;University of Illinois at Urbana-Champaign, Urbana, IL;Swiss Federal Institute of Technology (ETH), Zurich, Switzerland

  • Venue:
  • Proceedings of the Conference on Design, Automation and Test in Europe
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Employing COTS components in real-time embedded systems leads to timing challenges. When multiple CPU cores and DMA peripherals run simultaneously, contention for access to main memory can greatly increase a task's WCET. In this paper, we introduce an analysis methodology that computes upper bounds to task delay due to memory contention. First, an arrival curve is derived for each core representing the maximum memory traffic produced by all tasks executed on it. Arrival curves are then combined with a representation of the cache behavior for the task under analysis to generate a delay bound. Based on the computed delay, we show how tasks can be feasibly scheduled according to assigned time slots on each core.