8.Main_Memory - Memory Management (Main Memory) Mehdi...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
Memory Management (Main Memory) Mehdi Kargahi School of ECE University of Tehran Spring 2008
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
M. Kargahi (School of ECE) Hardware Address Protection
Background image of page 2
M. Kargahi (School of ECE) Hardware Address Protection s Base and Limit Registers
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
M. Kargahi (School of ECE) Address Binding s Binding: a mapping from one address space to another s Compiler time (absolute code) s Load time (relocatable code) s Execution time (process can be moved during its execution) s Code may partially be loaded s Available in most general-purpose OS
Background image of page 4
M. Kargahi (School of ECE) Address Binding
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
M. Kargahi (School of ECE) Logical versus Physical Address Space s Logical address : the address generated by the CPU s Physical address : the address seen by the memory unit (loaded into memory address register) s Virtual address : logical address in execution time binding which is different from the respective physical address s Mapping is done using MMU (memory- management unit)
Background image of page 6
M. Kargahi (School of ECE) Dynamic Loading s A routine is not loaded until it is called s For better memory space utilization s Process size is not limited to the size of physical memory s An almost general rule: 10% main program and 90% for exception handling s Dynamic loading does not require special support from the OS, but OS may help the programmer by providing special library routines
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Dynamic Linking and Shared Libraries s Static linking versus dynamic linking s Here, linking rather than loading is postponed until execution time s To save both disk space and memory s Stub : a small piece of code indicating how to locate the appropriate library routine s Only one copy of the library routine is loaded s Library bug fixes are much more simpler s Shared libraries: related to different library versions for different processes b previously compiled programs are not
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/21/2010 for the course COMPUTER S 001 taught by Professor Kargahi during the Spring '10 term at Amirkabir University of Technology.

Page1 / 38

8.Main_Memory - Memory Management (Main Memory) Mehdi...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online