


















Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
An introduction to memory management strategies, including swapping, contiguous memory allocation, paging, and segmentation. It also covers virtual memory management concepts such as demand paging, copy-on-write, page replacement, frame allocation, thrashing, memory-mapped files, and kernel memory allocation. Key topics like address binding, logical versus physical address space, dynamic loading, and dynamic linking and shared libraries. It offers a comprehensive overview of the fundamental principles and techniques used in modern memory management systems, which are crucial for understanding computer architecture, operating systems, and system programming.
Typology: Schemes and Mind Maps
1 / 26
This page cannot be seen from the preview
Don't miss anything!
UNIT III: Memory-Management Strategies: Introduction, Swapping, Contiguous memory allocation, Paging, Segmentation. Virtual Memory Management: Introduction, Demand paging, Copy on-write, Page replacement, Frame allocation, Thrashing, Memory-mapped files, Kernel memory allocation. Memory Management
1.Basic Hardware 2.Address Binding: 3.Logical Versus Physical Address Space 4.Dynamic loading
Here the cpu address supoose if we take 40000 and base register=30000 and limit register= then the cpu address check with base register i.e 40000>= 30000 hence it will go to yes and check with base + limit i.e 30000+20000=50000 ,so cpu address 40000<50000 hence address is send to memory.if address is lower than base register then a trap to os is occurred. 2.Address Binding: Definition : Matching Instructions and data to the locality in main memory Compile time. If you know at compile time where the process will reside in memory, then absolute code can be generated
The logical address doen’t exist physically in the main memory and then termed as “Virtual Address” Physical address is location in the main memory and can be accessed physically It is generated by cpu It is generated by memory management unit(MMU) Set of logical addresses generated by program is referred as logical address space The set of physical addresses corresponding to logical address space referred as “physical address space” 4.Dynamic loading To obtain better memory-space utilization, we can use dynamic loading. With dynamic loading, a routine is not loaded until it is called. The advantage of dynamic loading is that a routine is loaded only when it is needed
A process must be in memory to be executed. A process, however, can be swapped temporarily out of memory to a backing store and then brought back into memory for continued execution