CST 334 - Week 2

 The second week of this course touched a lot on the different types of scheduling and how operating systems can handle processes. I learned about context switches and how this technique can be used to switch from running a current process to a different one. This can be both involuntary (time interrupt) and voluntary (system call). While these are described as low level mechanism of running processes, the readings this week also provided a lot of information on scheduling policies that operating systems employ. Additionally, we had a programming assignment where we implemented these different scheduling algorithms. This included the following:

• First In, First Out (FIFO)
• Shortest Job First (SJF)
• Shortest Time-to-Completion First (STCF)
• Last In, First Out (LIFO)
• Round Robin (RR)

Part of our lab also included information on how these scheduling policies calculated the response and turnaround time, which tied in a lot of this information together.