+ Post New Thread
Results 1 to 2 of 2
  1. #1
    Newbie level 6
    Points: 1,299, Level: 8

    Join Date
    Feb 2006
    Posts
    14
    Helped
    1 / 1
    Points
    1,299
    Level
    8

    operating system numericals

    Hi, this question is from Operating Systems By Galvin.

    In this question according to solution manual I got the (a) part but for parts (b) & (c) I'm getting answers 6.86 and4.86 respectively and its not in the manual.

    So , can someone help solving it.

    6.4 Suppose that the following processes arrive for execution at the times indicated. Each
    process will run the listed amount of time. In answering the questions, use nonpreemptive
    scheduling and base all decisions on the information you have at the time the decision
    must be made.
    Process Arrival Time Burst Time
    P1 0.0 8
    P2 0.4 4
    P3 1.0 1
    a. What is the average turnaround time for these processes with the FCFS scheduling
    algorithm?
    b. What is the average turnaround time for these processes with the SJF scheduling algorithm?
    c. The SJF algorithm is supposed to improve performance, but notice that we chose to
    run process P1 at time 0 because we did not know that two shorter processes would
    arrive soon. Compute what the average turnaround time will be if the CPU is left
    idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1
    and P2 are waiting during this idle time, so their waiting time may increase. This
    algorithm could be known as future-knowledge scheduling.
    Answer:
    a. 10.53
    b. 9.53
    c. 6.86

    •   Alt7th June 2006, 19:22

      advertising

        
       

  2. #2
    Newbie level 1
    Points: 217, Level: 2

    Join Date
    Oct 2011
    Posts
    1
    Helped
    0 / 0
    Points
    217
    Level
    2

    Re: operating system numericals

    Quote Originally Posted by rock_win View Post
    Hi, this question is from Operating Systems By Galvin.

    In this question according to solution manual I got the (a) part but for parts (b) & (c) I'm getting answers 6.86 and4.86 respectively and its not in the manual.

    So , can someone help solving it.

    6.4 Suppose that the following processes arrive for execution at the times indicated. Each
    process will run the listed amount of time. In answering the questions, use nonpreemptive
    scheduling and base all decisions on the information you have at the time the decision
    must be made.
    Process Arrival Time Burst Time
    P1 0.0 8
    P2 0.4 4
    P3 1.0 1
    a. What is the average turnaround time for these processes with the FCFS scheduling
    algorithm?
    b. What is the average turnaround time for these processes with the SJF scheduling algorithm?
    c. The SJF algorithm is supposed to improve performance, but notice that we chose to
    run process P1 at time 0 because we did not know that two shorter processes would
    arrive soon. Compute what the average turnaround time will be if the CPU is left
    idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1
    and P2 are waiting during this idle time, so their waiting time may increase. This
    algorithm could be known as future-knowledge scheduling.
    Answer:
    a. 10.53
    b. 9.53
    c. 6.86
    solution for b ) suppose the algorithm SJF í non preemptive in nature then only you ould get that asnwer 9.53.


    In that case the first job arrives at 0.0 time and that is the shortest one having 8 and then it is non prrempmtive in nature so till s seconds you can't start another one. Meanwhile at 0.4 time and 1.0 time new job entered. So after 8 seconds shortest job is one whose time 1 sec so it willececute first . After 9 seconds the only job with 4 secinds left so it will exceute. so total time will be


    ( 8+ ( 9 - 1) + (13-.4) ) /3 = 9.53 í the ănswer



+ Post New Thread
Please login