PROBLEM:

ABBREVIATIONS:

EXAMPLE:

PLEASE ANSWER THE QUESTION ABOVE!

4. For this problem you will need to revise the scheduling analysis for the deterministic workload defined in the "03 Processes" notes, to take into consideration process switching time. Assume that task switching time is 1 cycle. Fill out the table below for FCFS scheduling Fill out the table below for Round-robin, q-3 a. b. Processv service finish name time required start time timeT W 12 mean 4 Scheduling Analysis Deterministic Modeling Examples Definitions: Process p requires t time to execute abbrev formula Measure turnaround time wait time penalty ratio response ratio response time finish time - arrival time T-t first run- arrival time . In all examples . 20 cycles . 5 jobs . same throughput . utilization 100% no task switch time predetermined workload, no I/O 0 1 2 3 45 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Arriva A B 45 First-come, First-served Scheduling Analysis 0 1 2 3 45 678 9 10 11 12 13 14 15 16 17 18 19 Arriva AB 0 12 3 456 7 8 9 10 11 12 13 14 15 16 17 18 19 Al X X X Process arrival service start finish T W nametime required time time 10 15 20 0 2 1.4 5 3.5 1 1.2 3 1.6 10 15 12 6.2 2.2 1.74 46 mean