⇤ ← Revision 1 as of 2006-11-18 22:02:53
Size: 1089
Comment:
|
Size: 1070
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
= Demand paging = |
I think that demand paging it's an interesting topic, so I will try to write some ideas.
Concept
It's a dynamic memory allocation technique that consist of deferring page frame allocation until the last possible moment, for example, when a process attemps to access a page that is not present in RAM.
Different areas where demand paging apply
- Demand paging of executable files: When you execute a program, only a portion (how many bytes?, Is tunneable?) of it is loaded into memory. If the procesor attemps to execute code that is not in memory a page fault is generated and a page is loaded from the executable file.
- Demand paging of regular files: This apply only to mmap()ed files. Only the active pages of the file is resident on memory, on memory pressure modified pages will be written in the file (MAP_SHARED) or in the swap area (MAP_PRIVATE).
- Demand paging on the heap: I'm not sure here, but I think that the kernel defer the allocation after a brk() system call and do it when the process try to access to that pages.