CS 351: Systems Programming

Calendar

The course calendar is tentative and subject to change.

Jan 15

• Slides: Syllabus & Overview
• Detailed syllabus

Jan 17 - Jan 29

• Topic: C
• Slides: C Primer; C Primer (abridged)
• Reading: K&R
• Reading: Pro Git chapters 1 and 2

Jan 31

• Topic: The Process
• Slides: The Process & ECF
• Reading: CS:APP 8.1-8.2

Feb 5

• Topic: Process Mgmt (fork/exit)
• Slides: Process Management 145
• Reading: CS:APP 8.3-8.4.2

Feb 7

• Topic: Process Mgmt (wait/exec)
• Slides: Process Management 2
• Reading: CS:APP 8.4.3-8.4.6

Feb 12 - Feb 19

• Topic: Process Mgmt (shell impl/signals)
• Slides: Process Management 3
• Reading: CS:APP 8.5-8.6

Feb 21 - Feb 28

• Topic: Memory Hierarchy and Caching
• Slides: Memory Hierarchy and Caching
• Reading: CS:APP 6.1-6.6

Mar 4

• Midterm Exam

Mar 13 - Mar 27

• Topic: Virtual Memory
• Slides: Virtual Memory
• Reading: CS:APP 9.1-9.7

Apr 1

• Topic: Dynamic Memory Allocation
• Slides: Dynamic Memory Allocation
• Reading: CS:APP 9.9.1-9.9.4

Apr 3 - Apr 10

• Topic: Implementing malloc
• Slides: Implementing malloc
• Reading: CS:APP 9.9.5-9.9.14

Apr 15 - Apr 17

• Topic: Garbage collection
• Slides: Garbage collection
• Reading: CS:APP 9.10

Apr 22 - Apr 29

• Topic: System-level I/O
• Reading: CS:APP 10.1-10.12

May 1

• Topic: Final Exam review
• Trivia questions/answers

TBA

• Final Exam

Machine Problems

Please note:

• Start early! (but wait until the MP is assigned -- i.e., the assigned date is filled in)
• Read through the entire writeup before starting to code.
• Ensure that your code compiles with no errors nor warnings.
• Machine problems are individual assignments. Plagiarism will result in everyone involved getting a zero.

1. Preliminaries (5 points)

   • Pro Git: read chapters 1 and 2
   • Assigned: Jan 20;
     Due: Jan 29

2. Unix Utilities (32 points)

   • Assigned: Jan 27;
     Due: Feb 9

3. Writing a Shell (80 points)

   • Assigned: Feb 10;
     Due: Mar 1

4. Cache Simulation & Optimization (53 points)

   • Assigned: Mar 2;
     Due: Mar 22

5. Implementing a Dynamic Memory Allocator (80 points)

   • Assigned: Apr 6;
     Due: Apr 19

Resources

Instructor

Michael Saelee

• Office: SB 226C
• Hours: Wed,Fri 3:15PM-5:15PM

TAs

All hours in SB 108:

Section 01: Andrew Neth

• Hours: Thu 1:00PM-3:00PM

Section 01: Arushi Rai

• Hours: Tue 11:30AM-1:30PM

Section 02: Youbin Roh

• Hours: Mon 11:25AM-1:25PM

Section 03: Moueed Salameh

• Hours: Mon/Fri 4:00PM-5:00PM

Primary references

• Course syllabus
• Vimeo channel
• Computer Systems: A Programmer's Perspective
  • Table of Contents
• The C Programming Language / "K&R"
• The Linux Programming Interface
• Advanced Unix Programming (AUP)

C

• The C Standard Library
• The comp.lang.c FAQ
• "The C Book"
• Some handy educational materials having to do with C, pointers, and data structures @ the Stanford CS Education Library

Library / Syscall references

• Beej's Guide to UNIX IPC
• Linux man pages on the WWW
• GNU C Library (glibc) documentation; of particular interest:
  • Signal handling
  • Low-level Input/Output

Other references

• A Tiny Guide to Programming in 32-bit x86 Assembly Language
• An survey of dynamic storage allocation techniques: Paul Wilson et. al., Dynamic Storage Allocation: A Survey and Critical Review, 1995.
• Doug Lea's malloc
• An interactive VM simulator and overview

Development Tools

• The Bash manual
• Learn one of these editors:
  • The GNU Emacs manual
  • The Vim manual
• The git version control tool:
  • Pro Git
  • Git Magic.
• GDB, the GNU debugger:
  • The GDB manual
  • A handy reference card
  • A guide to using gdb to debug child processes

Exams and Study Guides

• The IIT final exam schedule
• Sample exams:
  • Midterm Fall 2019, Written solutions
  • Midterm Fall 2017
  • Midterm Spring 2015
  • Midterm Spring 2012
  • Sample final, Spring 2015, Solutions
  • Final, Fall 2012
• Practice caching problem
• Practice VM translation exercises; solutions:
  • Problem #1: (a) 0xE7 (b) 0xCA
  • Problem #2: (a) 0xCB (b) 0x92
  • Problem #3: (a) 0xA0 (b) 0x00
• Practice GC problem