A predictable simultaneous multithreading scheme for hard real-time

  • Authors:
  • Jonathan Barre;Christine Rochange;Pascal Sainrat

  • Affiliations:
  • Institut de Recherche en Informatique de Toulouse, Université de Toulouse, CNRS, France;Institut de Recherche en Informatique de Toulouse, Université de Toulouse, CNRS, France;Institut de Recherche en Informatique de Toulouse, Université de Toulouse, CNRS, France

  • Venue:
  • ARCS'08 Proceedings of the 21st international conference on Architecture of computing systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Simultaneous multithreading (SMT) processors might be good candidates to fulfill the ever increasing performance requirements of embedded applications. However, state-of-the-art SMT architectures do not exhibit enough timing predictability to allow a static analysis of Worst-Case Execution Times. In this paper, we analyze the predictability of various policies implemented in SMT cores to control the sharing of resources by concurrent threads. Then, we propose an SMT architecture designed to run one hard real-time thread so that its execution time is analyzable even when other (non critical) threads are executed concurrently. Experimental results show that this architecture still provides high mean and worst-case performance.