arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.12666cs.PFcs.SE
收藏

基于重用距离的OpenMP程序共享Cache性能建模

Modeling Shared Cache Performance of OpenMP Programs using Reuse Distance

Atanu Barai, Gopinath Chennupati, Nandakishore Santhi, Abdel-Hameed A. Badawy, Stephan Eidenbenz

摘要:

由于多核处理器的设计复杂,包括私有和共享的存储层次结构,多核计算机上并行应用的性能建模仍然是计算协同设计中的一个挑战。我们提出了一个可扩展的分析共享内存模型来预测运行在多核计算机上的并行应用程序的性能,并在层次结构中共享同一级别的缓存。该模型使用计算效率高的概率方法来预测重用距离概况,其中重用距离是虚拟内存访问模式的独立于硬件架构的度量。它依赖于一个随机的,静态的基本块级的重用配置文件的分析,从应用程序的内存跟踪测量顺序运行在小的实例,而不是使用多线程跟踪。结果表明,在共享缓存的命中率预测是准确的。

英文摘要:

Performance modeling of parallel applications on multicore computers remains a challenge in computational co-design due to the complex design of multicore processors including private and shared memory hierarchies. We present a Scalable Analytical Shared Memory Model to predict the performance of parallel applications that runs on a multicore computer and shares the same level of cache in the hierarchy. This model uses a computationally efficient, probabilistic method to predict the reuse distance profiles, where reuse distance is a hardware architecture-independent measure of the patterns of virtual memory accesses. It relies on a stochastic, static basic block-level analysis of reuse profiles measured from the memory traces of applications ran sequentially on small instances rather than using a multi-threaded trace. The results indicate that the hit-rate predictions on the shared cache are accurate.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑