The process scheduler in the processor management unit

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 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 management processor through put
• The portion of the process scheduler in an operating system that dispatches processes is concerned with
• 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 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.
• 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 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 process management of UNIX system, which of the following process states are running states in respect of whether the process is executing in user or kernel mode
• If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni- processor scheduling policy selects.