CS370: Operating Systems

Avi Silberschatz, Peter Galvin, Greg Gagne.
Operating Systems Concepts, 10th edition
Publisher - John Wiley & Sons, Inc.
ISBN-13: 978-1119800361.

• History of Operating Systems
• The OS as a resource manager
• Key principles underpinning OS design

• Processes and multitasking
• Operations on processes
• Context switches
• Process lifecycle and transitions, Shells and Daemons
• POSIX

• Shared memory
• Pipes
• Messages

• Thread models
• Differences between processes and threads
• User and Kernel threads
• Multithreading models
• Threading issues: system calls, cancellation and signal handling
• Support for threading in different operating systems

• Scheduling criteria including fairness and time quanta
• Pre-emptive and non-preemptive scheduling
• Scheduling algorithms: FCFS, shortest jobs, priority, round-robin, multilevel queues
• Evaluating the effectiveness of scheduling algorithms and criteria
• Scheduling on multiprocessors

• Critical Section Problem
• Peterson’s solution
• Synchronization hardware and Instruction Set Architecture support
• Semaphores
• Classical problems of Synchronization:
• Bounded buffers, Readers-Writers, Dining Philosophers
• Monitors
• Synchronization constructs

• Atomic Transactions and Serializability

• The model for deadlocks
• Deadlock Characterization
• Methods for handling deadlocks
• Deadlock Prevention
• Deadlock Avoidance
• Recovery from Deadlocks

• Address binding
• Address spaces
• Swapping of Processes
• Contiguous Memory allocation
• Paging
• Shared Pages
• Structure of Page Tables
• Hardware support for paging
• Memory protection in paged environments
• Segmentation
• Use of Segmentation and Paging

• Demand Paging
• Copy-on-Write
• Page Replacement
• Belady’s anomaly and stack algorithms
• Allocation of Frames
• Thrashing and working sets
• Memory-mapped files
• Allocation of Kernel Memory

• Virtual Machine Monitors
• Type-1 hypervisor
• Type-2 hypervisor

• File System Structure
• File System Implementation
• Virtual file systems
• Contiguous allocation
• Linked allocations
• File Control Blocks
• Unix File System and inodes
• NTFS, and FAT32

• Disk Management
• Swap space management
• Disk scheduling algorithms: FCFS, SSTF, SCAN, C-SCAN, and LOOK
• Storage based on flash memory and SSDs

Responsibilities
Track the schedule page of the course website daily. The schedule page includes a time-stamp of when it was last updated. Make sure that you refresh this page.
Ensure that you complete the reading and programming assignments


Generative AI Use and Consequences
Use of AI tools such as ChatGPT, Claude, Github Co-Pilot, and/or their ilk to write or “improve” your code or written work at *any* stage is prohibited.  Turning in code or an essay written by generative AI tools will be treated as turning in work created by someone else, namely an act of plagiarism and/or cheating.

Ultimately, you will get out of the class what you put in. Simply copying and pasting code from generative AI tools is neither ethical nor does it contribute to your learning experience. There are multiple reasons why these generative AI tools are detrimental to your learning experience:

1. They rob you of the ability to think and learn the concepts for yourself. Solving problems is an essential step to gaining a solid understanding of the material.
   
2. You will struggle with the in-classroom quizzes and exams where you will not have access to these tools.
   
3. While we acknowledge that these tools are likely to become an important part of a software engineer's workflow in the future, you are much more likely to use these tools in an effective manner if you already have expertise in the relevant technical topics. Developing such expertise requires putting in the effort to learn these topics without the assistance of these tools.
4. These tools are prone to generating imperfect or even incorrect solutions, so trusting them blindly can lead to bad consequences.

Policies for Makeup exams and Late Submissions:
The dates for all exams, excluding quizzes, will be announced. All exams (quizzes, midterm and the comprehensive Final) will be held in the same classroom as regular lectures. There will be no make-up exams for missed quizzes, mid-term, and finals. If you have a family or medical emergency that prevents you from attending the midterm, or the final, let me know as soon as possible and be able to provide documentation to reschedule.

All assignments are due at 8:00 PM on the due date. There is a late penalty of 10% per-day for up to a maximum of 2 days. Submissions are automatically disabled 48 hours after assignments are due -- if you have not submitted the assignment by then, you will receive an automatic zero. All assignments will be posted at least 2 weeks prior to its due date. We will have a mix of both written and programming assignments. All assignments will be posted on the assignments page. All assignments should be submitted using Canvas.

Academic Integrity & Student Conduct
All students are expected to be familiar with the policies in the department's student information sheet available here.

This course will adhere to the CSU Academic Integrity Policy as found on the Student Responsibilities page of the CSU General Catalog and in the Student Conduct Code. At a minimum, violations will result in a grading penalty in this course and a report to the Office of Student Resolution Center.