Search results
Linux has to deal with two shortcomings of hardware with respect to memory addressing: Some hardware devices can perform DMA (direct memory access) to only certain memory addresses.
This book gives a detailed tour of the Linux VM as implemented in 2.4.22 and gives a solid introduction of what to expect in 2.6.Aswellasdiscussing the implementation, the theory that Linux VM is based on will also be introduced.
Small piece of code, stub, used to locate the appropriate memory-resident library routine. Stub replaces itself with the address of the routine, and executes the routine. Operating system needed to check if routine is in processes’ memory address. Dynamic linking is particularly useful for libraries.
Linux Memory Management. W4118 Operating Systems I. https://cs4118.github.io/www/2024-1/ Credits to Jae and Hans. Address space one more time! We covered how the following fit into the virtual address space: program break. file-backed mappings (e.g. shared C std library) anonymous mappings. kernel code & data. Checking the mappings.
W4118: Linux memory management. Instructor: Junfeng Yang. References: Modern Operating Systems (3rd edition), Operating Systems Concepts (8th edition), previous W4118, and OS at MIT, Stanford, and UWisc. Page tables are nice, but ... Page tables implement one feature: mapping vitual pages to physical pages. Wanted: other memory management features
How a process uses physical and virtual memory effectively. How to control overcommit and virtual and/or physical memory limits. Basic knobs in Linux to control memory management.
Four library functions form the basis for dynamic memory management from C. We describe them first, followed by descriptions of the two system calls upon which these library functions are built.
