10.3. Homework - Analysis of SchedulersΒΆ

  1. Consider the following table showing arrival times and service times for a set of static processes. Draw a chart illustrating their execution and compute the average turnaround time and average response time using the following scheduling algorithms. (See Scheduler Metrics)

    1. First Come, First Served Scheduler
    2. Shortest Job Next Scheduler
    3. Round Robin Scheduler with time quantum = 10
    Process Arrival Time Service Time
    A 0 21
    B 5 9
    C 23 30
    D 26 10
    E 30 15

  2. Now consider a Multi-level Priority Queue Scheduler with 3 queues. The scheduler uses time quantum of 5 15 20 for the three queues. The following table shows processes that will block for I/O a few times before completing. The table shows the arrival times, service times and following blocked times for a set of processes. Draw a chart illustrating their execution and compute the average turnaround time, average response time and average waiting time. (See Scheduler Metrics)

    Process Arrival Time Service Time Blocked Time
    A 0

    15

    10

    8

    39

    45
    B 5

    9

    4

    3

    8

    29

    28

    27
    C 23

    30

    35

    20

    35

    35
    D 26

    10

    16

    11

    27

    37
    E 30

    15

    18

    3

    3

    4

    6

    25

    35

    25

    26

    27