HomeworkLib
Question

Five batch jobs (A,D,I,J,K) arrive at a computer at the same time(at time=0). The quantum size...

Five batch jobs (A,D,I,J,K) arrive at a computer at the same time(at time=0). The quantum size of this system is 2 units of time. For each of the scheduling methods given below, calculate the average waiting time for the 5 jobs. Show (use timing diagrams) and explain your steps. You can prepare it by hand or on a computer.

The following jobs and the estimated running times are defined:

A

2

B

6

C

4

D

8

E

2

F

10

G

4

H

8

I

4

J

12

K

4

L

6

M

10

N

14

Note: Whenever needed, assume processing order as A, B, C, D, ...

Hint: For example, job A requires 10 units of time of CPU time and arrives at the system at time=0. If it leaves the system at time=30, the waiting time for this job is (30-0)-10=20 units of time.

  1. a) Round robin scheduling

  2. b) First-come first-served (FIFO) scheduling

  3. c) Shortest-Remaining-Job-First(SRJB) scheduling

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 0
Add a comment
Know the answer?
Add Answer to:
Five batch jobs (A,D,I,J,K) arrive at a computer at the same time(at time=0). The quantum size...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Design Principles Canvas Ā 8 pts Question 35 Five batch jobs, A, B, C, D, and...

    Design Principles Canvas Ā 8 pts Question 35 Five batch jobs, A, B, C, D, and E, arrive at a computer system at time 0, 1, 2, 3, 4, respectively. And they have service time of 7.1. 3,5, and 4, respectively. The new jobs arrive a little ahead of the expiration of time slices. For each of the following scheduling algorithms, determine the turnaround time for each process for all jobs. Ignore process switching overhead. • Round robin with a...

  • Five batch jobs, A through E, arrive in alphabetical order at a computer at almost the...

    Five batch jobs, A through E, arrive in alphabetical order at a computer at almost the same time (i.e. they all arrive before the next scheduling event occurs). They have estimated running times of 500, 300, 600, 700, and 200 ms, respectively. Using diagrams, show how the process scheduling algorithms below would schedule these jobs, and calculate the mean process turnaround time (assuming no process switching overhead): FCFS SPN RR with a quantum of 100ms RR with a quantum of...

  •          Process                    Arrival Time            &nbsp

             Process                    Arrival Time                             Burst Time                         P1                                0                                              2                         P2                                1                                              1                         P3                                2                                              4                         P4                                3                                              2                         P5                                4                                              1 Consider a set of processes given above with the arrival time and the length of CPU burst time given in cycles. Show a Gantt chart and calculations of average turnaround time and average waiting time of these processes under the shortest job first (SJF) with preemption CPU scheduling algorithm and the round-robin...

  • 4. Consider a ready queue with four processes :- Process Arrival Time Burst Time (ms) P1...

    4. Consider a ready queue with four processes :- Process Arrival Time Burst Time (ms) P1 Priority P2 P3 P4 P5 For each of the following CPU scheduling algorithms, determine the turnaround and average waiting time for each of the process :- a. Shortest remaining Time First b. Shortest Job First C. Priority Scheduling (Both pre-emptive and non-preemptive) d. Round Robin (quantum is 1 ms)

  • The following processes P1, P2, P3, P4 and P5 arrive at the same time (t =...

    The following processes P1, P2, P3, P4 and P5 arrive at the same time (t = 0). Establish a timeline of the process scheduling for the following scheduling algorithms while also identifying start times for each process. FCFS (first come, first serve; assume order of P1, P2, P3, P4 and P5) SJF (shortest job first) Priority iv Round Robin (quantum = 1, assume order of P1, P2, P3, P4 and P5) Determine the average waiting time for each algorithm.

  • Assume a dynamic queue which is serviced by a Priority Based Round Robin algorithm such that ther...

    Assume a dynamic queue which is serviced by a Priority Based Round Robin algorithm such that there exists three priorities (1,2,3) which are used as multipliers of the basic time quantum value with the resulting number being the maximum service time the corresponding job will receive each time it gets the CPU. For a maximum amount of time equal to 1 basic time quantum , a priority 2 job gets the CPU for the maximum amount of time equal to...

  • Given the following set of processes---with the specified length of the CPU burst, arrival time, and...

    Given the following set of processes---with the specified length of the CPU burst, arrival time, and priority---compute response time for P1-P5 with round-robin scheduling with time quantum of 10 units. Also compute average response time. Assume that a newly arriving process arrives first at time T- and a process that is preempted due to the completion of its quantum arrives at time T+ in the waiting queue. (Note: Show the Gantt chart and other working details in your worksheet.) Process...

  • Five batch Threads. A through E, occurred in a Process X at almost the same time....

    Five batch Threads. A through E, occurred in a Process X at almost the same time. They have estimated running times of 10, 6, 2, 4, and 8 msec. For each of the following thread scheduling algorithms, determine the mean thread turnaround time. Ignore thread switching overhead. A) Round robin. B) First-come, first-served (NP) (run in order 10, 6, 2, 4, 8).

  • Five processes arrive to run on a CPU. The scheduler puts them in its data structure....

    Five processes arrive to run on a CPU. The scheduler puts them in its data structure. The table below lists the processes, how much CPU time each will need, and the priority of each process. One(1) is the highest priority and 4 is the lowest priority. Process CPU time needed Priority P1 P2 P3 NNW-W a. The scheduler uses First Come First Serve to schedule the jobs. Fill in the time line below showing at what time each process starts...

  • In the example of producer-and-consumer problem (slide-31), which semaphore is used to implement a critical section...

    In the example of producer-and-consumer problem (slide-31), which semaphore is used to implement a critical section for the shared variable, buffer? s n e all of them None of tem Deadlock may happen due to User consumes too much resource User holds some resources and waits for more System does not have shared resources There are no mutual exclusions of user processes Users hate each other Which of the following OS scheduling policy has the worst performance (response time)? Shortest...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT