Cache (computing) | Wikipedia audio article
Channel: wikipedia tts
Date: 2019-01-13

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Cache_(computing)


00:01:11 1 Motivation
00:01:44 1.1 Latency
00:02:23 1.2 Throughput
00:03:16 2 Operation
00:05:57 2.1 Writing policies
00:09:00 3 Examples of hardware caches
00:09:10 3.1 CPU cache
00:09:51 3.2 GPU cache
00:11:24 3.3 DSPs
00:11:56 3.4 Translation lookaside buffer
00:12:25 4 Software caches
00:12:34 4.1 Disk cache
00:13:58 4.2 Web cache
00:15:09 4.3 Memoization
00:15:47 4.4 Other caches
00:17:35 5 Buffer vs. cache



Listening is a more natural way of learning, when compared to reading. Written language only began at around 3200 BC, but spoken language has existed long ago.

Learning by listening is a great way to:
- increases imagination and understanding
- improves your listening skills
- improves your own spoken accent
- learn while on the move
- reduce eye strain

Now learn the vast amount of general knowledge available on Wikipedia through audio (audio article). You could even learn subconsciously by playing the audio while you are sleeping! If you are planning to listen a lot, you could try using a bone conduction headphone, or a standard speaker instead of an earphone.

Listen on Google Assistant through Extra Audio:
https://assistant.google.com/services/invoke/uid/0000001a130b3f91
Other Wikipedia audio articles at:
https://www.youtube.com/results?search_query=wikipedia+tts
Upload your own Wikipedia articles through:
https://github.com/nodef/wikipedia-tts
Speaking Rate: 0.8899543578635742
Voice name: en-AU-Wavenet-A


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
In computing, a cache ( kash, or  kaysh in AuE) is a hardware or software component that stores data so that future requests for that data can be served faster; the data stored in a cache might be the result of an earlier computation or a copy of data stored elsewhere.  A cache hit occurs when the requested data can be found in a cache, while a cache miss occurs when it cannot.  Cache hits are served by reading data from the cache, which is faster than recomputing a result or reading from a slower data store; thus, the more requests that can be served from the cache, the faster the system performs.
To be cost-effective and to enable efficient use of data, caches must be relatively small. Nevertheless, caches have proven themselves in many areas of computing, because typical computer applications access data with a high degree of locality of reference. Such access patterns exhibit temporal locality, where data is requested that has been recently requested already, and spatial locality, where data is requested that is stored physically close to data that has already been requested.