Evaluating Simultaneous Multi-threading and Affinity Performance for Reproducible Parallel Stochastic Simulation

Authors

  • Benjamin Antunes Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, Clermont-Auvergne-INP, LIMOS UMR 6158 - ISIMA - F-63000 Clermont-Ferrand, France https://orcid.org/0000-0002-0700-6558
  • David Hill Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, Clermont-Auvergne-INP, LIMOS UMR 6158 - ISIMA - F-63000 Clermont-Ferrand, France https://orcid.org/0000-0003-2820-2766

DOI:

https://doi.org/10.37256/rrcs.2220233134

Keywords:

simultaneous multi-threading, multicore, hyper-threading, performance

Abstract

This paper investigates whether simultaneous multi-threading (SMT) can improve performance on modern computing clusters with reproducible results on four types of applications, focused on stochastic simulations with different memory bound and compute bound constraints. We manually set the affinity of processes to compare its efficiency with the computing time obtained by the automatic assignment of the operating system. To measure SMT and affinity impact on a modern multicore processor, we parallelize up to 128 processes of the four types of applications. We expect repeatable numerical results between the sequential and parallel versions of simulations. For the three applications that are not memory bound, SMT is more effective by up to 30%. This represents an interesting increase up to 10% more performance for compute bound applications when compared to the initial papers discussing the efficiency of SMT. However, for the memory-bound application, SMT is less effective and can even decrease performance. The manual setting of core affinity does not show an increase in performance compared to the automatic assignment. All code and data used in the study are available to help reproducible research.

Downloads

Published

2023-12-29

How to Cite

Antunes, B., & Hill, D. (2023). Evaluating Simultaneous Multi-threading and Affinity Performance for Reproducible Parallel Stochastic Simulation. Research Reports on Computer Science, 2(2), 91–110. https://doi.org/10.37256/rrcs.2220233134