Multiprocessor thread-scheduling strategies

Question

Describe the well-liked multiprocessor thread-scheduling strategies?

Answer 1

Load Sharing: Processes are not assigned to a specific processor. A global queue of threads is sustained. Each and every processor, when idle, chooses a thread from this queue. Note that load balancing signify to a scheme where work is assigned to processors on a more permanent basis.

Gang scheduling: The setup of related threads is scheduled to run on a setup of processors at the equal time, on a one-to-one basis. Closely related threads or processes might be scheduled this manner to reduce synchronization blocking, and reduce process switching. Group scheduling predated this policy.

Dedicated processor assignment: offers implicit scheduling defined by assignment of threads to processors. For the period of program execution, each and every program is allocated a setup of processors equivalent in number to the number of threads in the program. Processors are selected from the available pool.

Dynamic scheduling: There are many thread in a program which can be changed through the course of execution.