An I/O-bound program is one that, if run alone, would spena more time waiting for I/O than using the processor. A processor-bound program is the opposite. Suppose a short-term scheduling algorithm favors those programs that have used little processor time in the recent past. Explain why this algorithm favors I/O-bound programs and yet does not permanently deny processor time to processor-bound programs.

An I/O-bound program is one that, if run alone, would spena more time waiting for I/O than using the processor. A processor-bound program is the opposite. Suppose a short-term scheduling algorithm favors those programs that have used little processor time in the recent past. Explain why this algorithm favors I/O-bound programs and yet does not permanently deny processor time to processor-bound programs.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

The language is Java. The method to use is listed in the picture.
(b) Consider a scenario where you developed a new priority based CPU scheduling algorithm. How can you prevent this algorithm to be suffered from starvation? How will you evaluate your scheduling algorithm, explain with suitable example?
Study of the assembly line scheduling algorithm Discuss the time complexity of the algorithm in term of best case, worst case and Average case.
Consider a system implementing multilevel queue scheduling. What strategy can a computer user employ to maximize the amount of CPU time allocated to the user's process?
1.)Write a program to implement round robin scheduling algorithm where the quantum time, number of processes, their arrival time and burst time is entered from the user. Find the average waiting time, turnaround time and response time.
Multiple multithreading strategies for uniprocessor and multiprocessor systems utilising diverse operating systems (Linux/Windows/Mac/Android, etc.) are compared. Is a comparison of CPU Scheduling Algorithms required?
What are the optimal criteria for Round Robin Scheduling to achieve the lowest CPU usage rate?
Which of the following CPU Scheduling algorithms might be susceptible to starvation? Assume burst times could be wildly small OR wildly large. For round robin, assume a reasonably small time quantum. Shortest Time First (non-preemptive) Round Robin Priority Scheduling Shortest Time First (preemptive) First Come First Serve
Consider a system implementing multilevel queue scheduling. What strategy can a computer user employ to maximize the amount of CPU time allocated to the user's process?
Four processes arrive at the same time with their priorities, execution times and I/0 times given in the table below. Assuming a Round-Robin Scheduling works with a quantum time of 3, but the scheduler selects the with highest priority from the queue (NOT those arrived earliest), other than currently pre-empted process, at each turn3; process a-)Draw the timeline for CPU- and I/O- bursts for these processes b-)Calculate average turn-around time Exec 1/0 Exec /0 Process Priority 2. P1 10 4 P2 7. 4. 4 P3 1 10 1 4 Pa