Week 26

 Write a 1 - 2 paragraph journal post, of at least 250 words, of what you learned this week in CST 334.


    There was a lot to learn this week. Especially with all the lectures and readings assigned.  The first thing I learned about was CPU Scheduling Algorithms, intending to optimize turnaround time and response time. I learned about policies like FIFO, SJF, STCF, RR, and MLFQ. FIFO is a term I first learned in my Data Structures and Algorithms course, in which the first one in is the first one out. It is simple, but long jobs end up delaying short ones. Shortest job first is optimal for turnaround time, but requires knowing job lengths. Shortest time to completion first is better for dynamic arrivals, where we don't know what's coming next. Round robin is fair and slices response time, but worsens turnaround time. MLFQ uses priority queues and feedback to classify jobs. The rules include: Higher priority runs first, equal priority > Round Robin, new jobs start at highest priority, jobs using full time slice are demoted, then periodic priority boost to prevent starvation.

    I also learned about process management. Processes are running instances with a state and programs are static code on disks. I learned about fork(), creating a child process (a copy of the parent). exec() replaces process memory with a new program. and wait(), parent waits for child to exit.. Also about context switching, voluntary vs involuntary which we further discussed with our peers in our discussion. 

    We also went over formulas such as Turnaround Time (TAT): Completion Time - Arrival Time and Response Time (RT): First Run Time - Arrival Time. Where TAT includes full execution. RT measures initial delay.

Comments

Popular posts from this blog

Week 11

Week 12

Week 9