But, what is Virtual Memory?
Вставка
- Опубліковано 9 тра 2024
- 🎬 Introduction to Virtual Memory 🎬
Let's dive into the world of virtual memory, which is a common memory management technique used in computer's operating system. It sits at the boundary of software and hardware, and it's the main reason why we can play video games and listen to the music at the same time without worrying about spotify crashing our Diablo 4.
🔑 Key Topics discussed in the video
📌 Understand the problems
📌 Understand the core principles behind virtual memory and how it solves these problems
📌 Understand how virtual memory is implemented
📌 Discuss various optimization techniques
🚀 If you found this video helpful, don't forget to like, share, and subscribe for more tech tutorials!
🔗 If you enjoy this video, please like, share, and subscribe for more enlightening tutorials.
📖 The Linux Programming Interface: Must read book about Linux kernel (affiliate link): www.amazon.com/Linux-Programm...
🌐 SiteGround: the hosting solution I like (affiliate link): www.siteground.com/index.htm?...
🔗 Connect with me:
Support me on patreon: / techwithnikola
LinkedIn: / nikola-stojiljkovic-67...
Join my discord: / discord
Visit my blog: techwithnikola.com
Follow me on Instagram: / techwithnikola
Follow me on Twitter: / techwithnikola
Timecodes
00:00 - Intro
00:19 - Problem: Not Enough Memory
01:17 - Problem: Memory Fragmentation
02:20 - Problem: Security
03:10 - Key Problem
04:42 - Solution: Not Enough Memory
05:58 - Solution: Memory Fragmentation
06:32 - Solution: Security
07:30 - Virtual Memory Implementation
09:49 - Page Table
10:40 - Example: Address Translation
11:54 - Page Faults
13:28 - Recap
14:18 - Translation Lookaside Buffer (TLB)
15:46 - Example: Address Translation with TLB
16:57 - Multi-Level Page Tables
18:48 - Example: Address Translation with Multi-Level Page Tables
19:58 - Outro - Наука та технологія
Holy crap. UA-cam algorithm finally came through. This is some amazing content.
Thank you :-)
Hey if you are seeing this, let me tell you, this is the best video in UA-cam if you want to understand the concept of virtual memory, and others in simple and sweet. Perfect! ❤
Thank you! :)
Not really. He forget that OS claims RAM too
@@siegfriedbarfuss9379 3:54
@@siegfriedbarfuss9379 Why is that relevant to this demonstration? You could just generalise an OS as another program? It's also shown at 3:58...
This might be the best content I have found on UA-cam this year. You explained these concepts in ways my teachers couldn’t, and you did it for free too ! You have my respect , and subscription haha !
Fantastic video. I'm taking a OS course at university and we have a virtual memory assignment. The hand out documents left me feeling confused and a bit lost, but then this 20-minute video made all concepts clear as day. Thank you for putting effort into making these videoes, you earned a new subscriber!
I’m glad it was helpful. You’re welcome, and thank you for taking the time to comment.
There's a quite good reason 4 KB is used as a standard page size. In most disk partitioning software the minimum data you can read/write to is 4KB, so it can move it in one swoop
yeah i figured this was the reason and was wondering why he didn't say so
Thanks. I didn’t know that. Do you have any material or references that provide motivation for 4KB page size? I read some articles that suggest it was chosen empirically long time ago, but I’d like to learn more about it.
This is simply untrue if you grew up during the 80’s or 90’s (or, shoot, even later). Research something called a “filesystem”. Also while you’re at it, check out an article on “Solid State Drives” or “Flash Memory” or “NVRAM” if you’re wondering why 4K is the block size. 😂😂😂
@@TechWithNikola They probably choose it because 0x1000 is pretty nice to type. ARM macs use 16kb pages I think.
Thank you for the video. The explanation was clear, structured and concise, better than most other explanations on youtube.
Thanks a lot for the kind words and for taking the time to leave the comment. I'm so happy to hear that you've liked the video!
I had a course back when i was in engineering school, the professor did a horrible job explaining memory and virtual memory, I ended up hating the class and i never really understood how it worked. until this day when I watched your video, you did an excellent job, I wish youtube had something like this before. Fast forward today, I work as a sysadmin/infra engineer and i really didn't have an idea how virtual memory works, again until I watched your video, thank you for the effort you put here, I am sure many will watch it and gain valuable informations.
This is amazing! More detail than most Operating System courses in 20 minutes. Awestruck!
Amazing explanation, always wanted to know core knowledge. Thanks, keep up with these videos!
Thank you Dusan. I'm glad you've enjoyed it :)
I wanna thank the youtube algorithm for recommending this video. This is absolute gem for explaining the Virtual Memory concept.
That's a very good, high quality production with a top notch explanation! Keep making more.
Thanks :)
Excellent description on how cpu/memory/os are working together! Well done!
This video is really good, the way that you simplified Virtual Memory is amazing!
Wow! Clear, concise and very neat animations! Subscribing to a channel after a long time!
Thank you for the sub!
Dude, you're videos are so helpful, thanks so much!!!
From Aritmetic concepts , the virtual memóry obeys bijective function (injective and surjective ) about Domain and Image .
It is unbelievable !
Svaka cast burazeru. Ovo sam na faksu radio, ali si dosta bolje objasnio.
Hvala :) Drago mi je sto cujem da je dobro objasnjeno.
the graphics really helped me visualize how this works! youre a lifesaver ^^
I'm glad! Graphics are a great tool for explain IMO :-)
@@TechWithNikola It's not just your opinion. It's a FACT! Graphics for complicated ideas are a must!
And thank you, your video was amazing!
Wonderful illustration of Virtual Memory. Good Job !
I have to words! That video is amazing! You won yourself a new subscriber, my friend! ❤
This is awesome, made things so clear to me. Thank you.
You're welcome. Glad it helped!
Thanks! You explained this better than any professor did when I was still in university. Much appreciated, will be sending this video to people who ask me about this 😅
What an excellent overview. Nice job. It clarified a few things i was unclear about.
Thanks a lot. Glad it clarified things :-)
Your explanations are amazing
Thank you, I hope to see more
An excellent, succint and illustrative explanation :)
Thanks a lot Andrej!
Im just sitting here fascinated...and it makes sense.. knowing just the basics... nice work...a dumb thing to say but this is relaxing...straight to the point ..ask a question ...then answer it... terrific
Wooow this video is awesome! Great work on the animations and examples 🤝😎
Thank you so much! I'm glad to hear that you've liked it.
please never stop, really good video
Thank you! I'm glad you've enjoyed it. I'll keep making them for sure :)
Great video ! I am preparing for my master degree and found this gold in UA-cam. I believe I can ace my upcoming OS class.
I have liked your video and subscribed to your channel.
Thanks a lot for the video. Greatly appreciate it.
Very clear! It helps a lot, thank you very much!😀
You’re welcome! :-)
Wow, good video. Good job and thanks for sharing.
watched the first video in this channel, subbed!
Thank you for the sub. I'm so glad to hear that you've liked it!
thank you, this video was very clarifying.
You’re welcome. I’m glad to hear that.
شكرا thanks 👍 it was helpful
bro you are amazing, love your energy
Thanks. I appreciate that!
8:06 Correction: A word is two bytes in size, not 4. A double word (DWORD) is 4 bytes. And cpu's don't work with words necessarily, but general purpose registers of x32 bit cpu's are 32 bits in size. And 64 bits for x64 gprs.
The size of a word depends on the architecture, there is no "correct" word size.
For example you are correct that a word in an x86 processor is 2 bytes, but a word in an ARM processor is 4 bytes.
@@bleesev2 Didn't know that thank you :)
This is a very good, concise and clear explanation, please keep the work's up, I really enjoyed it : )
PS: can you make a video about how compression algorithms work?
Glad to hear that, and you thank you for taking the time to comment. :-)
Yeah, some compression algorithms are in my queue, but it will take a while before I get some free time to make them. Stay tuned!
@@TechWithNikola I'll be waiting 4 sure :3
such a good video, you are the man !
Thank you!
Starting off with the “bad old days” only being 4GB definitely lets me know I’m old! Just like running out of 32bit address space “must” have been back in the 1950s or something 😂
Superb...! Love it..❤
clear as water, thanks!
Great to hear that :) Thank you!
nice video bro!
Very helpful ❤❤
Can u make a video for registers, What are they used for…
in a way that we can understand the assembly language
I like this video, shows the more "technical side" of virtual memory and how it does its thing. Thanks.
I'm glad you've liked it, and you're welcome! :)
Liked, subbed, turned on all notifications.
Thank you! :)
Hey man, can you make same video with gpu and cpu? Your explanation is so good
Very well explained
Thank you :-)
Well explained
Thank you for providing such valuable content. The examples you shared have greatly enhanced my understanding of the working principles of virtual memory.
I’m very happy to hear that. Thank you for taking the time to comment.
Truly amazing
Oh Juniors, 1GB is huuuuge for old-school guys
I still consider it a lot of memory and I think that modern software (especially closed source and web browsers) are unoptimized garbage!
@0:54 and before that there were 16 bit CPUs that could only address which was only 64 Kilobytes.
In the early days it was more around the problem with memory collisions rather then accessing something that is out of range.
In the 1960s you wouldn't find the kind of problem you're talking about because the processing power was too expensive to have that kind of problem.
Paper Tape and Punch Cards don't have the same problems with accessing memory out of range.
thank you man
You're welcome!
Greate Video. Thanks
Glad you liked it!
Thank a lot.
You’re welcome!
Bravo !
Finally ... a proper explanation!
I say this because countless self-made experts get it wrong. You see, Microsoft seems to have invented the misuse of the term "virtual memory" around the time of Windows 95. They used the term VM to describe what is really demand paging. Microsoft publications at the time did NOT make this mistake. (See Jeff Richter's excellent book describing the internals of Windows NT, published at the time.)
But in the settings UI ... I guess "virtual memory" sounded more appealing to Microsoft than "demand paging". So they misused the term ... and misled generations of self-made CS people who subsequently grew up unaware of the misuse.
They often claim that VM size can be adjusted. (It cannot be.)
They believe that the disk swap/paging space is virtual memory. (It is not.)
You see, virtual memory was created as a MAPPING PROCEDURE that solved the long-standing problem of mapping a program binary into the run-time address space of a computer.
It was preceded by address space paging (remember the early 80x86 paging registers?). This was present in minicomputers as far back as the late 1960s.
Paged memory was, in turn, preceded by run-time relocation ... a tedious run-time editing of a binary to "patch" all of the code addresses and data addresses within a program binary before execution could begin.
VM is superior to both of those methods.
Meanwhile some systems implemented something called swapping ... a predecessor of demand paging. When swapping, a program's ENTIRE memory consumption is swapped to disk to make way for another program. This mechanism allows the system to get around memory size limitations ... but it performs a lot of disk swapping!
Demand paging goes one better by swapping only small blocks of memory. And even better, it loads only portions of a program when needed. No need to load an entire program when most of that program code won't be executed any time soon. It's all quite efficient.
Virtual memory is not demand paging, and demand paging is not virtual memory.
And you don't have to use VM with demand paging. And you don't have to use demand paging with VM.
But the two appeared at a similar time in computing history ... and they work hand in hand to improve performance.
So you always see both of them together.
This video correctly presents a unified view of demand paged/virtual memory. Nice work!
I'm already at about 10 minutes and have about 80% understanding. What do you recommend I look for? Or if you have some resource/s I would be grateful
great video.
i didnt get 2^32 adreess for each byte = 2 ^ 30 words
Thanks.
I’ll try to elaborate.
There are 2^32 addresses. Each address references one byte of memory, which is 4GB in total.
Now, a CPU works with so called words. 32-bit CPU works with 4-byte long words.
How many 4-byte words are there in 4GB RAM? We can divide 2^32 bytes (4GB) by 4, which gives us 2^30 words.
Hopefully this makes more sense. Let me know if it’s still unclear.
@@TechWithNikola got it thanks 😊
Great video. So you mention that physical address is the "memory RAM". You also mention the "page tables" are store in the "memory RAM" and how there are difference level of page tables and some can be store in disk. Is virtual memory also store in the "memory RAM"?. I know I have to rewatch this video and keep studying to fully understand and that I have gaps in my knowledge. So in a high level the OS has to do a mapping between virtual memory and page tables. And then between page tables and physical address? Thanks.
Hi, apologies for the late response.
So virtual memory on its own doesn’t exist really. It’s just a number, for example from 0 to 2^32-1. As such, it is not stored anywhere.
It only becomes interesting when we talk about translating that number to its physical counterpart. This translation is stored in page tables, and page tables are stored in RAM. It you rewatch the video you will see the exact details on how the translation works, but in a nutshell the first part of the address is remapped via page tables, and the last 10 bits are copied (called an offset).
The mapping is actually happening in the MMU (memory management unit) which you can think of as a small chip on the CPU. You are right that OS plays an important role, and specifically, OS programs the memory management unit and specifies how to do the mapping.
Does that make sense?
Yes, thanks for the reply
you are a legend
Thanks :-)
Is Page Table update and TLB update treated as 1 atomic operation? If yes, how do we maintain atomicity? If no, how do we handle scenarios where the TLB has stale entry?
Can you next teach us about deditated WAM?
Your channel is a masterpiece!
The Discord link is invalid or expired.
Would you please comment it here?
Thank you
Thank you.
Ah sorry about that. I've updated it now and set to never expire: discord.gg/cEjDP4WK
0:35 As far as I understand, 4Gb of memory means less than 4Gb of RAM. CPU thinks that ROM and south bridge devices are memory as well.
Quite good video. Just a minor comment. You use the word 'Security' in sections but I would call it 'Liability'. Thanks,.
11:38 I’m wondering when you copy the last 12bits to the physical memory, why the number changes from 0110 0111 1000 to 010110011110
Oh that’s a good catch! It’s a bug in the animation. Sorry about that. It should remain unchanged.
@@TechWithNikola Thank you very much! Your videos are really helpful!!!
Perfect.
you did great job here, this topic became very easy after that sweet explanation
but I need u to correct my info if I am wrong!
in old days we know that
byte is 8 bits
word is 2 bytes = 16 bits
dword is double words = 4 bytes = 32 bits
so, is it changed those days as you claim in this video here 8:08 !!! is word become 32-bits ?
thank you
is there a chance that a virtual page does not map to eithjer the disk or the physical page? what happens in that case? 12:45
Yes, that's technically possible. Virtual page doesn't really say the data is on DISK. Instead, it has a bit that says whether the mapping is valid or not, valid meaning it's somewhere in RAM. When it's invalid, the MMU will raise a page fault. For invalid mappings, the OS can use the remaining bits to store additional information that will help find the data on a device. It's up to the kernel to interpret these bits, which may mean the data is on SSD, USB flash, or somewhere else, and then load the data back into RAM. So we can use any device as a backing storage.
Linux has a struct called swap_info which stores information about devices used for paging. Actually, it has an array of such structs, each identifying a device (potentially the same) and some metadata. Linux then uses PTEs to store an index into this array, as well as some other metadata. I'm not too familiar with the internals of how linux does this myself, but this is the general idea.
UA-cam suggesting me at 2 am here. thank god it did. I can sleep well now.
Kindly make part 2 for DP
I'm working on it, it just takes time to figure out what to speak about, but I'm hoping to have it in a couple of weeks.
subbed.
Thank you!
does page table also handle swap, putting memory onto hard disk?
Hi, the page table itself doesn't handle swaps. Swapping is done by the OS. For example, if a program wants to access some (virtual) memory address, but that address is on disk (which can indicated by some bits in the address), the OS moves the inactive page to disk. If the page is needed again, the OS loads the page from disk into RAM.
Can you recommend some books that deep dive into how Linux works with CPU, memory and disc access
I’ve personally learned a lot from the Linux Programming Interface. There are other books out there but I’ve only read this one. Let me know if you come across any other good reads.
10:39 All pages are 4096 long except Pages 2, is that a correct?
Very good
Thanks
@12:17 He says cpu does not know how to read it from RAM should not it be Disk ?
Good catch. I think that my intent was to say “CPU cannot read it from RAM” (because it’s not there), but you’re also right that CPU doesn’t know how to read it from disk
amazing
Thanks!
❤
amazing. u say program. is this referring to a process?
Thanks. Yes, I mean process.
thnx not trying to be anal, just #justschoolthingz @@TechWithNikola
how to make this animation?
Hi, which one are you referring to exactly? I have used a combination of powerpoint, keynote, Manim (python library) to make all these animations. Hope that helps!
1:00 Wouldn't the memory address wrap around and not crash immediately?
I don’t think so but I could be wrong. I guess it depends on the implementation details and I can see both being done during the time before virtual memory was a thing. In either case, neither behaviour is ideal.
I would argue that crashing is potentially better than wraparound because it highlights a problem whereas wraparound would continue working with a potentially silent error.
Have you come across any references that discuss this? I’m interested to learn more
@@TechWithNikola Ben Eater's 65c02 based computer has the most significant address bit (A15) disconnected, causing a wraparound behavior.
Got it, thank you for that. I’ll read more about it.
Commenting for the algorithm 😅
Subscribed immediately 👍🏾🫡… thank you sir
Is TLB same as cache ?
It depends on what do you mean by “same as cache”. Let me try to elaborate.
TLB is a special type of memory cache that stores recent translations of virtual memory to physical memory addresses. Its primary role is to speedup this translation.
However, this is different from the common usage of word cache which refers to a memory layer that stores copies of data and instructions closer to CPU. Usually, we refer to them as L1, L2, L3 caches.
Hopefully this makes sense.
great
Thank you
Discord link is invalid
Thanks. Sorry about that, I've updated it now and set to never expire: discord.gg/cEjDP4WK
@@TechWithNikola link expired again '-'
Thanks@@daessell4671 . I must have forgotten to use the permanent link on this video. The one in the basic channel info is permanent. I have now updated it for this video as well.
where are you from? just for the accent. (English learner)
same question
Isn’t a word 16bits and a dword 32?
Good meme video was enjoyable. I must be getting too old for kids to be shitposting in a shitpostable thread.
4:50 The virtual memory system doesn't know that it is on disk, it just knows that it is inaccessable to the program.
Correct. It actually knows a bit more than that. I have written some additional info in one of the comments. I’ll copy the contents here (let me know if this seems wrong):
From another comment:
Virtual page doesn't really say the data is on DISK. Instead, it has a bit that says whether the mapping is valid or not, valid meaning it's somewhere in RAM. When it's invalid, the MMU will raise a page fault. For invalid mappings, the OS can use the remaining bits to store additional information that will help find the data on a device. It's up to the kernel to interpret these bits, which may mean the data is on SSD, USB flash, or somewhere else, and then load the data back into RAM. So we can use any device as a backing storage in theory.
Linux has a struct called swap_info which stores information about devices used for paging. Actually, it has an array of such structs, each identifying a device (potentially the same) and some metadata. Linux then uses PTEs to store an index into this array, as well as some other metadata. I'm not too familiar with the internals of how linux does this myself, but this is the general idea.
W
DMA
so virtual memory is not virtual memory. got it :)
"Programs used to crash in the 1950s or so"? Calm down, it hasn't been that long since Windows XP would ask you to "send an error report".
You had 32 bit CPUs in the 1950's? wtf is this lol.
KiB isn't read as Kilobyte but Kibibyte
Agreed
Only memory = solid connect f(xt' '')! 0 x -- dead clan member -- 1= clan member
2 = relayed 2x -- 3= drug drop mandatory + gay -- U used, their intel then!