The Community for Technology Leaders
Green Image
Issue No. 07 - July (2005 vol. 54)
ISSN: 0018-9340
pp: 913-916
With the advance of integration technology, it has become feasible to implement a microprocessor, a vector unit, and a multimegabyte bank-interleaved L2 cache on a single die. Parallel access to strided vectors on the L2 cache is a major performance issue on such vector microprocessors. A major difficulty for such a parallel access is that one would like to interleave the cache on a block size basis in order to benefit from spatial locality and to maintain a low tag volume, while strided vector accesses naturally work on a word granularity. In this paper, we address this issue. Considering a parallel vector unit with 2^n independent lanes, a 2^n bank interleaved cache, and a cache line size of 2^k words, we show that any slice of 2^{n+k} consecutive elements of any strided vector with stride 2^rR with R odd and r\leq k can be accessed in the L2 cache and routed back to the lanes in 2^k subslices of 2^n elements.
Index Terms- Vector microprocessor, strided vectors, conflict free access, L2 caches.

A. Seznec and R. Espasa, "Conflict-Free Accesses to Strided Vectors on a Banked Cache," in IEEE Transactions on Computers, vol. 54, no. , pp. 913-916, 2005.
81 ms
(Ver 3.3 (11022016))