Memory system support for dynamic cache line assembly

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The effectiveness of cache-based memory hierarchies depends on the presence of spatial and temporal locality in applications. Memory accesses of many important applications have predictable behavior but poor locality. As a result, the performance of these applications suffers from the increasing gap between processor and memory performance. In this paper, we describe a novel mechanism provided by the Impulse memory controller called Dynamic Cache Line Assembly that can be used by applications to improve memory performance. This mechanism allows applications to gather on-the-fly data spread through memory into contiguous cache lines, which creates spatial data locality where none exists naturally. We have used dynamic cache line assembly to optimize a random access loop and an implementation of Fast Fourier Transform (FFTW). Detailed simulation results show that the use of dynamic cache line assembly improves the performance of these benchmarks by up to a factor of 3.2 and 1.4, respectively. © 2001 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhang, L., Pingali, V. K., Chandramouli, B., & Carter, J. B. (2001). Memory system support for dynamic cache line assembly. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2107, 56–70. https://doi.org/10.1007/3-540-44570-6_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free