ZuoTi.Pro
Question

Q2.Assume the following schedule for a set of three jobs, A, B, and C, with a single CPU. Assume ...

Q2.Assume the following schedule for a set of three jobs, A, B, and C, with a single CPU. Assume that there is no i/o.
--A runs first (for 10 time units) but is not yet done.
--B runs next (for 10 time units) but is not yet done
--C runs next (for 10 time units) and runs to completion
--A runs to completion (for 10 time units)      
--B runs to completion (for 5 time units)

Which scheduling disciplines could allow this schedule to occur? Explain.
(a)     FIFO  
(b)      Round Robin.
(c)      STCF (Shortest Time to Completion First)

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

Homework Answers

Answer #1

る( ins to tarre CArit-.tul rd (omFitti * rot compleled t e starts rinri ird, Cates, A i人 prompted Smilaily e and calo -folloxtime quantum to cniU Round Pobn tely depend onもme antum Noo, antum. tHeve A, B,C arTve at a limo 0 ?onkl lime 20 IS lo CS ScaGrant chart: to lolo O S me units The refore, ↑t -follows R und Robo- option- b Cormect CS Scanned with CamScanner

0 0
Add a comment
Know the answer?
Add Answer to:
Q2.Assume the following schedule for a set of three jobs, A, B, and C, with a single CPU. Assume ...
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

  • (30 points) Assume you have three processes with the following attributes running on a single CPU...

    (30 points) Assume you have three processes with the following attributes running on a single CPU (uniprocessor system): Process 1/0 Burst Total CPU Time Arrival Time CPU Burst | 05 22 12 B 7 10 C D Create three scheduling simulations for these processes using the following algorithms: a. First Come First Served (FCFS) b. Round Robin, Time Slice = 2 c. Shortest Job (CPU Burst Time) First with NO Preemption Use the simulation format we covered in class to...

  • Assume that the three processes arrived in order: Processes                            CPU Burst Time P1  &n

    Assume that the three processes arrived in order: Processes                            CPU Burst Time P1                                           17 P2                                            6 P3                                            8 a.     Please draw the Gantt chart if FCFS scheduling is used. b.    Please calculate the average waiting time and average completion time under FCFS. You MUST show the calculation procedure. c.      Please draw the Gantt chart if Round Robin is used. d.    Please calculate the average waiting time and completion time under RR with q = 3. You MUST show the calculation...

  • 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...

  • Assume that you have four different processes with the following attributes: Process   Arrival time.   CPU Burst....

    Assume that you have four different processes with the following attributes: Process   Arrival time.   CPU Burst.   I/O Burst Total CPU time A. 0 4 4 9 B 3 2 3 7 C 6 5 1 11 D 12 1 1 5 As we did in class, perform a scheduling simulation using these four processes according to the following algorithms: 1) First Come First Serve 2) Round Robin with time slice = 1 3) Round Robin with time slice = 3...

  • 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...

  • We have two jobs A and B. The execution pattern for A is CPU first IO...

    We have two jobs A and B. The execution pattern for A is CPU first IO next, and of B IO first CPU next. Each one needs CPU time of 40mn. The IO time of A is 50% of total execution time of A. Likewise for B. Ignore context switch time or initial program load time (assume that it is zero). Total execution time is defined to be CPU time plus IO time. The unit mn stands for minute. (a)...

  • 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...

  • Problem 9.1. Given the following jobs that are to be processed on a single processor: rocesS...

    Problem 9.1. Given the following jobs that are to be processed on a single processor: rocesS Burst Time in ms Arri Time in ms 0 2 6 16 20 12 3 6 10 a. Show the schedule using the scheduling algorithms shortest p rocess next, a non- preemptive algorithm, and shortest remaining time, a preemptive algorithm. Use a GANTT chart to show the schedules in a manner similar to the FCFS schedule shown below: (1 unit 2 ms) 16 b....

  • 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...

  • 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...

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
ADVERTISEMENT