CS 370 ED JORGENSEN TEST 2 | 218
QUESTIONS | WITH ACTUAL SOLUTIONS.
1 of 218
Term
What is the memory strategy for memory allocation?
Give this one a try later!
Allocate memory randomly to Allocate block of memory
processes (bytes) to processes
Allocate memory based on CPU Allocate memory according to file
usage size
, Don't know?
2 of 218
Term
Why is copy-on-write needed?
Give this one a try later!
To optimize memory usage by
To prevent data sharing
immediately allocating
between parent and child
separate memory for each
processes
process
Copies all the parents
To ensure all child processes
address space may not be
have unique address spaces
needed if a forked parent
from the start
process has a child that
performs exec() (clears
out address space).
Don't know?
3 of 218
Term
What is hard affinity?
Give this one a try later!
, Migrate processes to different Randomly assign processes to
cores as Needed any core
Distribute processes across Keep processes running
multiple cores on same core.
Guaranteed!
Don't know?
4 of 218
Term
What is address binding?
Give this one a try later!
When the address is When the address is
assigned during actually assigned
execution
When the address is When the address is temporarily
assigned at runtime assigned
Don't know?
5 of 218
Term
What is a hierarchical page table?
Give this one a try later!
, Programs use and see Size varies per system.
only logical/virtual Is typically based on available
addresses RAM Most hold a full copy of
All virtual/logical address each executing process
appear contiguous
A technique to reduce
page table size
Attempting to resume a Divide page table into
process on the same core it smaller pieces or levels
was on before. This improves Ensure most common are
cache performance. in memory, swap out less
common
Don't know?
6 of 218
Term
Which of the following is true regarding a round-robin
scheduling algorithm. Check all that apply.
- All processes are not treated equally (for scheduling).
- Each process gets a small amount CPU time (time slice).
- Possible starvation for low priority processes.
- Shares some characteristics with a first-come, first-served
(FCFS) algorithm.
- All processes are treated equally (for scheduling).
Give this one a try later!
Keep CPU busy
Fairness (avoid
starvation) Policy
enforcement (
QUESTIONS | WITH ACTUAL SOLUTIONS.
1 of 218
Term
What is the memory strategy for memory allocation?
Give this one a try later!
Allocate memory randomly to Allocate block of memory
processes (bytes) to processes
Allocate memory based on CPU Allocate memory according to file
usage size
, Don't know?
2 of 218
Term
Why is copy-on-write needed?
Give this one a try later!
To optimize memory usage by
To prevent data sharing
immediately allocating
between parent and child
separate memory for each
processes
process
Copies all the parents
To ensure all child processes
address space may not be
have unique address spaces
needed if a forked parent
from the start
process has a child that
performs exec() (clears
out address space).
Don't know?
3 of 218
Term
What is hard affinity?
Give this one a try later!
, Migrate processes to different Randomly assign processes to
cores as Needed any core
Distribute processes across Keep processes running
multiple cores on same core.
Guaranteed!
Don't know?
4 of 218
Term
What is address binding?
Give this one a try later!
When the address is When the address is
assigned during actually assigned
execution
When the address is When the address is temporarily
assigned at runtime assigned
Don't know?
5 of 218
Term
What is a hierarchical page table?
Give this one a try later!
, Programs use and see Size varies per system.
only logical/virtual Is typically based on available
addresses RAM Most hold a full copy of
All virtual/logical address each executing process
appear contiguous
A technique to reduce
page table size
Attempting to resume a Divide page table into
process on the same core it smaller pieces or levels
was on before. This improves Ensure most common are
cache performance. in memory, swap out less
common
Don't know?
6 of 218
Term
Which of the following is true regarding a round-robin
scheduling algorithm. Check all that apply.
- All processes are not treated equally (for scheduling).
- Each process gets a small amount CPU time (time slice).
- Possible starvation for low priority processes.
- Shares some characteristics with a first-come, first-served
(FCFS) algorithm.
- All processes are treated equally (for scheduling).
Give this one a try later!
Keep CPU busy
Fairness (avoid
starvation) Policy
enforcement (
