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.

Related MCQs

• 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.
• Which combination of the following features will suffice to characterize an OS as a multi programmed OS ? (i) More than one program may be loaded into main memory at the same time for execution. (ii) If a program waits for certain events such as I/O, another program is immediately scheduled for execution. (iii) If the execution of a program terminates, another program is immediately scheduled for execution.
• When operating system always run on a particular processor and that particular processor do all scheduling and process management then this is an example of
• 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 multi processor scheduling, independent parallelism indicates
• In multi processor scheduling, independent parallelism indicates
• In memory management :A-Fixed allocation policy, B-Variable allocation policy: 1-It gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-In it a number of allocated frames are decided at initial load time.
• In uni-processor scheduling, if non- preemptive policy is applied then
• When preemptive policy is applied to uni- processor scheduling then
• In round robin (time slicing) policy applied on uni-processor scheduling