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

Why do you consider CPU scheduling to be crucial? And why do separate algorithms need to be used for scheduling?
(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.
There is a computer system that intends to service multiple users. All tasks from the users have almost the same length (i.e. CPU time), usage of the system resources, and urgency. The tasks may arrive in the system at different time. During the execution, all tasks do not require user interventions. 1. What CPU scheduling algorithm would you choose? 2. Explain your choice.
Computer Science In theory, it is possible to have some CPU cores execute one scheduling algorithm (e.g. round-robin) on one set of processes, and some other CPU cores execute another scheduling algorithm (e.g. FCFS) on another set of processes. High-level code for such a scheduler might look like: What do you see as the advantages and disadvantages of using this scheme instead of a single scheduling algorithm?
Discuss how the following pairs of scheduling criteria conflict in certain settings. CPU utilization 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?
Starvation is a problem encountered in concurrent computing where a process is continuously denied execution. i)Articulate a real world example on how to avoid this problem.
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
Suppose that a multiprogrammed system has a load of N processes with individual execution times of t1, t2, ...,tN. Answer the following questions: a) How would it be possible that the time to complete the N processes could be as small as: maximum (t1, t2, ...,tN)? b) How would it be possible that the total execution time, T > t1+ t2+ ...+tN? In other words, what would cause the total execution time to exceed the sum of individual process execution times?
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