Questions

Kaustubham

1. Load Sharing: Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue. Note that load balancing refers to a scheme where work is allocated to processors on a more permanent basis.


2. Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.


3. Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.


4. Dynamic scheduling: The number of thread in a program can be altered during the course of execution.

Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. It falls under the category of Preemptive scheduling. In computing, the running task is interrupted for some time without requiring its cooperation and resumed later when the priority task has finished its execution. This is called preemptive scheduling.