Abstract
As the advances in hardware technology, the gap between fast CPU and the slow memory system is increased severely also in sequential computer systems. Hierarchical memory systems are used in sequential computers to bridge the gap. Cache is a widely used mechanism in the memory hierarchy. But it has been found that cache performance is not satisfying for many important application algorithms since its hit ratio is very low for many frequently data access patterns due to conflict use of the cache lines. This problem shares some similarity with the problem of memory module access conflict in parallel memory systems discussed in Chapter 10. In addition, some special issue (data reuse rate) need to be considerate in cache systems. We will discuss the cache line conflict problem and some techniques to solve it in this chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Agarwal, S.D. Pudar, Column-Associative Caches: A Technique for Reducing the Miss Rate of Direct-Mapped Caches, Proceedings of the International Symposium on Computer Architecture, 179–190, 1993.
J.M Felman, C.T Retter, Computer Architecture, A Designer Text Based on Genetic RISC, McGraw-Hill Inc. New York, 1994.
J.M Frailong, W. Jalby, and J. Lenfant, XOR Schemes: A Flexible Data Organization in Parallel Memories, Proceedings of the 1985 International Conference on Parallel Processing, Aug, 276–283, 1985.
Q. Gan, Hierarchical memory and high performance computation, Master Thesis, Institute of Computing Technology, Chinese Academy of Sciences, June 1997.
D. Gannon, W. Jalby, and K. Gallivan, Strategies for cache and local memory management by global program transformation, Journal of Parallel and Distributed Computing,5:587–616, 1988.
Y. Gao, Vector Cache with Skewing, MS Thesis, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China, May, 1994.
R. Gonzalez and R. Woods, Digital image processing, AddisonWelsley, 1993.
A. Gonzalez, M. Valero, N. Topham, and J. Parcerisa, On the Effectiveness of XOR-Mapping Schemes for Cache Memories, UPC, Spain, Report Number: UPC-CEPBA-1996–14.
R. Haralick and L. Shapiro, Computer and robot vision, Addison-Wesley, 1993.
A. Jain and R. Dubes, Algorithms for clustering data, Prentice Hall, 1988.
N. Jouppi, Improving Direct-Mapped Cache Performance by the Addition of a Small Fully-Associative Cache and Prefetch Buffers, Proceedings of the International Symposium on Computer Architecture, 364–373,1990.
K. Hwang, Advanced Computer Architecture, MeGraw-Hill, Inc., 1993.
M.S. Lam, E.E RothBerg, and M.E. Wolf, The Cache Performance and Optimization of Blocked Algorithms, Proceedings of ASPLOS’91, 63–74,1991.
A. Lebeck and D. Wood, Cache Profiling and the SPEC Benchmarks: A Case Study, Computer, 27(10):15–26,October 1994.
H. Li, Performance Analysis of Cache with XOR Mapping, MS Thesis, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China, May, 1995.
E. Li and Z. Liu, LR: An Efficient Scheme for Parallel Memory Systems, Science in China (Series E), 28(2):1–7, February 1998.
Z. Liu, X. Li and J. You, An Adaptive Memory System for Image Processing, Proceedings of Vision Interface’92, 163–168, 1992.
Z. Liu and H. Li, Parallel and Hierarchical Memory Systems, Proceedings of the 8th’ National Conference on Storage Systems, Xi’an, China, 1–10, October 1994.
Z. Liu and X. Li, XOR Storage Schemes for Frequently Used Data Patterns, Journal of Parallel and Distributed Processing, 25:162–173 1995.
Z. Liu, E. Li, and X. Qiao, XOR Mapping Technique for Data Caches, China Patent #97120245.1, Pending, Nov. 6, 1997.
S.A. Mckee et. al., Smarter memory: improving bandwidth for streamed references, IEEE Computer,54–63, July, 1998.
E.A. Melton et al, Mechanism for the Randomization of Cache Access Utilizing a Bit-Matrix Multiplication of Cache Addresses, US Patent 5,133,061, July 21, 1992.
SGI Inc., Power Challenge Technical Report, 1996.
J.K. Peir et. al., Techniques to enhance cache performance across parallel program sections, Proc. of the Int. Conf. on Parallel Processing, CRC Press Inc., I: 12–19, Aug., 1993.
X.Z. Qiao, Cache performance and algorithm optimization, Proc. of HPCAsia’97, IEEE Press, 2:12–17, May 1997.
X. Qiao et al, Cache Optimization in Scientific Computations, Proceedings of the 1999 ACM Symposium on Applied Computing, 548–552, February 28 --- March 2, 1999.
A. Seznec, A Case for Two-Way Skewed Associative Caches, Proceddings of the 20`h International Symposium on Computer Architecture, 169–178, 1993.
Q. Yang, Performance of Cache Memories for Vector Computers, Journal of Parallel and Distributed Computing, 19:163–178, 1993.
Q. Yang, Introducing a Conflict free Cache Design, in Practical Aspects of Parallel Computing, (ed. By L.Tao and T.Li), International Academic Publishers, 19–33, 1995.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zhang, D., Li, X., Liu, Z. (2001). Data Management for Sequential Computer Systems. In: Data Management and Internet Computing for Image/Pattern Analysis. The International Series on Asian Studies in Computer and Information Science, vol 11. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1527-2_11
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1527-2_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5598-4
Online ISBN: 978-1-4615-1527-2
eBook Packages: Springer Book Archive