HomeworkLib
Question

The CPU and I/O times for 2 processes are shown below. Assume that P1 gets to the ready queue just before P2 and the scheduling algorithm used by the OS is Round Robin with a time slice of 3 time units. Assume that the I/Os for the processes are different so that there is no I/O queue. Assume also that an interrupt from a completed IO for process "X" will place process "X" in the ready queue BEHIND the process that was just interrupted.

Using the first empty graph, describe how the CPU will be assigned to each process and for how long.

Use the seocnd empty graph to show ALL the states that P1 goes through and the amount of time it has remained in that state until it has halted.

2 3 CPU halt P1 6 I/O 5 2 halt CPU 2 3 I/O Busy CPU Idle CPU STATES P2

Please go into detail with your answer!

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:
The CPU and I/O times for 2 processes are shown below. Assume that P1 gets to...
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

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

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

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

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

  • 2. The following processes have 4 CPU burst and 3 I/O bursts each. They are all...

    2. The following processes have 4 CPU burst and 3 I/O bursts each. They are all of the same priority and they arrive in the order P1, P2, P3 at time 0 CPUO 10 CPU 10 CPUI/O 10 CPU 10 10 10 P1 P2 P3 10 10 10 a. Draw three Gantt charts illustrating the execution of these processes using FCFS, SJF, and RR (quantum- 1t) scheduling b. What is the turnaround time of each process for each of the...

  • implement MLFQ using C++ please preferably linked list P1 {4,24,5,73,3,31,5,27,4,33,6,43,4,64,5,19,2} P2 {18,31,19,35,11,42,18,43,19,47,18,43,17,51,19,32,10} P3 {6,18,4,21,7,19,4,16,5,29,7,21,8,22,6,24,5} P4 {17,42,19,55,20,54,17,52,15,67,12,72,

    implement MLFQ using C++ please preferably linked list P1 {4,24,5,73,3,31,5,27,4,33,6,43,4,64,5,19,2} P2 {18,31,19,35,11,42,18,43,19,47,18,43,17,51,19,32,10} P3 {6,18,4,21,7,19,4,16,5,29,7,21,8,22,6,24,5} P4 {17,42,19,55,20,54,17,52,15,67,12,72,15,66,14} P5 {5,81,4,82,5,71,3,61,5,62,4,51,3,77,4,61,3,42,5} P6 {10,35,12,41,14,33,11,32,15,41,13,29,11} P7 {21,51,23,53,24,61,22,31,21,43,20} P8 {11,52,14,42,15,31,17,21,16,43,12,31,13,32,15} will compute the overall wait times, response times, and turnaround times for each process and averages for FCFS the processes follow {CPU, IO, CPU, IO, ...} output should look like this Now Running: P1 Ready Queue: Process Burst P2 18 P3 6 P4 17 P5 5 P6 10 P7 21 P8 11 Now In I/O: Process...

  • Consider a multilevel feedback queue shown below. Assuming that the following processes are the only ones...

    Consider a multilevel feedback queue shown below. Assuming that the following processes are the only ones that exist, determine the finish time for each of the processes. Assume that each queue is following FCFS scheduling policy. CPU first schedules all processes in the top queue (Quantum-8) before scheduling processes in queue 2 (Quantum 16), and only then it will schedule processes in queue 3 (FCFS). CPU Burst time Arrival time Priority Process P1 8 15 1 P2 10 15 2...

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

  • This assignment requires you to create simulations for different scheduling algorithms commonly employed by operating systems...

    This assignment requires you to create simulations for different scheduling algorithms commonly employed by operating systems to achieve multiprogramming. All problems in this assignment assume the following: The simulations you will be creating are for a uniprocessor system (single CPU). Processes in these simulations will require CPU bursts of one or more time units followed by I/O bursts of one or more time units. For simplicity’s sake, when more than one process is executing its I/O burst at the same...

  • Implement a First Come First Serve (FCFS) non-preemptive OS scheduling simulation with multiple processes, in python...

    Implement a First Come First Serve (FCFS) non-preemptive OS scheduling simulation with multiple processes, in python or c++. The simulation takes the 3 processes(listed below) and they all arrive at time 0. A single process consists of {CPU BURST, I/O BURST, CPU BURST, I/O BURST, etc…} The simulation accounts for all 3 processes, and does not run one process at a time. Process1 {4,24,5,73,3,31,5,27,4,33,6,43,4,64,5,19,2} Process2 {18,31,19,35,11,42,18,43,19,47,18,43,17,51,19,32,10} Process3 {6,18,4,21,7,19,4,16,5,29,7,21,8,22,6,24,5} For example at time 0, Process1 arrives and enters running state, Process2...

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