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

Benjamin Antunes, David Hill
{"title":"Evaluating Simultaneous Multi-threading and Affinity Performance for Reproducible Parallel Stochastic Simulation","authors":"Benjamin Antunes, David Hill","doi":"10.37256/rrcs.2220233134","DOIUrl":null,"url":null,"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.","PeriodicalId":377142,"journal":{"name":"Research Reports on Computer Science","volume":"21 12","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Research Reports on Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37256/rrcs.2220233134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

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.
评估可重现并行随机模拟的同时多线程和亲和性能
本文研究了同步多线程(SMT)能否提高现代计算集群的性能,并在四种类型的应用中取得了可重复的结果,重点是具有不同内存约束和计算约束限制的随机模拟。我们手动设置进程的亲和性,将其效率与操作系统自动分配的计算时间进行比较。为了衡量 SMT 和亲和性对现代多核处理器的影响,我们对四种类型的应用进行了多达 128 个进程的并行化处理。我们希望顺序和并行版本的模拟结果具有可重复性。对于不受限于内存的三种应用,SMT 的效率最高可达 30%。这表明,与最初讨论 SMT 效率的论文相比,计算绑定应用的性能最多提高了 10%。然而,对于内存绑定的应用,SMT 的效率较低,甚至会降低性能。与自动分配相比,手动设置内核亲和性并没有提高性能。研究中使用的所有代码和数据均可提供,以帮助进行可重复的研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信