Abstract
Some memory writes have the particular behaviour of not modifying memory since the value they write is equal to the value before the write. These kind of stores are what we call Redundant Stores. In this paper we study the behaviour of these particular stores and show that a significant saving on memory traffic between the first and second level caches can be avoided by exploiting this feature. We show that with no additional hardware (just a simple comparator) and without increasing the cache lalency, we can achieve on average a 10% of memory traffic reduction.
Preview
Unable to display preview. Download preview PDF.
References
D. Burger, J. R. Goodman, and A. Kägi, “Quantifying Memory Bandwidth Limitations of Current and Future Microprocessors”. In Proc. of the 23rd Int. Symp. on Computer Architecture, 1996.
T.-F. Chen and J.-L. Baer. “A performance Study of Software and Hardware Data Prefetching Schemes”. In Proc. of the 21st Int. Symp. on Computer Architecture, 1994
J. González and A. gonzález. “Speculative Execution via Address Prediction and Data Prefetching”. In Proc. of the 11th ACM Int. Conf. on Supercomputing, 1997.
J. R. Goodman, “Using Cache Memory to Reduce Processor Memory Traffic” In Proc. of the 10th Int. Symp. on Computer Architecture, 1983.
N.P. Jouppi. “Improving Direct-Mapped Cache Performance by the Addition of Small Fully Associative Cache and Prefetch Buffers”. In Proc. of the 17th Int. Symp. on Microarchitecture, 1990.
D.M. Tullsen, S.J. Eggers and H.M. Levy, “Simultaneous Multithreading: Maximizing On-Chip Parallelism”. In Proc. of the 22nd Int. Symp. on Computer Architecture, 1995
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Molina, C., González, A., Tubella, J. (1999). Reducing memory traffic via redundant store instructions. In: Sloot, P., Bubak, M., Hoekstra, A., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0100700
Download citation
DOI: https://doi.org/10.1007/BFb0100700
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65821-4
Online ISBN: 978-3-540-48933-7
eBook Packages: Springer Book Archive