In computer science, a cache ( ) is a collection of data duplicating original values stored elsewhere or computed earlier, where the original data is expensive to fetch (owing to longer access time) or to compute, compared to the cost of reading the cache. In other words, a cache is a temporary storage area where frequently accessed data can be stored for rapid access. Once the data is stored in the cache, it can be used in the future by accessing the cached copy rather than re-fetching or recomputing the original data.
Welcome to CWAnswers
CWAnswers is your guide to the sprawling world wide web. The directory aims to provide a useful guide made by users. You can share your knowledge as well - simply sign up and edit your first entry. For questions just contact the team at support - at - cwanswers.com.
Weblinks for Caching
Top 10 for Caching
Things about Caching you find nowhere else.
Select content modules
Rails Envy: Ruby on Rails Caching Tutorial
... different types of caching, I'm going to split this up into several blog entries. ... page caching to speed things up, we could go into our blog controller ...www.railsenvy.com/2007/2/28/rails-caching-tutorialcaching | The Blog Herald
Movable Type Monday: Profanity Filters, Blog Link, and Speed Improvements ... Tags: caching, Google Sitemaps, Movable Type, Movable Type Monday, photo gallery, ...www.blogherald.com/tag/caching/Response caching in IIS7 : Kanwaljeet Singla's Blog : The Official ...
Home " Blogs " Kanwaljeet Singla's Blog " Response caching in IIS7. Response caching in IIS7 ... Hiroshi Okunushi's blog. December 4, 2006 ...blogs.iis.net/ksingla/archive/2006/11/16/caching-in-iis7.asp...Rails Envy: Ruby on Rails Caching Tutorial - Part 2
Fragment Caching. Cleaning the Fragment Cache. Paginating with the Fragment Cache ... This new caching code will create /localhost:3000/blog/list.page=1.cache when I ...www.railsenvy.com/2007/3/20/ruby-on-rails-caching-tutorial-p...Official Google Blog: Net neutrality and the benefits of caching
(Cross-posted from the Google Public Policy Blog) ... Edge caching is a common practice used by ISPs and application and content ...googleblog.blogspot.com/2008/12/net-neutrality-and-benefits-...In computer science, a cache ( ) is a collection of data duplicating original values stored elsewhere or computed earlier, where the original data is expensive to fetch (owing to longer access time) or to compute, compared to the cost of reading the cache. In other words, a cache is a temporary storage area where frequently accessed data can be stored for rapid access. Once the data is stored in the cache, it can be used in the future by accessing the cached copy rather than re-fetching or recomputing the original data.
A cache has proven to be extremely effective in many areas of computing because access patterns in typical computer applications have locality of reference. There are several kinds of locality, but this article primarily deals with data that are accessed close together in time (temporal locality). The data might or might not be located physically close to each other (spatial locality).
History
Use of the word cache in the computer context originated in 1967 during preparation of an article for publication in the IBM Systems Journal. The paper concerned an exciting memory improvement in Model 85, a latecomer in the IBM System/360 product line. The Journal editor, Lyle R. Johnson, pleaded for a more descriptive term than high-speed buffer. When none was forthcoming, he suggested the noun cache, from the French noun meaning a safekeeping or storage place . The paper was published in early 1968, the authors were honoured by IBM, their work was widely welcomed and subsequently improved upon, and cache soon became standard usage in computer literature.
Operation
A cache is a block of memory for temporary storage of data likely to be used again. The CPU and hard drive frequently use a cache, as do web browsers and web servers.
A cache is made up of a pool of entries. Each entry has a datum (a nugget of data) which is a copy of the datum in some backing store. Each entry also has a tag, which specifies the identity of the datum in the backing store of which the entry is a copy.
When the cache client (a CPU, web browser, operating system) wishes to access a datum presumably in the backing store, it first checks the cache. If an entry can be found with a tag matching that of the desired datum, the datum in the entry is used instead. This situation is known as a cache hit. So, for example, a web browser program might check its local cache on disk to see if it has a local copy of the contents of a web page at a particular URL. In this example, the URL is the tag, and the contents of the web page is the datum. The percentage of accesses that result in cache hits is known as the hit rate or hit ratio of the cache.
The alternative situation, when the cache is consulted and found not to contain a datum with the desired tag, is known as a cache miss. The previously uncached datum fetched from the backing store during miss handling is usually copied into the cache, ready for the next access.
























