Operating System

Question 1                                                                                                                                    

Consider the following set of processes, with the length of the CPU burst given in milliseconds:

Process Arrival Time Priority Burst Time
  0 3 10
  1 1 1
  2 2 2
  4 1 3
  8 4 4

 

The processes are assumed to be arrived in the order, , , ,

  1. Draw Gantt charts that illustrate the execution for these processes using the following scheduling algorithms:
  2. FCFS
  3. SJF (Preemptive and Non-Preemptive)
  • SRTN (Preemptive and Non-Preemptive)
  1. Priority (Preemptive and Non-Preemptive)
  2. RR (quantum = 1)

 

  1. What is the turn-around time of each process for each of the scheduling algorithms in part(a)?

 

  1. FCFS<< P1=X, P2=X, P3=X ……>>
  2. SJF (Preemptive and Non-Preemptive)<<Preemptive: P1=X, P2=X, P3=X ……, Non-Preemptive: P1=X, P2=X, P3=X……. >>
  • SRTN (Preemptive and Non-Preemptive)<< Preemptive: P1=X, P2=X, P3=X ……, Non-Preemptive: P1=X, P2=X, P3=X……. >>
  1. Priority (Preemptive and Non-Preemptive)<< Preemptive: P1=X, P2=X, P3=X ……, Non-Preemptive: P1=X, P2=X, P3=X……. >>
  2. RR (quantum = 1)

 

 

  1. What is the waiting timeof each process for each of the scheduling algorithms in part(a)?
  2. FCFS << P1=X, P2=X, P3=X ……>>
  3. SJF (Preemptive and Non-Preemptive) << Preemptive: P1=X, P2=X, P3=X ……, Non-Preemptive: P1=X, P2=X, P3=X……. >>
  • SRTN (Preemptive and Non-Preemptive) << Preemptive: P1=X, P2=X, P3=X ……, Non-Preemptive: P1=X, P2=X, P3=X……. >>
  1. Priority (Preemptive and Non-Preemptive) << Preemptive: P1=X, P2=X, P3=X ……, Non-Preemptive: P1=X, P2=X, P3=X……. >>
  2. RR (quantum = 1)

 

 

  1. Which of these algorithms results in the minimum average waiting time?

 

Note: To show calculation.

  1. FCFS
  2. SJF (Preemptive and Non-Preemptive)
  • SRTN (Preemptive and Non-Preemptive)
  1. Priority (Preemptive and Non-Preemptive)
  2. RR (quantum = 1)

 

Question 2                                                                                                                                    

Research on the Web regarding the scheduling mechanisms provided by the Windows XP and Linux operating systems. Consolidate your findings into an essay of 1000 to 1300 words.

 

Note:

  1. The answer to the second question must be in an essay format divided into paragraphs.
  2. Provide reference listing in IEEE reference format.
  3. Refer to “Operating System Concepts – 9th Edition”(Attached) for Question2

 

WE ACCEPT