THE QUESTION:

THE TEMPLATE:

AN EXAMPLE:

Assume the scheduler uses the Shortest Remaining Time First (SRTF) algorithm. Consider the following three processes which each require one CPU burst followed by one I/O burst, followed by one final CPU burst. The scheduling starts at time T0. Only the current CPU burst should be considered for the shortest remaining time. Note: if there is a tie between the shortest times, please pick the processes with the highest process ID. Create a process diagram showing the current process on the CPU and the current process performing I/O at each unit of time. Download the template from Canvas, "Homework 5" assignment, under Modules and fill out the process diagram. Attach a screenshot (PNG/JPG) of the complete template to the file attachment tab below. For an example of what your table should look like, see "Homework 5". Answer (screenshot of table) Please select file(s)