cs3750q9-10Recap

(Latest Revision: Thu May 07, 2020) cs3750q9-10Recap

cs3750q9-10Recap

Quiz #9-10 Answer Information

What you needed to know to get the questions right - you needed to know ...

... given an address, and values of base and limit registers, how to check to see if the address is within bounds. (Is the address >= the base, and < base+limit?)
... that as a process executes the MMU hardware of the computing system routinely performs the translation of the logical addresses generated by the process to physical memory addresses.
... that "best fit" is the memory allocation strategy that chooses the smallest hole in memory large enough to satisfy the memory request, and that therefor it leaves the smallest possible remaining hole.
... given a page size, how to figure out the number of bits needed to express offsets within the page - it's k if the page size is 2^k.
... that there is no external fragmentation with paging.
... that an inverted page table has an entry for each frame of physical memory.
... that all of these are benefits of allowing a process that is only partially in memory to execute: 1) programs can be written to use more memory than is available in physical memory; 2) CPU utilization and throughput is increased; and 3) it is likely that less total I/O is needed for copying parts of processes between secondary memory and primary memory.
... that the optimal page replacement policy replaces the page that will have the latest next use.
... that the second-chance algorithm is an LRU-approximation algorithm.
... that thrashing is what occurs when the paging activity of a process takes up more time than its execution of instructions.
... that the working set is an approximation of the locality of a process.
... that the TLB reach is the number of entries in the TLB multiplied by the page size.