Recent questions tagged process-scheduling

0 0 votes
1 1 answer
1.0k
1.0k views
Let’s take an example if I am scheduling processes in CPU using FCFS with IO Burst Time, then there will be context switching that requires hardware support. But my Teach...
1 1 vote
1 1 answer
1.7k
1.7k views
Consider the following table of arrival time and burst time for three processes $\text{P0,P1 P2}$:Processarrival timeBurst time$\text{P0}$$0 \mathrm{~ms}$$7$$\text{P1}$$1...
0 0 votes
1 1 answer
686
686 views
Consider the following statements:S1: LRU page replacement algorithm suffers from the belady's anomalyS2: Shortest remaining time first scheduling may cause starvationsS3...
0 0 votes
1 1 answer
3.3k
3.3k views
Consider three Processes P1 , P2, P3 arriving in the Ready Queue at time 0 in the order P1, P2, P3 Their service time requirements are 10, 20 & 30 units respectively. Eac...
1 1 vote
2 2 answers
1.0k
1.0k views
In Linux Operating System, when ___________is invoked, it is passed a set of flags that determine how much sharing is to take place between the parent and child tasks.for...
0 0 votes
1 1 answer
571
571 views
For the following set of processes scheduled using $\text{FCFS}$ policy, determine the average waiting time. Assume that the processes arrived in the order $\text{P1, P2,...
0 0 votes
0 0 answers
379
379 views
Which of the following statements are true?A. Shortest remaining time first scheduling may cause starvationB. Preemptive scheduling may cause starvationC. Round robin is ...
0 0 votes
1 1 answer
557
557 views
Match $\text{List I}$ with $\text{List II}$$\text{List I}$$\text{List II}$$\text{A}$. IPC$\text{I}$. Resource Allocation$\text{B}$. Demand Paging$\text{II}$. Computationa...
0 0 votes
1 1 answer
366
366 views
The correct sequence in fetch-execute cycle isA. DecodeB. FetchC. ExecuteChose the correct answer from the following$\mathrm{A}-\mathrm{B}-\mathrm{C}$$\mathrm{B}-\mathrm{...
0 0 votes
1 1 answer
659
659 views
Select the correct order of events after power is initialized on a system.A. Bootstrap loader is loaded from the diskB. Kernel is loaded onto the memoryC. Firmware $\text...
1 1 vote
1 1 answer
872
872 views
An $\text{OS}$ follows round-robin scheduling with time quantum of $4 \mathrm{~ms}$. Assuming that the $\mathrm{CPU}$ is free now and there are $20$ processes waiting in ...
2 2 votes
0 0 answers
196
196 views
Consider three processes $\mathrm{P} 1, \mathrm{P} 2$, and $\mathrm{P} 3$ with respective arrival times of $0 \mathrm{~ms}, 10 \mathrm{~ms}$, and $20 \mathrm{~ms}$ and re...
1 1 vote
3 3 answers
1.5k
1.5k views
An arriving thread is run at the beginning of its arrival time, if the scheduling policy allows it. Turnaround time is defined as the time a process takes to complete aft...
1 1 vote
1 answers 1 answer
3.6k
3.6k views
Consider arrival time and execution time for the following process:-P.id A.T B.T1 2 52 7 93 8 34 10 4 Ass...
61 61 votes
4 4 answers
41.4k
41.4k views
Which one or more of the following $\text{CPU}$ scheduling algorithms can potentially cause starvation?First-in First-OutRound RobinPriority SchedulingShortest Job First
2 2 votes
0 0 answers
4.6k
4.6k views
Difference between Convoy effect, starvation and deadlockI have shared my understanding on convoy effect, starvation and deadlock. Please correct me if I am wrong.Let us ...
1 1 vote
0 0 answers
2.0k
2.0k views
In general which of the following CPU scheduling algorithms suffers from starvation?SJFFCFSRound robinPriority