ZuoTi.Pro
Question

1. Discuss how the following pairs of scheduling criteria conflictin certain settings.(a) CPU utilization and response...

1. Discuss how the following pairs of scheduling criteria conflictin certain settings.

(a) CPU utilization and response time
(b) Average turnaround time and maximum waiting time
(c) I/O device utilization and CPU utilization
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

✔ Recommended Answer
Answer #1
      
• CPU utilization and responsetime: CPU utilization is increased if the overheadsassociated with context switching is minimized. The contextswitching overheads could be lowered by performing context switchesinfrequently. This could however result in increasing the responsetime for processes.
        
                            

• Average turnaround time and maximum waitingtime: Average turnaround time is minimized by executingthe shortest tasks first. Such a scheduling policy could howeverstarve long-running tasks and thereby increase their waitingtime.

         

• I/O device utilization and CPUutilization: CPU utilization is maximized by runninglong-running CPU-bound tasks without performing context switches.I/O device utilization is maximized by scheduling I/O-bound jobs assoon as they become ready to run, thereby incurring the overheadsof context switches.

           

0 0
Add a comment
Know the answer?
Add Answer to:
1. Discuss how the following pairs of scheduling criteria conflictin certain settings.(a) CPU utilization and response...
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

Similar Homework Help Questions

  • IN OS: Chapter 6 CPU Scheduling • Basic Concepts • Scheduling Criteria – five criteria be...

    IN OS: Chapter 6 CPU Scheduling • Basic Concepts • Scheduling Criteria – five criteria be able to discuss and apply with evidence. • Scheduling Algorithms – FCFS, SJF (optimal), RR (be able to set and justify quantum size), SRTF, Priority - be able to apply each to a set of processes to find the sequence and calculate average wait time (we did a workshop on this). Be able to discuss related to Short Term Scheduler, medium term, long term....

  • Implement the following 3 CPU scheduling algorithms Simulate and evaluate each with the set of eight...

    Implement the following 3 CPU scheduling algorithms Simulate and evaluate each with the set of eight processes below. Use any programming language. The program listing should be submitted with the report. FCFS (First Come First Serve) non-preemptive (partial results provided) SJF non-preemptive MLFQ Multilevel Feedback Queue (absolute priority in higher queues)             Queue 1 uses RR scheduling with Tq = 5             Queue 2 uses RR scheduling with Tq = 10             Queue 3 uses FCFS All processes enter first...

  • Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

    Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:Processburst TimePriorityP1103P211P323P414P552For each of the scheduling algorithms, FCFS, Shortest-Job-First (SJF, non-preemptive), Priority (smaller priority number implies higher scheduling priority), and RR (quantum = 1) do the following.Draw a Gantt chart to show how these processes would be scheduled.Give the turnaround time (total time from the first arrival into ready state until CPU-burst is completed) of each process.Give the waiting time (total time spent in the Ready state) of each process.Give...

  • Cpu scheduling

    Consider the following set of processes, with the length of the CPU burst times given in milliseconds:a. Draw four Gantt charts illustrating the execution of the processes using FCFS, Preemptive SJF, a non-preemptive priority, and a RR (quantum=2) scheduling. (30 pts)Note: for the RR consider that the arriving time is 0 for all processesb. What is the average waiting time of each process for of the above scheduling algorithms? (10 pts)P1 8 2 0 P2 5 36P3 1 1 8...

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

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

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

  • a-) Draw the gantt chart and computecpu waiting time using preeptive-priority algorithm for the cpu I/O...

    a-) Draw the gantt chart and computecpu waiting time using preeptive-priority algorithm for the cpu I/O device is using FCFS. Compute cpu utilization as well. b-) Draw the gantt chart and compute cpu waiting time using round-robin algorithm for the cpu where quantum is 3 milli seconds. Compute cpu utilization as well. comp 214 2019/2020 Summer School Assignment 1 Priority Arrival Time 4 cpu 12 cpu 6. 3 3 P2 2 4 2 4 loane P3 4 ㅋ 8 6...

  • Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:...

    Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process            Burst Time      Priority P1                    10                    3 P2                    1                     1 P3                    2                     3 P4                    1                     4 P5                    5                     2 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF (SPN), a...

  • QUESTION 1 Consider the following set of processes, with the length of the CPU burst time...

    QUESTION 1 Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process            Burst Time      Priority P1                    7                      5 P2                    2                      4 P3                    11                    3 P4                    9                      1 P5                    5                      3 The processes are assumed to have arrived in the order P1,P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 2). b. What...

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