[Solved] In thread scheduling, load sharing is referred to

Q.	In thread scheduling, load sharing is referred to
A.	Simultaneous scheduling of threads that make up a single process.
B.	Implicit scheduling defined by the assignment of threads to processors.
C.	A global queue of ready thread is maintained and each processor, when idle, selects a thread from queue.
D.	None of these.
Answer» C. A global queue of ready thread is maintained and each processor, when idle, selects a thread from queue.

537

Do you find this helpful?

View all MCQs in

Operating System Advanced

Discussion

No comments yet

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 the pure User Level Threads (ULT) (i) Thread management is done by application, (ii) Thread management is done by kernel, (iii) Kernel is not aware of the existence of thread, (iv) Application program interface (API) to the kernel thread facility.
A Absolute loading B Re-locatable loading C Dynamic Run-Time loading; 1. For loader, load module, either is an absolute main memory address or specific address reference. 2. For loader, load modules have no absolute address. 3. For loader, load modules have all memory reference in relative form.
A. Absolute Loading B. Relocatable Loading C. Dynamic Run-Time Loading; 1- It requires that a load module always be loaded into some location in main memory. 2- A load module can be located anywhere in main memory.
Which structure prohibits the sharing of files and directories
The correct matching for the following pairs is - (A) Disk sucheduling, (1) Round robin, (B) Batch processing, (2) SCAN ,(C) Time sharing, (3) LIFO, (D) Interrupt processing, (4) FIFO,
Thread is
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 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.