Please enable JavaScript.
Coggle requires JavaScript to display documents.
Background, Paging, Contiguous Allocation, Segmentation, Memory Protection…
Background
Swapping
-
May support roll out, roll in for priority-based processes
-
-
-
Can reduce potential swapped memory by decreasing the size of memory swapped, by knowing how much is really used though OS calls such as request_memory and release_memory
Address Binding
-
-
Execution Time
Produces 'relocatable' code that can be moved in memory easily at runtime to accommodate for extra runtime space requirements such as dynamically linked programs (.dll)
-
Requires a memory management unit to translate runtime logical (virtual) addresses into physical memory addresses
-
Paging
-
-
-
-
-
Divides memory into fixed-sized blocks (frames) with size as power of 2, from 512 bytes to 16 Mbytes
-
-
-
-
-
-
Contiguous Allocation
-
-
Dynamic Storage Problem
Best fit produces smallest leftover hole, requires searching whole memory unless ordered by size
-
-
-
-
Segmentation
-
A process is a collection of segments, mapping the developer's view
Logical address consists of a tuple <segment-number, offset>
A segment table is used to map each tuple to a physical address, this includes base and limit (length) for each tuple
-
-