SE 317: Operating Systems מערכות הפעלה
Course, Kinneret College on the Sea of Galilee, Software Engineering, 2023
Semester 1, 5784
Course Details
- Lecture: Monday 12:00pm-3:00pm in Room 6201
- Targil: Tuesday 2:00pm-4:00pm in Room 6201
- Instructor: Michael J. May
- Email: mjmay (at) kinneret,ac,il
- Metargel: Avi Zion
The full detailed syllabus of the course is available here.
Topics:
This is an introductory course to modern operating systems. Topics include process synchronization and interprocess communication, processor scheduling, memory management, virtual memory, signal handling, device management, I/O, and file systems (time permitting). The course recitations and homework will include a hands-on study of the Linux operating system design and kernel internals, including work with virtual Linux environments. The course will include experience with commercial virtualization tools and open source software.
Course Goals:
At the end of the course the student will be able to:
- Write command line programs in C for standard Linux virtual machines which use standard system calls (ex.
fork()
andnice()
), low-level I/O (ex.open()
, file descriptors), and stream-level I/O (ex.fopen()
,FILE*
). - Write a Makefile and use it to compile C programs using
make
andgcc
. - Use the GNU debugger
gdb
to debug command line applications in Linux, including multi-process and multi-threaded ones. - Manage source code repositories using
git
and Github. - Explain the basics of OS protection mechanisms and structures (i.e. process, thread, memory address space, virtual memory).
- Use the PThreads library to write C programs which use user level threads, semaphores, and condition variables.
- Explain the fundamentals of mutual exclusion and deadlock detection and prevention.
- Explain the fundamentals of process and thread scheduling and how the mechanisms used in the O(1) Scheduler and the Linux Completely Fair Scheduler (CFS) work.
Reading
The following books are used in the class:
- Thomas Anderson and Michael Dahlin. Operating Systems: Principles and Practice. Recursive Books, 2nd edition, 2014.
- Robert Love. Linux Kernel Development. Addison-Wesley Professional, 3rd edition, 2010.
- William Stallings. Operating Systems: Internals and Design Principles. Prentice Hall, 8th edition, 2015.
The library has copies of the books listed, but students are encouraged to purchase the books as needed.
Assignments
There will be three assignments during the course of the semester, one for each portion of the course. They will involve a fairly significant amount of Linux systems programming. All will involve a large amount of C programming and independent learning.
Each project can be done alone or in groups of two (2) students.
Assignment 1 (20%): Processes and Executables. Due: 9 Jan 2024
Assignment 2 (20%): C Programming and Processes. Due: 30 Jan 2024
Assignment 3 (20%): Threads, Monitors, Locks. Due: 4 March 2024
Assignments are on Moodle. More details of assignments will be given during the course of the semester.
Grading Criteria
Final grades will be calculated by combining grades from assignments and quizzes. The final grades will be calculated as follows:
- 60% Programming Assignments (required)
- 20% Recitation exercises (required)
- 20% In class quizzes (required)
Lecture Slides and Notes
# | Date | Topic | Slides |
---|---|---|---|
1 | 25 Dec | Introduction, OS Overview | |
2 | 1 Jan 2024 | OS History, Virtual Machines, 4 OS Fundamental Concepts | |
3 | 8 Jan | 4 Fundamental Concepts, Base and Bound Memory Protection | |
4 | 15 Jan | Base and Bound to Segments, Introduction to scheduler, PCB, SMT, Fork | |
5 | 22 Jan | Signals and Process Control, I/O High and Low, Drivers, Sockets | |
6 | 29 Jan | Concurrency: Processes and Threads | |
7 | 5 Feb | Cooperating Threads, Synchronization, Mutual Exclusion | |
8 | 12 Feb | Semaphores, Condition Variables and Monitors, Barrier Synchronization, Readers/Writers | |
9 | 19 Feb | Monitors and High Level Languages, Scheduling Algorithms | |
10 | 26 Feb | Scheduling Case Studies, Starvation, Deadlock | |
11 | 4 Mar | Deadlock, Memory Management and Translation, Segments |
Academic Integrity
Cheating of any sort will not be tolerated. Student collaboration is encouraged, but within limits as set forth in the college’s rules on academic integrity. Any students caught cheating will be immediately referred to the department head and the Dean and may receive a failing grade for the course.
Cheating includes:
- Copying information, content, or verbatim text from other students, internet sites, books (other than the ones listed in the bibliography), other unaffiliated individuals to answer questions, solve problems, or aid in programming projects.
- Copying or submitting source code, documentation, or other programming aids without attribution from other students, web sites, online repositories, text books, open source programs, or other unaffiliated individuals.
- Project teams which submit work which is identical or substantially identical to work submitted by other project teams, whether current or from previous years.
- Other forms of academic misconduct as described at this link or as reasonably assessed by the instructor, program head, or dean.
If you have any questions about what constitutes cheating in the above rules, contact the instructor as early as possible.