Operating Systems Organization Review
This content provides a detailed review for an upcoming exam on operating systems organization. It covers core concepts such as user space versus kernel space, system calls, kernel libraries, and timing management in kernels. Students are recommended to study assigned readings, lecture materials, and practice questions for preparation.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Exam 1 Review Chris Gill and James Orr CSE 422S - Operating Systems Organization Washington University in St. Louis St. Louis, MO 63130 1
Exam 1 8-10 questions, which will test for comprehension, some key terms and details, and a bit of analysis Recommendations for study (in order of importance) 1. Start with the assigned readings in the LKD and LPI text books and other sources - Review PPT presentations from the lectures at the same time that you do the readings 2. Review studios and lab for reinforcement Types of questions: True/False Multiple Choice Explain why ____ is false Open answer / code snippets You are allowed one8.5 by 11 page of notes (written or printed) with info on one or both sides of the page. Also bring pen/pencil/eraser/water bottle. No other materials besides those and the exam copy will be permitted at your desk. 80 minutes total, 10-11:20am Monday March 3rd, 2024, in class Will distribute exams 5 minutes early, and will start promptly at 10am CSE 422S Operating Systems Organization 2
Core Concepts LKD Ch 1 Pg 4: Overview of Operating Systems and Kernels Figure 1.1: breakdown between user space and kernel space LKD Ch 2 Pg 16: A Beast of a Different Nature Understand differences between writing user code and writing kernel code (libraries, header files, etc.) CSE 422S Operating Systems Organization 3
Core Concepts LKD Ch 5 What are system calls for? What are some of the system calls we ve looked at in the studios? (fork, exec, ftrace, trace etc) What operations are done in order to invoke a system call? Why is implementing a new system call not always a great idea? CSE 422S Operating Systems Organization 4
Core Concepts LKD Ch 6 How does the kernel implement libraries Why is rolling your own data structures frowned upon? Be able to perform basic operations on a linked list (I will give you the linked list API if a question asks you to do this) LKD Ch 17 Kernel Module traits, characteristics, necessary functions, how to pass parameters CSE 422S Operating Systems Organization 5
Core Concepts LKD Ch 11 What does HZ represent? How does the kernel keep track of real time? How does the kernel manage timers? How does it know when a timer has expired? What happens when a thread invokes schedule()? Other timing concepts What are hrtimers useful for? Why can t the system clock (configured via HZ) be used to implement high resolution times (i.e., on the order of nanosecond resolution) CSE 422S Operating Systems Organization 6
Kernel Tracing/Debugging Kernel oops vs kernel panic printk/dmesg Trace-cmd/Kernelshark Strace/ftrace CSE 422S Operating Systems Organization 7
Core Concepts LKD Ch 3 What are the data structures used to track processes? struct task_struct, struct thread_info What are the different states a process can be in?(Figure 3.3 on pg 28) What is meant by copy-on-write? How does it make it quicker to create new processes? How are kernel threads different from user threads/processes? CSE 422S Operating Systems Organization 8
Core Concepts (Synchronization) LKD Ch 9 Critical Regions and Race Conditions (pp. 162) Causes of Concurrency (pp. 167) Note the difference between true concurrency - i.e., parallelism and concurrency Deadlock (pp. 169) LKD Ch 10 Atomic hardware operations How to build a spinlock with atomic instructions When to use spinlocks vs. semaphores/mutexes (pp. 197) Test and set, compare and exchange, Read- Copy-Update (RCU) CSE 422S Operating Systems Organization 9
Core Concepts (Linux Process Scheduling) LKD Ch 4 What are the two questions that drive the behavior of the Linux scheduler? Which process should run? For how long should it run? Differences in requirements between I/O and compute bound processes Limitations of the O(1) scheduler How CFS addresses those limitations vruntime CSE 422S Operating Systems Organization 10
Core Concepts (Real-time scheduling) Understand the three real-time scheduling classes Be able to walk through examples of determining which process will execute given different periods, RT priorities, and runtimes (as done in class) Differences between user and kernel preemption (LKD pg 62) and why kernel preemption is useful from a real-time perspective CSE 422S Operating Systems Organization 11
Example Question #1 Imagine you are implementing a new OS feature that communicates with user space. User programs request an action from the kernel, and the kernel returns some data. Consider two options for implementing this feature: syscall vs. kernel module. Give two advantages of implementing this by creating a new system call (4 points): Give two advantages of implementing this by creating a new kernel module that reads and writes files (4 points): If you use the kernel module approach, what must user programs do to pass requests to it after it has been loaded (2 points)? CSE 422S Operating Systems Organization 12
Example Question #2 In the blank next to each term below, please write the letter for the text that best matches it and that it best matches (4 points). ___ task structure a. Non-root node of process family tree ___ init process b. Implements process family tree node ___ child process c. Extends process family tree ___ fork call d. Root of the process family tree CSE 422S Operating Systems Organization 13
Example Question #3 You have a periodic system where the Linux real-time scheduler runs every ms, the round-robin scheduling interval is 100ms, and there are five tasks, which will consume 300ms, 300ms, 400ms, 500ms, and 700ms of processor time respectively each time they run. If your system schedules tasks in FIFO order on a single core, what is the longest a task might wait before it runs (3 points)? If it instead schedules tasks in round-robin order on a single core, what is the longest a task might wait before it runs (3 points)? Rank the round-robin and FIFO schedulers as as either HIGH or LOW for each of: response time, overhead, fairness (3 points). CSE 422S Operating Systems Organization 14
