ch8 review Silberchatz operating system concepts essentials 2nd ed

-

Review Questions
Section 8.1
8.1 True or False? A program does not need to be stored in memory in its entirety. True
8.2 True or False? A physical address space is at least as large as a virtual address space. False
Section 8.2
8.3 When does a page fault occur? access to a page marked invalid causes a page fault. when this happens the operating system fails to bring the desired page into memory.
8.4 True or False? In a pure demand paged system a page is never brought into memory until it is needed. True
Section 8.3
8.5 What system call initiates copy on write? fork()
8.6 True or False? The vfork() system call does not use copy on write.True
Section 8.4
8.7 What is the simplest page replacement algorithm? First-in, First-Out
8.8 What is the name of the page replacement algorithm that operates by replacing the page that will not be used for the longest period of time? Optimal Page Replacement algorithm
8.9 What page replacement algorithm could be implemented using a stack or counters? Least Recently Used algorithm
8.10 True of False? Approximation algorithms are almost always used when implementing LRU. True
Chapter 8 Virtual Memory
Section 8.5
8.11 What is the fundamental difference between global and local page replacement? Global page replacement allows a process to select frames of memory from all available memory, where local page replacement only allows the process to select frames of memory from those frames specifically allocated to that process
Section 8.6
8.12 What term is used to describe the situation where a process spends more time paging than executing? thrashing
8.13 What term is used to describe the set of pages a process is currently referencing? working set
8.14 True or False? With pure demand paging, the page fault rate is initially very high. true
Section 8.7
8.15 True or False? Shared memory is typically not implemented using memory mapping. false
Section 8.8
8.16 Using the buddy system, if a request for 200 KB of kernel memory is made, how much is actually allocated? 256KB
8.17 What is one benefit of using slab allocation. No memory is wasted due to fragmentation, and memory requests can be satisfied quickly
Section 8.9
8.18 What is the TLB reach of a system with 4 KB page sizes and 32 entries in the TLB? 128KB
8.19 True or False? 4 KB is a typical page size. True
8.20 True of False? Some systems support page sizes up to 4 MB. True
Section 8.10
8.21 What page replacement algorithm is used by Windows? Least recently used
8.22 Solaris uses the clock algorithm variation of LRU. How many hands does this algorithm employ? 2 hands instead of 1

Popular posts from this blog

-
selection, iteration, sequence ubuntu-12043-desktop-amd64 VirtualBox-438-92456-Win http://medical-dictionary.thefreedictionary.com/Atomic+value http://en.wikipedia.org/wiki/Atomic_value http://www.docstoc.com/docs/26533470/EXAMPLE-FLIGHT-ITINERARY http://www.mulesoft.org/documentation/display/33X/Flight+Reservation+Example
Read more

ch11 review silberschatz operating systems concepts essentials 2nd ed

-
Review Questions Section 11.1 11.1 True or False? Disk blocks are made up of one or more sectors. True 11.2 What is the name of the standard Linux file system? Extended file system (ext3/ext4) 11.3 What is the UNIX term for a file control block? inode Section 11.2 11.4 True or False? UNIX treats a directory exactly the same as a file. True 11.5 What does the acronym VFS refer to? Virtual File system Section 11.3 11.6 What are the two general approaches for implementing a directory? Linear list list of file names with pointers to the data blocks, hash table linear list stores directory entries but a hash data structure is used greatly reducing directory search time Section 11.4 11.7 Provide at least two different approaches for allocating disk blocks to files. contiguous allocation, linked allocation, indexed allocation 11.8 True or False? The UNIX inode is an example of linked allocation. False the unix inode is an example of indexed allocation Section 11.5 11.9 What would the...
Read more