CSC369H5 Chapter Notes - Chapter 5: Fifo (Computing And Electronics)
Document Summary
The time from when the job arrives to when it"s rst scheduled. First in, first out (fifo) algorithm simple & easy to implement. If rst in takes too long, it delays the small tasks from completing turnaround time could be huge assuming all task arrive at same time. Runs shortest job rst, then next shortest solves fifo problems. Problem: small time processes arrive after huge process begins. To stop a process midway and perform context-switch. Each time job enters system, check all processes for closest completion time and. Response time get scheduled when smaller background jobs are. Now all smaller jobs need to nish before a longer job can even start. Person on computer doesn"t want to wait for program they"re using to.
