A co-phase matrix to guide simultaneous multithreading simulation

Michael Van Biesbrouck, T. Sherwood, B. Calder
{"title":"A co-phase matrix to guide simultaneous multithreading simulation","authors":"Michael Van Biesbrouck, T. Sherwood, B. Calder","doi":"10.1109/ISPASS.2004.1291355","DOIUrl":null,"url":null,"abstract":"Several commercial processors have architectures that include support for simultaneous multithreading (SMT), yet there is still not a validated methodology for estimating the performance of an SMT machine that does not rely on full program simulation. To create an efficient sampling approach for SMT we must determine how far to fast-forward each individual thread between samples. The fast-forwarding distance for each thread will vary according to execution phases, thread interactions and changes to the architectural configuration. We examine using individual program phase information to guide SMT simulation. This is accomplished by creating what we call a co-phase matrix. The co-phase matrix is populated by collecting samples of the programs' phase combinations, and is used to guide fastforwarding between samples. We show for 28 pairs of SPEC programs that using the co-phase matrix provides an average error rate of 4% while requiring that only 1% of the full simulation be performed. The methods are also validated using a variety of architectural configurations and four-threaded workloads.","PeriodicalId":188291,"journal":{"name":"IEEE International Symposium on - ISPASS Performance Analysis of Systems and Software, 2004","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"99","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Symposium on - ISPASS Performance Analysis of Systems and Software, 2004","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPASS.2004.1291355","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 99

Abstract

Several commercial processors have architectures that include support for simultaneous multithreading (SMT), yet there is still not a validated methodology for estimating the performance of an SMT machine that does not rely on full program simulation. To create an efficient sampling approach for SMT we must determine how far to fast-forward each individual thread between samples. The fast-forwarding distance for each thread will vary according to execution phases, thread interactions and changes to the architectural configuration. We examine using individual program phase information to guide SMT simulation. This is accomplished by creating what we call a co-phase matrix. The co-phase matrix is populated by collecting samples of the programs' phase combinations, and is used to guide fastforwarding between samples. We show for 28 pairs of SPEC programs that using the co-phase matrix provides an average error rate of 4% while requiring that only 1% of the full simulation be performed. The methods are also validated using a variety of architectural configurations and four-threaded workloads.
一个指导同步多线程仿真的同相矩阵
一些商业处理器的体系结构包括对同步多线程(SMT)的支持,但是仍然没有一种经过验证的方法来评估不依赖于完整程序模拟的SMT机器的性能。要为SMT创建有效的采样方法,我们必须确定采样之间每个线程的快进距离。每个线程的快速转发距离将根据执行阶段、线程交互和体系结构配置的更改而变化。我们研究使用单独的程序阶段信息来指导SMT模拟。这是通过创建我们所说的共相矩阵来实现的。共相矩阵通过收集程序相组合的样本来填充,并用于指导样本之间的快速前进。我们表明,对于28对SPEC程序,使用共相矩阵提供了4%的平均错误率,而只需要执行1%的完整模拟。还使用各种体系结构配置和四线程工作负载验证了这些方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信