1 / 12

CSE 451

CSE 451. Section March 9 Review. Outline. Project 3 questions Review section VM review FS review DS review Eval forms. Project 3. Due tomorrow at 6 pm. Writeups can be turned in up to 24 hours later, although I’d prefer them at the same time. Review section. Do you want one?

mmohler
Download Presentation

CSE 451

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSE 451 Section March 9 Review 1

  2. Outline • Project 3 questions • Review section • VM review • FS review • DS review • Eval forms 2

  3. Project 3 • Due tomorrow at 6 pm. • Writeups can be turned in up to 24 hours later, although I’d prefer them at the same time 3

  4. Review section • Do you want one? • When do you want it? • What do you want to cover? • To study: do problems in the book. I can verify your answers, if you like (and you don’t want to many verified). 4

  5. VM review: • What is internal / external fragmentation? • What are the issues related to page size? • What are advantages / disadvantages of paging? 5

  6. VM review (2) • What are the cases where not all the program code need be in memory? • What is demand paging? • What is a page fault? What is done to handle a page fault? • What determines page fault time? • What is ideal criteria for choosing a victim page? 6

  7. VM Review (3) • How can you judge the quality of a page replacement algorithm? • What is Belady’s Anomaly? • Name 3 page replacement algorithms. • What is the working set? • What is prepaging? • How can programs be changed to perform better with virtual memory? • What are the options for page-table layout? When are the good? 7

  8. FS review • How can data be organized in files? • How does the OS know where data in a file is? • How can the OS allocate blocks for a file? What are the advantages / disadvantages? • How is directory information stored? 8

  9. FS Review 2 • What is Raid? What are the important levels? • How doe the RAID levels differ in performance? • What are the issues surrounding file block allocation? • What makes LFS different? How does it find empty pages? 9

  10. Distributed Systems Review • What are the advantages of a distributed system? • What are the disadvantages? • What are some possible network topologies? • How do loosely-coupled systems differ from closely-coupled systems? • Can a distributed system be transparent? 10

  11. DS Review (2) • How does a network deliver data to the correct endpoint? • What are the options for how data is formatted when it is transmitted? • What does the OS do when it receives a packet? • What are some of the design choices for distributed file systems? • Under what conditions would a DFS be faster than a local disk? 11

  12. What you should be able to do • If we give you a design, you should be able to explain what the important features are, and how they impact performance. • For the various design choices, you should be able to explain when they make sense. • If we give you a workload, you should be able to tell us which of the design choices is best, and why. 12

More Related