ZuoTi.Pro
Question

Question 4 [Points 4] Consider a system running 2 (two)CPU-bound tasks (C1-C2) and 1(one) I/O-bound tasks(I1). I/O bound...

Question 4 [Points 4] Consider a system running 2 (two)CPU-bound tasks (C1-C2) and 1(one) I/O-bound tasks(I1). I/O bound task issues an I/O operation once every 1millisecond ofCPU. Each I/O operation takes 10milliseconds. Assume that there is only one I/O device (so multiple I/O requests may have to queue). Assume that the context switch takes 1 millisecond. Assume that each CPU-bound requires 20 milliseconds of CPU to complete and each I/O-bound task requires 2millisecondof CPU time. Show through a Ganttt chart how the I/O and CPU are allocated and compute the average turnaround times for the CPU-bound and I/O bound tasks.At the beginning, there are no jobs running in the system. Assume that the ready queue has C1, I1, C2 jobs in that order with C1 at the front of the queue. Assume FCFS scheduling for both CPU and I/O.

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

Homework Answers

Answer #1

ns Pex Rven data ve hove cI C Pu cpu a bter evety イイ sec Fcps (Cantt chat ) Proces w Since c at tont thus emcetu cs 21 피 2.3

0 0
Add a comment
Know the answer?
Add Answer to:
Question 4 [Points 4] Consider a system running 2 (two)CPU-bound tasks (C1-C2) and 1(one) I/O-bound tasks(I1). I/O bound...
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

  • A system is running 2 CPU-bound tasks and 4 I/O-bound tasks. Each I/O bound task issues...

    A system is running 2 CPU-bound tasks and 4 I/O-bound tasks. Each I/O bound task issues an I/O operation once every 1 millisecond of CPU. Each I/O operation takes 4 milliseconds. Assume that there is only one I/O device (so multiple I/O requests may have to queue). Assume that the context switch takes 0.2 milliseconds. Assume that each CPU-bound requires 10 milliseconds of CPU to complete and each I/O-bound task requires 2 milliseconds of CPU time. Show through a Gantt...

  • Please help me create this CLI CPU Scheduling Simulator in java: First Come First Serve (FCFS)...

    Please help me create this CLI CPU Scheduling Simulator in java: First Come First Serve (FCFS) Round Robin (RR) Process information The process information will be read from an input file. The format is: pid arrival_time burst_time All of fields are integer type where: pid is a unique numeric process ID arrival_time is the time when the task arrives in the unit of milliseconds burst_time the is the CPU time requested by a task, in the unit of milliseconds The...

  • Operating System Theory and Design Write a program to simulate the operation of two of CPU...

    Operating System Theory and Design Write a program to simulate the operation of two of CPU scheduling methods. The program does the following: 1. Get the number of processes from the user. 2. Get the burst time of each process from the user 3. Assume that all processes arrive at "O" to the ready queue. 4. The program lets the user select one of the two methods to implement the o e oo implement the CPU scheduling. time. You can...

  • scheduling program in C, please help 1 Objectives This programming project is to simulate a few...

    scheduling program in C, please help 1 Objectives This programming project is to simulate a few CPU scheduling policies discussed in the class. You will write a C program to implement a simulator with different scheduling algorithms. The simulator selects a task to run from ready queue based on the scheduling algorithm. Since the project intends to simulate a CPU scheduler, so it does not require any actual process creation or execution. When a task is scheduled, the simulator will...

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

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

  • The CPU and I/O times for 2 processes are shown below. Assume that P1 gets to...

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

  • 4. A multi-programmed operating system running on a single CPU assigns time slices of CPU time to the virtual machines that run the individual programs. Each virtual machine is given access to th...

    4. A multi-programmed operating system running on a single CPU assigns time slices of CPU time to the virtual machines that run the individual programs. Each virtual machine is given access to the CPU for a certain time (the time slice), during which it will continue to execute its program. The next time slice then goes to another virtual machine, and so on. Assume that each time slice is one millisecond (1/1000 of a second) long and the computer on...

  • 4. A multi-programmed operating system running on a single CPU assigns time slices of CPU time to the virtual machines t...

    4. A multi-programmed operating system running on a single CPU assigns time slices of CPU time to the virtual machines that run the individual programs. Each virtual machine is given access to the CPU for a certain time (the time slice), during which it will continue to execute its program. The next time slice then goes to another virtual machine, and so on. a. Assume that each time slice is one millisecond (1/1000 of a second) long. The computer on...

  • A system consists of 1 CPU, 1 Disk, and 1 Network Interface. A web server running...

    A system consists of 1 CPU, 1 Disk, and 1 Network Interface. A web server running on this system consists of a process that waits for an HTTP request. Once the request is received, the process services it by fetching the requested file from disk (an I/O operation) and then by sending the file content to the client. Assume that serving a request consists of the following phases: i. Process uses the CPU for 2 msec (parse request) // CPU...

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