Cache Data Structure

From GM-RKB
Jump to navigation Jump to search

A Cache Data Structure is a data structure that can temporarily hold and retrieve main memory contents that are predicted to be accessed again in the near future.



References

2013

  • http://en.wikipedia.org/wiki/Cache_%28computing%29
    • In computer science, a cache ( /ˈkæʃ/ Template:Respell)[1] is a component that transparently stores data so that future requests for that data can be served faster. The data that is stored within a cache might be values that have been computed earlier or duplicates of original values that are stored elsewhere. If requested data is contained in the cache (cache hit), this request can be served by simply reading the cache, which is comparatively faster. Otherwise (cache miss), the data has to be recomputed or fetched from its original storage location, which is comparatively slower. Hence, the greater the number of requests that can be served from the cache, the faster the overall system performance becomes.

      To be cost efficient and to enable an efficient use of data, caches are relatively small. Nevertheless, caches have proven themselves in many areas of computing because access patterns in typical computer applications have locality of reference. References exhibit temporal locality if data is requested again that has been recently requested already. References exhibit spatial locality if data is requested that is physically stored close to data that has been requested already.

  1. "Cache". Merriam-Webster Online Dictionary. Merriam-Webster, Incorporated. http://www.merriam-webster.com/dictionary/cache. Retrieved 2 May 2011. 

1995

  • (Su & Despain, 1995) ⇒ Ching-Long Su, and Alvin M. Despain. (1995). “Cache design trade-offs for power and performance optimization: a case study.” In: Proceedings of the 1995 international symposium on Low power design. http://dl.acm.org/citation.cfm?id=224093
  • (Wulf & McKee, 1995) ⇒ Wm A. Wulf, and Sally A. McKee. (1995). “Hitting the memory wall: implications of the obvious.” In: ACM SIGARCH computer architecture news 23, no. 1. http://dl.acm.org/citation.cfm?id=216588

1982