L2 Cache Modeling for Scientific Applications on Chip Multi-Processors

It is critical to provide high performance for scientific applications running on chip multi-processors (CMP). A CMP architecture often comprises a shared 12 cache and lower-level storages. The shared 12 cache can reduce the number of cache misses if the data are accessed in common by several thread...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the International Conference on Parallel Processing p. 51
Main Authors: Fengguang Song, Moore, S., Dongarra, J.
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2007
Subjects:
Analytical models
Application software
architecture
cache
Capacity planning
chip multi-processor
Computer architecture
Computer science
Degradation
multi-threaded programming
Parallel processing
performance modeling
Predictive models
Sparse matrices
Yarn
ISSN:0190-3918
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is critical to provide high performance for scientific applications running on chip multi-processors (CMP). A CMP architecture often comprises a shared 12 cache and lower-level storages. The shared 12 cache can reduce the number of cache misses if the data are accessed in common by several threads, but it can also lead to performance degradation due to resource contention. Sometimes running threads on all cores can cause severe contention and increase the number of cache misses greatly. To investigate how the performance of a thread varies when running it concurrently with other threads on the remaining cores, we develop an analytical model to predict the number of misses on the shared L2 cache. In particular, we apply the model to thread-parallel numerical pro grams. We assume that all the threads compute homogeneous tasks and share a fully associative L2 cache. We use circular sequence profiling and stack processing techniques to analyze the L2 cache trace to predict the number of compulsory cache misses, capacity cache misses on shared data, and capacity cache misses on private data, respectively. Our method is able to predict the L2 cache performance for threads that have a global shared address space. For scientific applications, threads often have overlapping memory footprints. We use a cycle accurate simulator to validate the model with three scientific programs: dense matrix multiplication, blocked dense matrix multiplication, and sparse matrix-vector product. The average relative errors for the three experiments are 8.01%, 1.85%, and 2.41%, respectively.
ISSN:0190-3918
DOI:10.1109/ICPP.2007.52