The reviewed record of science sign in
Pith

arxiv: 1907.12666 · v1 · pith:OPPMCXL2 · submitted 2019-07-29 · cs.PF · cs.SE

Modeling Shared Cache Performance of OpenMP Programs using Reuse Distance

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:OPPMCXL2record.jsonopen to challenge →

classification cs.PF cs.SE
keywords memoryreusesharedapplicationscachedistancemulticoreperformance
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.