The schedule below shows the tentative dates for all class topics, readings, and assignments. You should complete all assigned reading before class on the day it is listed. Labs will be available shortly before the assigned lab day. There may be some revisions to the schedule during the semester, but I will make sure to announce these changes in class. If you view this page with JavaScript enabled you can jump to the current week on the schedule, and you should see the next day of class highlighted in the schedule below.
We’ll begin the course by discussing operating systems generally. What is an OS? What is its job? How does it work? We’ll also spend some time thinking about how we learn and the elements of this course that are meant to facilitate your learning. You’ll be writing a lot of code in C for this course, so we’ll also take some time to practice C and discuss the standards you’ll be expected to follow for assignments and labs in this class.
Today we will practice using gdb to track down bugs in C programs.
Today we’ll discuss a key OS abstraction: the process. We’ll talk about why and how we use processes on Linux.
In today’s lab you will implement a shell, the program that runs in a terminal window. Shells make it possible for users to interact with an operating system, so building your own will give you a chance to practice writing code to communicate with the OS. You’ll also get to practice dealing with user input in C.
Address spaces are an important abstraction that makes it possible for the OS to run processes in isolation. We’ll look at the high-level idea of an address space and learn about how you interact with address spaces in code. We’ll also take some time to look at different types of mistakes you can make when dealing with memory.
Today we will look in detail at two real mechanisms that the OS uses to create address spaces.
Today’s lab will test your understanding of address spaces and the memory API. You’ll take advantage of Linux’s address space features to write some interesting and useful code.
One important use of virtual memory that goes beyond simply isolating processes from each other is swapping. This makes it possible for an OS to run programs that don’t fit in the amount of memory on the system. We’ll look at why this is useful and how it works.
We’ll use today’s class to catch up on course material. We may also have time to discuss strategies for the assignment and lab due this week.
Today’s lab will be one of the most challenging of the semester. You’ll use your new understanding of virtual memory and the memory API to implement a memory allocator, the code that provides malloc and free for other programs.
We’ll conclude our discussion of virtual memory by looking at the complete VM system from malloc down to disk space. This broader view leads us to some interesting applications of virtual memory, as well as some important security issues.
You’ll have time during class today to continue working on your malloc implementations.
We’ve seen how we can support multiple programs running on a single machine with processes and address spaces, but how does the OS decide which one to run at any given time? This is the job of the CPU scheduler. We’ll look at a few scheduling algorithms and discuss their advantages and drawbacks.
Today’s lab will require that you use your new understanding of CPU scheduling to write a scheduler for a console game. The game, a clone of the classic Snake game, is composed of a series of tasks. You will build the system that tracks these tasks and executes them at the appropriate times.
While processes make it possible to run multiple programs on a single machine, sometimes we might like a single program to do multiple tasks at a time. Threads make it possible for a single process to run multiple operations concurrently. We’ll look at why threads are useful, how to create and interact with threads in Linux, and what makes thread programming particularly challenging.
For today’s lab, you will solve an embarassingly parallel problem using threads. An embarassingly parallel problem is one that is easy to distribute over multiple threads.
We’ll build on our understanding of threads from the previous class and look at how we can use locks to control concurrent accesses to data structures.
Today we will look at the kinds of bugs that concurrent programs can have, and think about how to design a concurrent program to avoid these bugs.
While locks are important for guaranteeing mutual exclusion, they aren’t the only tool available for controlling concurrency. We’ll look at two additional concurrency control primitives today and see how they can help us write interesting concurrent programs.
During this class we’ll wrap up our discussion of thread-based concurrency, at least for now.
Today we will learn how to use graphics processing units (GPUs) to write parallel programs that, when carefully designed, can run tens or hundreds of times faster than parallel programs that use threads on conventional processors.
This week’s lab will require you to implement a parallel computation that can run on a GPU. This computation will be part of a larger system that uses the GPU as a co-processor, a common model for modern workloads.
One of the most interesting and challenging problems computer science is designing and implementing systems that work reliably across multiple machines. We’ll look at what makes this problem difficult and explore some of the interesting techniques that make it possible to build distributed systems that work well.
This week’s lab will combine your experience with networks and distributed systems. You will implement a small distributed system using some of the techniques we’ve seen in class.
In today’s class we’ll look back at a particularly influential systems project—the UNIX operating system. Dennis Ritchie wrote an interesting description of some of the basic features of UNIX and how they came about. We’ll combine that with Richard Gabriel’s commentary on two distinct approaches to system building, and how they fare over time.
The morning section will present their projects during the 9am–noon final exam time slot. The afternoon section will present from 2–5pm.