2021/09/10 by Hsin‐Yu Ho, Ho, Hsin-Yu, Ren‐Song Tsay +1
Computer Science · #Advanced Data Storage Technologies #FOS: Computer and information sciences #Interconnection Networks and Systems #Parallel Computing and Optimization Techniques #Performance (cs.PF)
paper · pdf · doi:10.48550/arxiv.2109.04621
openalex publication_date 2021/09/10 · openalex created_date 2021/09/27 · openalex updated_date 2026/07/28
In this paper, we proposed an effective and efficient multi-core shared-cache design optimization approach based on reuse-distance analysis of the data traces of target applications. Since data traces are independent of system hardware architectures, a designer can easily compute the best cache design at the early system design phase using our approach. We devise a very efficient and yet accurate method to derive the aggregated reuse-distance histograms of concurrent applications for accurate cache performance analysis and optimization. Essentially, the actual shared-cache contention results of concurrent applications are embedded in the aggregated reuse-distance histograms and therefore the approach is very effective. The experimental results show that the average error rate of shared-cache miss-count estimations of our approach is less than 2.4%. Using a simple scanning search method, one can easily determine the true optimal cache configurations at the early system design phase.