Process Scheduling

Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C), requires a CPU burst of 8 seconds. A new process of type A ar...

Which one of the following CPU scheduling algorithms cannot be preemptive?

Processes $P 1, P 2, P 3, P 4$ arrive in that order at times $0,1,2$, and 8 milliseconds respectively, and have execution times of $10,13,6$, and 9 milliseconds respectively. Shortest Remaining Time First (SRTF) algorith...

A computer has two processors, $M_1$ and $M_2$. Four processes $P_1, P_2, P_3, P_4$ with CPU bursts of $20,16,25$, and 10 milliseconds, respectively, arrive at the same time and these are the only processes in the system...

Consider a single processor system with four processes A, B, C, and D, represented as given below, where for each process the first value is its arrival time, and the second value is its CPU burst time. A (0, 10), B (2,...

Which one or more of the following CPU scheduling algorithms can potentially cause starvation?

Consider four processes P, Q, R and S scheduled on a CPU as per round robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all at time t = 0. There is exactly one context switch f...

Which of the following statement(s) is/are correct in the context of CPU scheduling?

Consider an arbitrary set of $$CPU$$-bound processes with unequal $$CPU$$ burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average...

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. Process Arrival Time Burst Time P...

Consider a uniprocessor system executing three tasks T 1 , T 2 and T 3 , each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 milliseconds, respec...

For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time? Process Arrival Time Processing Time A 0 3 B 1 6 D 4 4 E 6 2

Consider the following set of processes that need to be scheduled on a single $$CPU.$$ All the times are given in milliseconds. Process Name Arrival Time Execution Time A 0 6 B 3 2 C 5 4 D 7 6 E 10 3 Using the $$shortest...

Three processes $$A, B$$ and $$C$$ each execute a loop of $$100$$ iterations. In each iteration of the loop, a process performs a single computation that requires $${t_c}\,\,CPU$$ milliseconds and then initiates a single...

An operating system uses $$shortest$$ $$remaining$$ $$time$$ $$first$$ scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and $$CPU$$ burst time...

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every $$T$$ time uni...

Consider the $$3$$ processes, $$P1,$$ $$P2$$ and $$P3$$ shown in the table. Process Arrival Time Time Units Required P1 0 5 P2 1 7 P3 3 4 The completion order of the $$3$$ processes under the policies $$FCFS$$ and $$RR2$...

Consider the following table of arrival time and burst time for three processes $$P0,P1$$ and $$P2$$. Process Arrival Time Burst Time P0 0 ms 9 ms P1 1 ms 4 ms P2 2 ms 9 ms The pre-emptive shortest job first scheduling a...

Which of the following statements are true? $${\rm I}.$$ Shortest remaining time first scheduling may cause starvation $${\rm II}.$$ Preemptive scheduling may cause starvation $${\rm III}.$$ Round robin is better than $$...

Group-1 contains some $$CPU$$ scheduling algorithms and Group-2 contains some applications. Match entries in Group-1 to entries in Group-2. Group-1 (P) Gang Scheduling (Q) Rate Monotonic Scheduling (R) Fair Share Schedul...

Consider three processes, all arriving at time zero, with total execution time of $$10,20,$$ and $$30$$ units, respectively. Each process spends the first $$20$$% of execution time doing $${\rm I}/O$$, the next $$70$$% o...

Consider three processes (process id $$0,1,2,$$ respectively) with compute time bursts $$2, 4,$$ and $$8$$ time units. All processes arrive at time zero. Consider the longest remaining time first $$(LRTF)$$ scheduling al...

Consider three $$CPU$$-intensive process, which require $$10,20$$ and $$30$$ time units and arrive at times $$0,2$$ and $$6$$ respectively. How many context switches are needed if the operating system implements a shorte...

A uni-processor computer system only has two processes, both of which alternate $$10$$ $$ms$$ $$CPU$$ bursts with $$90$$ $$ms$$ $${\rm I}/O$$ bursts. Both the processes were created at nearly the same time. The $${\rm I}...

Which of the following scheduling algorithms is non-preemptive?

Which of the following scheduling algorithms is non-preemptive?

Consider a set of $$n$$ tasks with known runtimes $${r_1},{r_2},.....\,{r_n}\,\,$$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?.

Consider $$n$$ processes sharing the $$CPU$$ in a round-robin fashion. Assuming that each process switch takes $$s$$ seconds, what must be the quantum size $$q$$ such that the overhead resulting from process switching is...

Four jobs are waiting to be run. Their expected run times are $$6, 3, 5$$ and $$x$$. $${\rm I}$$n what order should they be run to minimize the average response time?

The correct matching for the following pairs is (a) Disk scheduling $$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$(1) Round robin (b) Batch processing $$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$ (2) $$SCAN$$ (c) Time sharing $$...

Four jobs to be executed on a single processor system arrive at time $${0^ + }$$ in the order $$A, B, C, D.$$ their burst $$CPU$$ time requirements are $$4, 1, 8, 1$$ time units respectively. The completion time of A und...

Which scheduling policy is most suitable for a time-shared operating systems?

Assume that the following jobs are to be executed on a single processor system. Job Id CPU Burst Time p 4 q 1 r 8 s 1 t 2 The jobs are assumed to have arrived at time $${0^ + }$$ and in the order $$p,q,r,s,t.$$ Calculate...

The highest-response ratio next scheduling policy favours $$.......$$ jobs, but it also limits the waiting time of $$ .....$$ jobs.

State an undesirable characteristic of each of the following criteria for measuring performance of an operating system: (a) Turn around time. (b) Waiting time.