Abstract
Although directory-based write-invalidate cache coherence protocols have a potential to improve the performance of large-scale multiprocessors, coherence misses limit the processor utilization. Therefore, so called competitive-update protocols — hybrid protocols between write-invalidate and write-update — have been considered as a means to reduce the coherence miss rate and have been shown to be a better coherence policy for a wide range of applications. Unfortunately such protocols may cause high traffic peeks for applications with extensive use of migratory objects. These traffic peeks can offset the performance gain of a reduced miss rate if the network bandwidth is not sufficient.
We propose in this study to extend a competitive-update protocol with a previously published adaptive mechanism that can dynamically detect migratory objects and reduce the coherence traffic they cause. Detailed architectural simulations based on five scientific and engineering applications show that this adaptive protocol can outperform a write-invalidate protocol by reducing the miss rate and bandwidth need by as much as 71% and 26%, respectively.
Preview
Unable to display preview. Download preview PDF.
References
M. Brorsson, F. Dahlgren, H. Nilsson, and P. Stenström, “The CacheMire Test Bench — A Flexible and Effective Approach for Simulation of Multiprocessors”, In Proceedings of the 26th Annual Simulation Symposium, pp. 41–49, March 1993
A.L. Cox and R.J. Fowler, “Adaptive Cache Coherency for Detecting Migratory Shared Data”, In Proceedings of the 20th International Symposium on Computer Architecture, pp. 98–108, May 1993
K. Gharachorloo, A. Gupta, and J. Hennessy, “Performance Evaluation of Memory Consistency Models for Shared-Memory Multiprocessors”, In Proceedings of ASPLOS IV, pp. 245–257, April 1991
A. Gupta and W-D. Weber, “Cache Invalidation Patterns in Shared-Memory Multiprocessors”, IEEE Transaction on Computers, 41(7), pp. 794–810, July 1992
D. Lenoski, J. Laudon, K. Gharachorloo, W-D. Weber, A. Gupta, J. Hennessy, M. Horowitz, and M. Lam, “The Stanford DASH Multiprocessor”, IEEE Computer, 25(3):63–79, March 1992
H. Nilsson, P. Stenström, and M. Dubois, “Implementation and Evaluation of Update-Based Cache Protocols Under Relaxed Memory Consistency Models”, Technical Report, Dept. of Computer Engineering, Lund University, Sweden, July 1993
H. Nilsson and P. Stenström, “Evaluation of Adaptive Update-Based Cache Protocols”, Technical Report, Dept. of Computer Engineering, Lund University, Sweden, March 1994
J-P. Singh, W-D. Weber, and A. Gupta. “SPLASH: Stanford parallel applications for shared-memory”, Computer Architecture News, 20(1):5–44, March 1992
P. Stenström, “A Survey of Cache Coherence Schemes for Multiprocessors”, IEEE Computer, 23(6): 12–24, June 1990
P. Stenström, F. Dahlgren, and L. Lundberg, “A Lockup-free Multiprocessor Cache Design”, In Proceeding of 1991 International Conference on Parallel Processing, Vol. I, pp. 246–250, August 1991
P. Stenström, M. Brorsson, and L. Sandberg, “An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing”, In Proceedings of the 20th International Symposium on Computer Architecture, pp. 109–118, May 1993
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nilsson, H., Stenström, P. (1994). An adaptive update-based cache coherence protocol for reduction of miss rate and traffic. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_115
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_115
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive