By Topic

Achieving maximum performance for matrix multiplication using set associative cache

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Ristov, S. ; Fac. of Inf. Sci. & Comput. Eng., Ss. Cyril & Methodius Univ., Skopje, Macedonia ; Gusev, M.

This paper explains why there are performance drawbacks for matrix multiplication algorithm using associative cache memory. We give an overview of cache memory organization and theoretical analysis why performance drawback appears in matrix multiplication. We also provide a method to avoid situations where this performance drawback is significant and how to achieve maximum performance. The analyzed problem appears in storage of matrix columns and inefficient usage of cache where the matrix will always map onto a small group of same cache sets and initiate a significant number of cache misses. In this case it looks like the processor is using only a small group of cache sets instead of complete number of sets in associative memory where maximum performance can be achieved.

Published in:

Computing Technology and Information Management (ICCM), 2012 8th International Conference on  (Volume:2 )

Date of Conference:

24-26 April 2012