Toward a more accurate understanding of the limits of the TLS execution paradigm

  • Authors:

  • Nikolas Ioannou;Jeremy Singer;Salman Khan;Polychronis Xekalakis;Paraskevas Yiapanis;Adam Pocock;Gavin Brown;Mikel Lujan;Ian Watson;Marcelo Cintra

  • Affiliations:

  • School of Informatics, University of Edinburgh, USA;School of Computer Science, University of Manchester, USA;School of Informatics, University of Edinburgh, USA;Intel Barcelona Research Center, Intel Labs Barcelona, USA;School of Computer Science, University of Manchester, USA;School of Computer Science, University of Manchester, USA;School of Computer Science, University of Manchester, USA;School of Computer Science, University of Manchester, USA;School of Computer Science, University of Manchester, USA;School of Informatics, University of Edinburgh, USA

  • Venue:
  • IISWC '10 Proceedings of the IEEE International Symposium on Workload Characterization (IISWC'10)
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Thread-Level Speculation (TLS) facilitates the extraction of parallel threads from sequential applications. Most prior work has focused on developing the compiler and architecture for this execution paradigm. Such studies often narrowly concentrated on a specific design point. On the other hand, other studies have attempted to assess how well TLS performs if some architectural/ compiler constraint is relaxed. Unfortunately, such previous studies have failed to truly assess TLS performance potential, because they have been bound to some specific TLS architecture and have ignored one or another important TLS design choice, such as support for out-of-order task spawn or support for intermediate checkpointing.