Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
18 Cards in this Set
- Front
- Back
|
Should the entire program and data of a process be in physical memory for the process to execute
|
no. we do not need all of it to execute
|
|
|
Is the Routine loaded before it is called in Dynamic Loading?
|
No, this is the concept of Dynamic Loading it will not be loaded until the program calls it
|
|
|
What are the 3 different stages that can happen in address binding of instructions and data to memory?
|
Compile Time
Load Time Execution time |
|
|
what is the Compile time that happen during address binding of instructions and data to memory?
|
If you know at compile time where the process will reside in memory, then absolute code can be generated.
|
|
|
what is the Load time that happen during address binding of instructions and data to memory?
|
If it is not knonw at compile time where the process will reside in memory, then the compiler must generate relocatable code
|
|
|
Swapping (definition)
|
A process can be swapped temporarily out of memory to a backing store, and then brought back into memory for continued execution.
|
|
|
Backing Store (definition)
|
fast disk large enough to accommodate the copies of all memory images for all users; must provide direct access to these memory images
|
|
|
What scheduler does the swapping?
|
Mid term scheduler
|
|
|
what is the total transfer time of swapping?
|
it is directly proportional to the amount of memory swapped. 1000 kB / 5000kB = 1/5 sec = 200 ms
|
|
|
What are the 2 types of memory Allocation?
|
Fixed sided contiguous partition
Dynamic contiguous partition |
|
|
Disadvantage of equal size partitions:
|
*A program may be too big to fit into a partition.
* Main-memory utilization is extremely inefficient |
|
|
advantage and disadvantage of fixed-sized contiguous partition.
|
Strengths: simple to implement; little over head
Weakness: internal fragmentation; fixed number of processes |
|
|
first fit
|
Allocate the first hole that is big enough
|
|
|
best-fit
|
allocate the smallest hole that is big enough; must search the entire list, unless ordered by size. produces the smallest leftover hole
|
|
|
worst fit
|
allocate the largest hole must also search entire list. Produces largest leftover hole
|
|
|
Strengths and weakness of dynamic partitioning
|
Strength: no internal fragmentation
more efficient use of main memory Weakness: external fragmentation compaction |
|
|
External Fragmentation-
|
total memory space exists to satisfy a request, but it is not contiguous.
|
|
|
Internal Fragmentation
|
allocated memory many be slightly larger than requested memory; this size difference is memory internal to a partition, but not being used.
|
