CST 334 Week 2

 This week I learned about processes and how they switch between running states. When processes switch seamlessly between one another, it creates the illusion that the cpu is running many processes at once. I also learned about how various scheduling algorithms impact the average response time and turn around time of the operating system. Factors such as duration, and how much a process will need to do I/O will impact the performance metrics of these scheduling configurations. For example, a round robin scheduler will benefit turn response time but degrade turn around time.But I learned that today many schedulers implement a multi-level feedback queue (MLFQ). Jobs are assigned priority levels and are assigned to a queue based on this designation. Jobs are initially given the highest priority, but their priority will decrease if it uses the time it is allotted. It will maintain its priority if it relinquishes control of the CPU (like when performing an I/O operation).

I also learned more about linux commands and how they work. The shell interprets text from the command line looking for commands which are executable programs,  and any arguments that may be passed into the program. Once the program is found in the file system, the OS calls fork() and waits until the command is executed in the child process. The output following the execution of programs and system calls can be redirected to specific files. Additionally the output of one program can be used as input for another program.