Register

Recent questions tagged process-scheduling

0 0 votes
1 1 answer
819
819 views
Sample paper
How to solve this when arrival time nd scheduling algorithm to use is not mentioned?1. Consider the processes P 1 , P 2 , P 3 arrived in the sequence P 2 , P 3 , P 1 and ...
User Avatar
0 0 votes
1 1 answer
865
865 views
MadeEasy Test Series: Operating System - Process Schedule
Considering the exponential average behaviour used to predict the next CPU burst. If α = 0.80 and Predicted Value of To= 25 ms and previous (T0 , T1, T2, T3) runs were a...
User Avatar
3 3 votes
1 1 answer
5.9k
5.9k views
CPU idle Time
User Avatar
0 0 votes
2 2 answers
3.4k
3.4k views
CPU Utilization
User Avatar
0 0 votes
1 answers 1 answer
1.4k
1.4k views
#OS Cpu scheduling doubt about SRTF turning into FCFS.
Let's say we have four processes as (P1, P2, P3, P4) and have Arrival time as (0,1,2,3) respectively, but all of them has same CPU Burst time as (10ms) then does SRTF wil...
User Avatar
4 4 votes
2 answers 2 answers
5.7k
5.7k views
Scheduling
A process spends 30% of its execution time waiting for completion of I/O operation. If there are 5 processes in memory at once, then the probability of CPU time utilized ...
User Avatar
1 1 vote
4 4 answers
3.4k
3.4k views
UGC NET CSE | July 2018 | Part 2 | Question: 59
Consider the following three processes with the arrival time and CPU burst time given in miliseconds:ProcessArrival TimeBurst Time$P_1$07$P_2$14$P_3$28The Gantt Chart for...
User Avatar
0 0 votes
2 2 answers
2.2k
2.2k views
UGC NET CSE | July 2018 | Part 2 | Question: 60
In which of the following scheduling criteria, context switching will never take place?ROUND ROBINPreemptive SJFNon-preemptive SJFPreemptive priority
User Avatar
0 0 votes
1 1 answer
1.0k
1.0k views
Scheduling of Process
User Avatar
0 0 votes
2 2 answers
1.7k
1.7k views
Scheduling SJF
User Avatar
1 1 vote
0 0 answers
5.7k
5.7k views
#Galvin #CpuScheduling SJF VS SRTF Average waiting time doubt.
Let's say we have two CPU scheduling algorithm as SJF and SRTF and we have a arbitrary pool/set of processes with different ARRIVAL TIME and CPU BURST, then what CPU sch...
User Avatar
0 0 votes
2 answers 2 answers
2.7k
2.7k views
#OS #Galvin 9th edition RR Cpu scheduling alogrithm.
If there are n processes in the ready queue and the time quantum is q, then each process gets 1/n of the CPU time in chunks of at most q time units.Each process must wait...
User Avatar
–1 –1 vote
1 1 answer
803
803 views
Ace Test Series 2019: Operating System - Process Scheduling
User Avatar
0 0 votes
0 0 answers
278
278 views
self doubt
How google chrome tabs are loaded through schedulingalso which scheduling is used ?
User Avatar
0 0 votes
1 1 answer
1.2k
1.2k views
how to determing lenngh of next cpu burst ??
Three processes have the cpu burst times 5,4,3 ms respectively .what will be the predicted value of the next processs cpu burst in milliseconds for shortest job first she...
User Avatar
1 1 vote
1 answers 1 answer
799
799 views
#cpuscheduling
Consider a Shortest Job First (SJF) CPU scheduler, with the following process workload:ProcessArrival TimeCPU Burst$P1$$t$$5$$P2$$t+6$$7$$P3$$t+10$$5$$P4$$t+2$$3$$P5$$t+8...
User Avatar
0 0 votes
1 answers 1 answer
6.1k
6.1k views
Operating system MCQ
When the process issues an I/O request :a) It is placed in an I/O queueb) It is placed in a waiting queuec) It is placed in the ready queued) It is placed in the Job queu...
User Avatar
0 0 votes
1 1 answer
4.5k
4.5k views
Gate Question
Comparison of Scheduling Algorithms(FCFS, SJF, SJRF, Round Robin, Priority)Comparison points are1. Average TAT2. Average WT3. Average RT4. CPU utilization5. throughput
User Avatar
3 3 votes
0 0 answers
1.2k
1.2k views
process Question
Facts about SJF Algorithm:Maximum ThroughputMinimum Average TATMaximum Response TimeMaximum CPU Utilization
User Avatar
0 0 votes
0 0 answers
2.5k
2.5k views
My doubt on context switch and preemption
What is the difference between context switch and preemption?In case of critical section between context switch and preemption which one is possible ?And if so happens th...
User Avatar
0 0 votes
2 answers 2 answers
1.1k
1.1k views
CPU Scheduling
Consider 3 processes A, B, and C to be scheduled as per SRTF scheduling. The process A is known to be scheduled first and when A has been running for 7 units of time the ...
User Avatar
1 1 vote
2 2 answers
1.1k
1.1k views
Uttrakhand Asst. Professor Exam-45
Which of the following scheduling algorithms gives minimum average waiting time?FCFSSJFRound RobinPriority
User Avatar
1 1 vote
2 2 answers
1.6k
1.6k views
CPU Scheduling
PnoArrival Time1st IOBurst time2nd IOP104142P208284P3012426Using SRTF:-Completion time :- P1 - 18, P2 - 46, P3 - 88Turnaround Time:- According to the definition of Galvi...
User Avatar
2 2 votes
1 answers 1 answer
957
957 views
Doubt Threads Scheduling
How are user level threads scheduled?
User Avatar
1 1 vote
1 1 answer
1.1k
1.1k views
OPERATING SYSTEM
S1 IS FALSE. WHY???
User Avatar
2 2 votes
2 2 answers
752
752 views
Operating system
I never study about response ratio scheduling ?Response scheduling=HRRN?If yes then it is non preemptive
User Avatar
4 4 votes
1 1 answer
2.0k
2.0k views
AceTestSeries: Operating System - Process Schedule
User Avatar
2 2 votes
0 0 answers
3.6k
3.6k views
Question
Suppose in a system, processes arrive at an average rate of 6 per minute.On average each process takes 8 seconds of service time. Estimate the % of time CPU is idle in a ...
User Avatar
2 2 votes
0 0 answers
1.5k
1.5k views
CONTEXT SWITCH
Context switches can occur only in kernel mode. So for process switches first we have to move from user to kernel mode. Then we have to save the PCB of the process from w...
User Avatar
2 2 votes
1 answers 1 answer
3.3k
3.3k views
Context switch
Consider 4 processes sharing the CPU in round robin fashion. If context switch time is 1 sec , what must be the time quantum q such that the number of context switches ar...
User Avatar
Page: