When preemptive policy is applied to uni- processor scheduling 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.
• In uni-processor scheduling, if non- preemptive policy is applied then
• 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 multi processor scheduling; A: Coarse gained parallelism, B: Medium grained parallelism, C: Fine grained parallelism; 1- Concurrent processes running on a multi programmed uni processor, 2 Parallel processing or multi tasking is done within a single application, 3-Parallel processing is done within a single instruction stream.
• In uni-processor scheduling :A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.
• In uni-processor scheduling, a priorities enforcement is
• In uni-processor management processor through put