<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>system RAM Archives - NeuralLantern.com</title>
	<atom:link href="https://www.NeuralLantern.com/tag/system-ram/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.NeuralLantern.com/tag/system-ram/</link>
	<description></description>
	<lastBuildDate>Sun, 29 Jun 2025 00:48:45 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>

<image>
	<url>https://www.NeuralLantern.com/wp-content/uploads/2025/04/cropped-2025-04-04-Lantern-03-32x32.png</url>
	<title>system RAM Archives - NeuralLantern.com</title>
	<link>https://www.NeuralLantern.com/tag/system-ram/</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>Caching &#038; Memory Hierarchy: How CPUs, RAM, &#038; Disks Boost Performance</title>
		<link>https://www.NeuralLantern.com/caching-memory-hierarchy-how-cpus-ram-disks-boost-performance/</link>
					<comments>https://www.NeuralLantern.com/caching-memory-hierarchy-how-cpus-ram-disks-boost-performance/#respond</comments>
		
		<dc:creator><![CDATA[mike]]></dc:creator>
		<pubDate>Sat, 28 Jun 2025 14:00:00 +0000</pubDate>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Videos]]></category>
		<category><![CDATA[cache hit]]></category>
		<category><![CDATA[cache miss]]></category>
		<category><![CDATA[caching]]></category>
		<category><![CDATA[computer performance]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[CPU cache]]></category>
		<category><![CDATA[CPU registers]]></category>
		<category><![CDATA[hard drive]]></category>
		<category><![CDATA[internet caching]]></category>
		<category><![CDATA[memory hierarchy]]></category>
		<category><![CDATA[memory storage]]></category>
		<category><![CDATA[processor cache]]></category>
		<category><![CDATA[RAM vs disk]]></category>
		<category><![CDATA[system RAM]]></category>
		<category><![CDATA[tech explainer]]></category>
		<guid isPermaLink="false">https://www.NeuralLantern.com/?p=168</guid>

					<description><![CDATA[<p>Explore caching &#038; memory hierarchy! How CPU registers, RAM, &#038; disks boost speed. Clear, fun guide for all!</p>
<p>The post <a href="https://www.NeuralLantern.com/caching-memory-hierarchy-how-cpus-ram-disks-boost-performance/">Caching &amp; Memory Hierarchy: How CPUs, RAM, &amp; Disks Boost Performance</a> appeared first on <a href="https://www.NeuralLantern.com">NeuralLantern.com</a>.</p>
]]></description>
										<content:encoded><![CDATA[
<figure class="wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio"><div class="wp-block-embed__wrapper">
https://www.youtube.com/watch?v=ayLwAJVMdAA
</div></figure>



<p>Join us for a fun dive into caching &amp; the memory hierarchy! Learn how CPU registers, RAM, &amp; hard drives balance speed &amp; storage to make your computer lightning fast. From cache hits to internet browsing, we break it down in a clear, beginner-friendly way. Subscribe for more tech explainers &amp; hit that like button to support the channel! Scan the QR code for more tutorials &amp; resources. Let’s geek out together!</p>



<p>Introduction to Caching 00:00:00<br>What is Caching? 00:00:10<br>Memory Units: Size vs. Speed 00:00:14<br>CPU Registers vs. System Memory 00:00:33<br>Benefits of Caching 00:01:05<br>Access Patterns and Algorithms 00:01:24<br>Cache Hit and Miss 00:02:48<br>Data Movement in Cache 00:04:51<br>Cache Purging 00:05:57<br>Multiple Cache Levels 00:07:15<br>Internet Caching Example 00:09:28<br>Memory Hierarchy Pyramid 00:12:34<br>Volatile Memory and Registers 00:13:16<br>Processor Cache and RAM 00:13:48<br>Slower Storage Types 00:14:38<br>Conclusion and Subscribe Request 00:15:12</p>



<p>Thanks for watching!</p>



<p>Find us on other social media here:</p>



<ul class="wp-block-list">
<li>https://www.NeuralLantern.com/social</li>
</ul>



<p>Please help support us!</p>



<ul class="wp-block-list">
<li>Subscribing + Sharing on Social Media</li>



<li>Leaving a comment or suggestion</li>



<li>Subscribing to our Blog</li>



<li>Watching the main &#8220;pinned&#8221; video of this channel for offers and extras</li>
</ul>



<p>Hello there. I&#8217;d like to talk to you about caching and the hierarchy of memory.</p>



<p>So for starters, what is caching?</p>



<p>Simply put, sometimes we have memory units or storage units that are very, very big because they&#8217;re cheap,</p>



<p>but that also makes them very, very slow.</p>



<p>And sometimes we have storage units that are very, very fast and thus expensive and thus very, very, very small.</p>



<p>and thus very, very, very small.</p>



<p>For example, if we had like a, let&#8217;s say a CPU</p>



<p>and we were just talking about the memory</p>



<p>that the CPU itself could hold in its CPU registers,</p>



<p>we have a very small number of registers inside of the CPU</p>



<p>compared to system RAM or disks or whatever.</p>



<p>So we can&#8217;t actually hold that much memory,</p>



<p>but at the same time, the CPU registers are lightning fast,</p>



<p>lightning fast, even compared to system memory.</p>



<p>So that kind of sucks, right?</p>



<p>right because the system memory is way slower than the CPU registers why can&#8217;t</p>



<p>we just have more registers well it&#8217;s too expensive so caching is something</p>



<p>that you can kind of use to get the best of both worlds you can have something</p>



<p>that&#8217;s very very fast be your primary place that you try to store things and</p>



<p>look for things to get them and set them and then when it runs out of space you</p>



<p>can just kind of push things to something that&#8217;s a little bit slower but</p>



<p>there&#8217;s a pattern of access that actually makes sense.</p>



<p>Hopefully you&#8217;re not accessing your data and instructions in a totally random way.</p>



<p>So that when you access in a pattern,</p>



<p>then algorithms inside the machine and the operating system can kind of figure out</p>



<p>which items are best to take out of the small storage device.</p>



<p>And that way we can sort of keep the most frequently or the most often</p>



<p>or the most recently used things inside of the fastest device.</p>



<p>This is kind of a way to get the best of both worlds, kind of a way to leverage the best of both worlds.</p>



<p>Okay, so what am I kind of talking about?</p>



<p>Let&#8217;s just suppose for the sake of argument, let me draw this a little bit.</p>



<p>Suppose for the sake of argument, you have something that&#8217;s really, really slow, but it&#8217;s huge.</p>



<p>A huge storage thing.</p>



<p>Maybe this is your disk.</p>



<p>Maybe this is your system RAM.</p>



<p>I don&#8217;t know.</p>



<p>There&#8217;s many levels to this.</p>



<p>a little bit faster and thus a little bit more expensive but it&#8217;s slower and then maybe you have</p>



<p>something else that is like really really fast but it&#8217;s super expensive so we can only make a</p>



<p>really really small version of it right so imagine that uh you know you are the i don&#8217;t know we&#8217;ll</p>



<p>say the user the user of these things is actually usually just like the cpu or something but let&#8217;s</p>



<p>say that you&#8217;re the user and you want to look and see if some piece of data you want is stored in</p>



<p>is stored in there. Maybe you have memory location of 45 or something or 44 that you</p>



<p>want to check for. You&#8217;re like what what is the data at memory location 44? I&#8217;m</p>



<p>totally making this up that we wouldn&#8217;t look at memory location 44 but suppose</p>



<p>you are. So if memory location 44 or this item whatever that you&#8217;re looking for is</p>



<p>in the super small and fast thing then awesome you don&#8217;t need to look any</p>



<p>further. But if it&#8217;s not we&#8217;ll call that a cache miss. We&#8217;ll say well it&#8217;s not in</p>



<p>we&#8217;ll say well it&#8217;s not in there whoops it&#8217;s not in there so we call that a miss for a cache and</p>



<p>that means we just have to check the next thing we&#8217;ll say all right well if it&#8217;s not in there is</p>



<p>it in the next fastest thing the thing that&#8217;s like a little bit slower and a little bit bigger if it&#8217;s</p>



<p>in there we call that a hit we would call it a hit if we found it on the first try also but if it&#8217;s</p>



<p>in there we call it a hit and if it&#8217;s not in there we call it another miss so we&#8217;ll say miss and then</p>



<p>And then finally we&#8217;ll check maybe the biggest thing that we have available and we&#8217;ll go all right is it is it in the giant thing?</p>



<p>And usually it is going to be in the giant thing because if we&#8217;re talking about program instructions or program data or something like that</p>



<p>You know the data is at least going to be on your disk drive in almost every case right so or your hard drive</p>



<p>so</p>



<p>You could imagine maybe this green thing is the</p>



<p>CPU registers or the CPU cache or something very very very fast and you can imagine this blue thing here is</p>



<p>is perhaps system RAM.</p>



<p>It&#8217;s like a little bit bigger, a little bit faster.</p>



<p>And then the red thing is your hard disk,</p>



<p>which does definitely have all the data,</p>



<p>but it&#8217;s really, really, really slow.</p>



<p>And we&#8217;re hoping not to try to touch the red thing</p>



<p>because it&#8217;s going to cost us a lot more time.</p>



<p>And then same thing for the blue.</p>



<p>So the first time we look for this piece of data,</p>



<p>you know, we missed twice</p>



<p>because it was only in the red thing,</p>



<p>you know, the disk, that we&#8217;ll call it.</p>



<p>But then suppose we come along later</p>



<p>later and we look for that piece of data again maybe we&#8217;re inside of a loop maybe our function</p>



<p>gets called multiple times and for whatever reason we check whenever when we when we originally found</p>



<p>the data in the red box by the way it was sent up through the cache and sort of copied into all the</p>



<p>other devices so you know when we couldn&#8217;t find our data anywhere in the green or blue the it was</p>



<p>copied from the red to the blue and then to the green also so it&#8217;s actually everywhere and then</p>



<p>And then the next time we try to look for that same piece of data, we&#8217;ll have a hit because it&#8217;s just sitting in the CPU or sorry, not the CPU, but just the fastest thing, which you could imagine as being the CPU or the CPU cache or something.</p>



<p>Right. So notice how once we have a hit, there&#8217;s not really any need to go look onto the slower devices.</p>



<p>based on how often you need that data or how recently you&#8217;ve used that data or whatever.</p>



<p>So great. We have a lot of hits. We&#8217;re now getting lightning speed because we&#8217;re just like reading</p>



<p>only from that green area. Suppose some time passes and you start filling up the green thing,</p>



<p>the fastest thing with lots of other data and it overflows because it is a small place for data.</p>



<p>So eventually we&#8217;ll have to start purging some of the data that we&#8217;re not using anymore. And maybe</p>



<p>is awful i&#8217;m still getting used to this pen let me just try one more time oh when i lift up the</p>



<p>pen it kind of drags a bit um so we&#8217;ve kind of filled up the green area and there&#8217;s not enough</p>



<p>room for all the data that we want the system realizes that ox44 hasn&#8217;t been used in a while</p>



<p>it doesn&#8217;t seem to be a part of the current working window data set and so we&#8217;ll just</p>



<p>purge it so the system just says all right let&#8217;s just erase that from the green</p>



<p>it from the green the fastest storage device it might not erase it from the</p>



<p>blue because the blue is bigger it can hold more data before we start having to</p>



<p>erase things right so that means there&#8217;s a pretty good chance it&#8217;s sitting in the</p>



<p>blue so if we try to access it again I&#8217;ll just put a red X here to indicate</p>



<p>that we have a miss so we miss the fastest device that sucks then we check</p>



<p>the next fastest device and it&#8217;s in there so we&#8217;re gonna call that a hit so</p>



<p>we didn&#8217;t get to use the fastest device but at the same time we also didn&#8217;t have to use</p>



<p>the slowest device so this is still kind of a win right suppose oh and then by the way once we find</p>



<p>that hit once we actually hit it from the blue device then the data gets carried back to the</p>



<p>green device the fastest device because the system now considers ox44 that address or that value</p>



<p>whatever to be part of the working set of data that we&#8217;re currently using so the moment we hit</p>



<p>it gets brought up to the fastest device in the hopes that maybe we&#8217;ll try to request it again</p>



<p>in the near future and save a bunch of processing time.</p>



<p>So suppose for the sake of argument, then a bunch more time passes</p>



<p>and it has to be purged again from the fastest device.</p>



<p>So, you know, we&#8217;re accessing lots of data.</p>



<p>We&#8217;re filling up that green thing again.</p>



<p>Eventually there&#8217;s not enough room.</p>



<p>We have to purge some old stuff.</p>



<p>So we purge the 44 there.</p>



<p>And then even more time passes.</p>



<p>And we have to also purge it from the medium speed device, the blue square.</p>



<p>Because that also can fill up at some point.</p>



<p>So that sucks.</p>



<p>We&#8217;ll never purge from the giant storage device,</p>



<p>which is like your disk drive usually or your hard drive.</p>



<p>So it&#8217;ll still be there.</p>



<p>Which means eventually when we try to request 44 again,</p>



<p>we&#8217;ll go through the original process.</p>



<p>We&#8217;ll just say, you know, going through…</p>



<p>Well, I&#8217;ll just write the word miss.</p>



<p>I&#8217;ll just write the word miss.</p>



<p>We&#8217;ll just go miss here.</p>



<p>And then we look here and it&#8217;s another miss.</p>



<p>And then we look here and it&#8217;s a hit.</p>



<p>I&#8217;ll put hit.</p>



<p>So in that case, when a lot of time passed</p>



<p>and all the other caches kind of filled up,</p>



<p>then we didn&#8217;t really get any benefit,</p>



<p>any performance boost from using caches.</p>



<p>In fact, we took a little bit of a penalty</p>



<p>on those two misses because we got to check one thing,</p>



<p>whoops, and then check another thing, whoops.</p>



<p>And then finally we hit the red thing,</p>



<p>red thing which is giant and has the data we wanted we could have just gone</p>



<p>there in the first place and saved a couple of you know some CPU cycles</p>



<p>because we wouldn&#8217;t have had to do the two misses but checking and missing is</p>



<p>part of the process of using a cache and so it&#8217;s worth it because you know most</p>



<p>of the time we&#8217;ll hopefully be hitting a lot of cache in the green area and even</p>



<p>more cache in the blue area so that&#8217;s the basic idea of caching kind of within</p>



<p>Let&#8217;s see what else that I want to show you here.</p>



<p>We got slow, medium, and large.</p>



<p>And maybe just another example that you might relate to more.</p>



<p>Suppose you go to an internet website and on the website there&#8217;s lots of images and</p>



<p>things like that.</p>



<p>Well, those images are usually cached on your local machine inside of your browser&#8217;s</p>



<p>cache area.</p>



<p>What am I even talking about?</p>



<p>First time you go to a website ever, the images get loaded from the internet.</p>



<p>very very very big because it&#8217;s like at this point in well I think since 2020 it</p>



<p>was over 64 zettabytes and a zettabyte is a trillion gigabytes so 64 trillion</p>



<p>gigabytes of data on the internet so huge right but the internet is kind of</p>



<p>slow even if you have a lightning fast connection it&#8217;s probably still slower</p>



<p>than accessing your local hard drive definitely way slower than accessing</p>



<p>your local memory although most people when I recorded this video have internet</p>



<p>slower than their disk drive or their SSD. Anyway, so the internet is huge, but it&#8217;s slow.</p>



<p>And I guess it&#8217;s cheap compared to the amount of storage and the speed you get.</p>



<p>So you download the image from the website from the internet. And that&#8217;s like takes a lot of time.</p>



<p>If you do that every single time, and there&#8217;s lots of images, you might feel like your internet</p>



<p>experience is slow, you might see images kind of like loading. You know, even in the modern era,</p>



<p>if they take just like a moment to load, then you kind of think like, whoa, there&#8217;s like a lot of</p>



<p>delay here, right? So, but then the first time we would call that, I guess, a miss on your local</p>



<p>cache, and then we would hit on the internet. So the first time you load it, it actually,</p>



<p>your browser will actually save a copy of that data to your local disk area. And well, the next</p>



<p>time you go to that website, instead of looking directly to the internet to get the images,</p>



<p>get the images your browser will look to see if you have a copy saved already locally on your on</p>



<p>your disk drive or your hard drive and if that&#8217;s true then your computer will just load the images</p>



<p>from the local machine and not from the internet and then your pages will seem like they load a lot</p>



<p>lot faster so that&#8217;s kind of the concept of caching in a slightly different way you know the fast</p>



<p>expensive thing is your is your hard drive the slow cheap thing is the internet you can imagine</p>



<p>many levels i mean this diagram that i drew there&#8217;s three levels in your cpu you have cpu</p>



<p>registers the fastest thing and then you have l1 cache which are almost as fast as the registers</p>



<p>and you have like some amount of kilobytes that you can store and then your cpu your cpu also has</p>



<p>l2 cache usually and then depending on what kind of cpu you have you might have l3 cache so that&#8217;s</p>



<p>four levels right there and then beyond that you know there&#8217;s system ram that can cache some data</p>



<p>cache some data for your CPU. It&#8217;s a lot slower than the CPU caches, but you know, it&#8217;s larger.</p>



<p>And, uh, uh, you know, eventually we can just get basically down to your hard drive,</p>



<p>uh, in the slowest case. So let&#8217;s see, what else can I tell you real fast? Oh,</p>



<p>I wanted to show you a diagram. Let&#8217;s see. So let me show you this diagram right here.</p>



<p>I found a diagram of this on Wikipedia. It&#8217;s called computer memory hierarchy.</p>



<p>And so this is what I talked about in the beginning of the video. We want to talk about</p>



<p>the beginning of the video we want to talk about like the hierarchy of memory</p>



<p>the hierarchy is kind of like a pyramid the reason it&#8217;s a pyramid is so that we</p>



<p>can kind of remember that stuff on the top is very small notice how the thing</p>



<p>on the top it has less area to work with and the things at the bottom have a lot</p>



<p>more area to work with so the thing that&#8217;s written in the middle here</p>



<p>actually let me go to let me go to the actual image of it because I think I</p>



<p>like it the way it looks a little bit better oh no I wanted to do this because</p>



<p>I wanted to do this because I already had it.</p>



<p>Okay.</p>



<p>So the things at the top have a very small size and a very small capacity.</p>



<p>And you can imagine some examples are processor registers, like our CPU registers.</p>



<p>But they&#8217;re very, very fast and they&#8217;re very expensive.</p>



<p>And there&#8217;s this little term written down here or this little description saying power on immediate term.</p>



<p>That just basically means this is volatile memory.</p>



<p>And so, you know, the moment you disable, the moment you disconnect power,</p>



<p>shut down your computer, you just lose that.</p>



<p>It&#8217;s just gone forever.</p>



<p>Then kind of, you know, getting a little bit bigger and also a little bit cheaper,</p>



<p>but also a little bit slower.</p>



<p>We have the small size, small capacity category.</p>



<p>You could imagine this is your processor cache, which is just, you know,</p>



<p>the cache on your processor is just a little data storage area.</p>



<p>You know, like I said before, that sort of backs up the CPU registers.</p>



<p>it&#8217;s where the registers first look for their cache. Still very fast and very expensive,</p>



<p>only a little bit cheaper and thus slower than the CPU registers. Then we have like medium size</p>



<p>and small size and large size and whatever. Different sizes and categories. So kind of</p>



<p>going from the fastest to the slowest here, once we hit cache, then we can consider this to be</p>



<p>the disk, but random access memory or system RAM is just a lot slower than the CPU, but</p>



<p>it&#8217;s faster than the disk.</p>



<p>And then you can imagine other things that are a little bit slower, but a little bit</p>



<p>larger could be flash memory, USB memory and so forth.</p>



<p>And then and then pretty slow here, the slowest that I ever deal with personally or hard drives,</p>



<p>even your SSD being way faster than your old disk drives is still considered very slow</p>



<p>compared to system RAM, but they&#8217;re huge, right?</p>



<p>But they&#8217;re huge, right?</p>



<p>And then kind of like at the very bottom of this pyramid is tape backup,</p>



<p>incredibly slow, but incredibly large for the money.</p>



<p>And that&#8217;s why this is sometimes used still.</p>



<p>And that, my friends, is the hierarchy of memory.</p>



<p>I hope you learned a little bit of stuff and you had a little bit of fun.</p>



<p>I&#8217;ll see you in the next video.</p>



<p>Hey, everybody.</p>



<p>Thanks for watching this video again from the bottom of my heart.</p>



<p>I really appreciate it.</p>



<p>I really appreciate it. I do hope you did learn something and have some fun</p>



<p>If you could do me a please a small little favor</p>



<p>Could you please subscribe and follow this channel or these videos or whatever it is?</p>



<p>You do on the current social media website that you&#8217;re looking at right now</p>



<p>It would really mean the world to me and it&#8217;ll help make more videos and grow this community</p>



<p>So we&#8217;ll be able to do more videos longer videos better videos or just I&#8217;ll be able to keep making videos in general</p>



<p>so please do do me a kindness and</p>



<p>Do me a kindness and subscribe.</p>



<p>You know, sometimes I&#8217;m sleeping in the middle of the night</p>



<p>and I just wake up because I know somebody subscribed or followed.</p>



<p>It just wakes me up and I get filled with joy.</p>



<p>That&#8217;s exactly what happens every single time.</p>



<p>So you could do it as a nice favor to me</p>



<p>or you could troll me if you want to just wake me up in the middle of the night.</p>



<p>Just subscribe and then I&#8217;ll just wake up.</p>



<p>I promise that&#8217;s what will happen.</p>



<p>Also, if you look at the middle of the screen right now,</p>



<p>you should see a QR code which you can scan in order to go to the website,</p>



<p>which I think is also named somewhere at the bottom of this video and it&#8217;ll take</p>



<p>you to my main website where you can just kind of like see all the videos I</p>



<p>published and the services and tutorials and things that I offer and all that</p>



<p>good stuff and if you have a suggestion for clarifications or errata or just</p>



<p>future videos that you want to see please leave a comment or if you just</p>



<p>want to say hey what&#8217;s up what&#8217;s going on you know just send me a comment</p>



<p>those in the middle of the night i get i wake up in a cold sweat and i&#8217;m like it would really it</p>



<p>really mean the world to me i would really appreciate it so again thank you so much for</p>



<p>watching this video and um enjoy the cool music as as i fade into the darkness which is coming for us</p>



<p>Thank you.</p>
<p>The post <a href="https://www.NeuralLantern.com/caching-memory-hierarchy-how-cpus-ram-disks-boost-performance/">Caching &amp; Memory Hierarchy: How CPUs, RAM, &amp; Disks Boost Performance</a> appeared first on <a href="https://www.NeuralLantern.com">NeuralLantern.com</a>.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://www.NeuralLantern.com/caching-memory-hierarchy-how-cpus-ram-disks-boost-performance/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
