In uni-processor scheduling, if non- preemptive policy is applied then

Related MCQs

• In multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1- The number of threads in a process can be altered during the course of execution. 2- This provides implicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process.
• When preemptive policy is applied to uni- processor scheduling then
• In real time scheduling: A: Static table driven approach, B: Static priority driven preemptive approach, C: Dynamic planning based approach; 1- A static analysis of feasible scheduler of dispatching is done and implemented. 2- A static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasibility is determined at run time.
• If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni- processor scheduling policy selects.
• If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni processor scheduling policy selects
• In round robin (time slicing) policy applied on uni-processor scheduling
• In round robin (time slicing) policy applied on uni processor scheduling
• In disk scheduling when SCAN (Look) policy is applied and when last track reached in one direction
• In shortest service time first policy, applied on disk scheduling, the disk request is selected
• In memory management : A- Fetch Policy B- Cleaning Policy C- Placement Policy: 1- It determines when a modified page should be written out to secondary memory. 2- It determines when a page should be bought into main memory. 3- It determines where in real memory a process piece is to be reside.