Given the following information Job A , Arrival Time 0 , CPU Cycle 15 Job B , Ar

Question

Given the following information

Job A, Arrival Time 0, CPU Cycle 15
Job B, Arrival Time 2, CPU Cycle 02
Job C, Arrival Time 3, CPU Cycle 14
Job D, Arrival Time 6, CPU Cycle 10
Job E, Arrival Time 9, CPU Cycle 01

1. Calculate which jobs will have arrived ready for processing by the time the
   first job is finished or first interrupted using each of the following scheduling algorithms.

   a. FCFS
   b. SJN
   c. SRT
   d. Round Robin (use a time quantum of 5, but ignore the time required for
           context switching and natural wait)

2. Using the same information from the previous exercise, calculate the start
   time and finish time for each of the five jobs using each of the following
   scheduling algorithms. It may help to draw the timeline.

   a. FCFS
   b. SJN
   c. SRT
   d. Round Robin (use a time quantum of 5, but ignore the time required for
           context switching and natural wait)

3. Using the same information given for Exercise 1, compute the turnaround time for
   every job for each of the following algorithms (ignore context switching overhead times).
   It may be helpful to draw the timeline.

   a. FCFS
   b. SJN
   c. SRT
   d. Round Robin (use a time quantum of 5)

   Please provide answers for all items listed above;
     1a, 1b, 1c, 1d, 2a, 2b, 2c, 2d, 3a, 3b, 3c, 3d

Explanation / Answer

A. FCFS

B,C,D,E will be in queue by the time the first job A is finished their arrival time is less than the CPU cycle of A. It is executed based on the First Come First Serve basis on arrival time.

B. SJN

Shortest CPU cycle is for job E having 1 CPU cycle, so it will execute first.
Based on the ascending order of CPU cycle B,D, C, A will be in queue.

C. SRT

Shortest Remaining Time will select the job for execution which has the least amount of remaining time until its completion.
Job E has the shortest remaining time and so it will be executed first. When it is finished, then jobs in queue will be in order as B, D, C, A, C, D, A, A

D. Round Robin
In Round Robin the time slices gets assigned to each of the jobs in equal portions and in a circular order which handles all processes irrespective of their priority.
Since we are using a quantum time of 5 but ignoring the context switching and natural wait time required, so
job A is executed first. After it gets finished then next jobs will be in order as B, C, D, E, A, C, D, A.

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.