This study guide is based on the lectures and the book from Chapters 1 through 12. Most of the test (between 60% and 80%) is based on new material. Specific new material that is covered on Test 3 that was not on the previous two tests comes from:

• Chapter 10,
• Chapter 11, sections 11.1, 11.2, 11.3, 11.4, and 11.7, and
• Chapter 12, sections 12.1, 12.2, 12.3, 12.4, and 12.9.

Acronyms (10%-15%)

Mostly Old Stuff

• SMP
• LAN
• WAN
• DMA
• IP
• IPC
• RPC
• TLB
  Mostly New Stuff
  
• LRU
• FIFO
• FCB
• UFS
• NTFS
• RAID
• VFS
• FAT
• NFS

Terms (20%-30%)

Mostly Old Stuff

• symmetric multiprocessor
• client/server systems
• cache
• cache coherence
• ready queue
• pthreads
• context switch
• critical section
• critical section problem
• race condition
• mutual exclusion
• deadlock
• indefinite blocking, starvation, and how this is different from deadlock
• hold and wait (in the context of the four necessary conditions for deadlock)
• no preemption (in the context of the four necessary conditions for deadlock)
• circular wait (in the context of the four necessary conditions for deadlock)
• logical address
• physical address
• virtual address
• logical address space
• physical address space
• memory management unit (MMU)
• paging
• page
• frame
• page number
• page offset
• page table
• frame table
• page table base register
• translation look-aside buffer (TLB)
• TLB miss
• TLB flush
  Mostly New Stuff
  
• virtual address space
• virtual memory
• demand paging
• page fault trap
• pure demand paging
• locality of reference
• page table
• swap space
• effective access time
• page fault rate
• copy on write
• memory mapped file
• over allocation
• victim frame
• dirty bit, modify bit
• reference string
• FIFO page replacement
• Belady's anomaly
• optimal page replacement
• LRU page replacement
• additional reference bits algorithm
• second chance algorithm
• thrashing
• local replacement algorithm
• working set model
• working set window
• working set
• prepaging
• TLB reach
• locking (pinning) pages in memory
• file
• sequential access
• direct access
• mount point
• file system
• basic file system
• logical file system
• boot block, boot control block
• partition control block
• superblock
• Master File Table
• inode
• system-wide open-file table
• per-process open-file table
• raw disk
• dual booted
• root partition
• mount table
• Virtual File System
• vnode
• contiguous allocation
• linked allocation
• File Allocation Table
• indexed allocation
• index block
• direct block
• indirect block
• double indirect block
• triple indirect block

Short Answer/Comparisons/Analyses/Calculations (50%-60%)

You should be able to give short answers, comparisons, analyses, or calculations for each of the following items or pairs of items.

Mostly Old Stuff

• Draw the process state diagram. Label each of the arcs and states. Under what conditions might a process leave the running state? What data structure is accessed?
• What system call(s) are used to create a new process in UNIX? What happens within the address space of the newly created process? How is a new program typically executed?
• How are threads different from processes? How are they the same?
• List and explain the four necessary conditions for deadlock.
• Give an example of deadlock.
  Mostly New Stuff
  
• Consider a logical address space of 16 pages of 512 bytes each mapped onto a physical memory of 32 frames.
  • How many bits are there in the logical address space?
  • How many bits are there in the physical address space?
  • How many entries are there in the page table?
  • What is the minimum size of the page table? Justify your answer.
• Consider a paging system with the page table stored in memory.
  • If a memory reference takes 100ns, how long does a memory reference including a reference to the page table take?
  • If we add a TLB to hold page table entries, and 75% of all page table references are found in the associate registers, what is the effective memory access time if the time to access the associate registers is 20ns?
• Describe the steps that take place when a page fault occurs.
• Consider the following page-reference string:

  1, 2, 5, 1, 2, 3, 4, 1, 2, 3, 4, 5

  How many page faults would occur for LRU, FIFO, or Optimal replacement, assuming that there are three frames? How about if there are four frames? Five frames?

• Compare the advantages and disadvantages of LRU page replacement with Optimal page replacement.
• How is the minimum number of frames required by a process determined?
• Exercises 10.9 and 10.18.
• Why might you want to lock a page into physical memory?
• Describe the steps that happen when a file is created for the first time in Linux.
• Describe the steps that happen when a file is opened for the first time in Linux.
• Explain how Linux allows different types of file systems to be used at the same time. That is, explain how the VFS interface works.
• Briefly describe how the FAT file system directories and file block access are implemented. What type of directory implementation is this an example of? (answer: linked)
• Briefly describe how the ext2 file system directories and file block access are implemented. What type of directory implementation is this an example of? (answer: indexed)
• Suppose that my indexed file system used blocks of size 8K, and that I use inodes with 12 direct entries, one indirect entry, and one double indirect entry. Assume that the size of an index is 8 bytes (64 bits). What is the size of the largest file that can be accessed with these parameters? (answer: 12*8K + 1024*8K + 1024*1024*8K = 48K+8MB+8GB).
• Suppose that I type "ls -i" in the root directory of my computer, and I see

       309473 bin/           2 boot/   162881 dev/   276897 etc/
            2 export/        1 home/   358337 lib/       11 lost+found/
  

  What could be the reason that export and boot have the same inode number? How could you confirm your hypothesis?
• What are the implications of the stateless design of NFS?