Register

Recent questions tagged process-scheduling

1 votes
0 answers
242
scheduling
sequence _______ is The an optional non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ______ unit (s) of time. {1,2,3},5 {3,2,1},0 {2,1,3},0 {3,2,1},1
sequence _______ is The an optional non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ______ unit (s) of time. {1,2,3},5 {3,2,1},0 ...
User Avatar
0 votes
0 answers
244
operating system
can interruptput a process from running to ready queue??plz give a scenario(except process scheduling) in which running process dispatch to ready queue.
can interruptput a process from running to ready queue??plz give a scenario(except process scheduling) in which running process dispatch to ready queue.
User Avatar
2 votes
3 answers
249
Ace Test Series: Operating System - Process Schedule
Which scheduling policy is most suitable for Real time operating systems? FCFS LCFS Round Robin Priority
Which scheduling policy is most suitable for Real time operating systems?FCFSLCFSRound RobinPriority
User Avatar
0 votes
0 answers
250
Burst Time and IO time
Where is the difference between in a single processor system and a multiprocessor system , in calculating turned around time(with Burst Time and IO time)
Where is the difference between in a single processor system and a multiprocessor system , in calculating turned around time(with Burst Time and IO time)
User Avatar
3 votes
1 answer
254
cpu scheduling
User Avatar
1 votes
1 answer
258
Self doubt
If inefficiency of scheduling algorithm is $\frac{Burst Time wasted}{Total Burst Time} X 100$ Why do we have to multiply with 100?
If inefficiency of scheduling algorithm is $\frac{Burst Time wasted}{Total Burst Time} X 100$Why do we have to multiply with 100?
User Avatar
4 votes
1 answer
259
Scheduling Overheads
Consider three processes that require 10, 20, 30 units and arrive at time 0, 2, 4. The number of scheduling overheads needed using S.R.T.F. scheduling is I think answer is 1 at time t = 10
Consider three processes that require 10, 20, 30 units and arrive at time 0, 2, 4. The number of scheduling overheads needed using S.R.T.F. scheduling is I think answer i...
User Avatar
0 votes
1 answer
261
PROCESS CONCEPT
User Avatar
0 votes
1 answer
262
UGC NET CSE | December 2009 | Part 2 | Question: 36
In the process management Round-robin method is essentially the pre-emptive version of _________ (A) FILO (B) FIFO (C) SSF (D) Longest time first
In the process management Round-robin method is essentially the pre-emptive version of _________(A) FILO(B) FIFO(C) SSF(D) Longest time first
User Avatar
4 votes
1 answer
266
NPTEL
Consider a system having n CPUs, k processes, and k > n. Calculate the upper bound for the number of processes in the READY, RUNNING and BLOCKED states 1 k, k, k. 2 n, n, n 3 k, k, n 4 k, n, k
Consider a system having n CPUs, k processes, and k n. Calculate the upper bound for the number of processes in the READY, RUNNING and BLOCKED states 1 k, k, k. 2 n, n...
User Avatar
6 votes
1 answer
267
Notes
Consider the dependency graph . at what time all processes complete the execution given a 2-CPU processor
Consider the dependency graph . at what time all processes complete the execution given a 2-CPU processor
User Avatar
5 votes
1 answer
269
SPU Scheduling
What is the correct sequence of the functions -Scheduling, dispatching, and context switching.
What is the correct sequence of the functions -Scheduling, dispatching, and context switching.
User Avatar
Page: