Consider a load-balancing algorithm that ensures that each queue has approximately the same number of threads, independent of priority. How effectively would a priority-based scheduling algorithm handle this situation if one run queue had all high-priority threads and a second queue had all low-priority threads

Question

Maddison Benton

Computers & Technology

31 January, 14:04

Consider a load-balancing algorithm that ensures that each queue has approximately the same number of threads, independent of priority. How effectively would a priority-based scheduling algorithm handle this situation if one run queue had all high-priority threads and a second queue had all low-priority threads

+4

Answers (1)

Know the Answer?

Bronson Glenn · Answer 1

Answer and Explanation:

Consider giving greater priority to both the queue contains the national priority comment section as well as, therefore, first method the thread throughout this queue. If the item from either the major priority queue becomes decoupled, if the balancing between some of the number of comments in some of these two queues becomes disrupted, instead decouple one thread from either the queue comprising the low-value thread as well as position that one in the queue with the highest - priority loop to match the number of connections in such 2 queues. Whenever a new thread arrives with some kind of proper description, a friendly interface could've been introduced to just the queue contains fewer threads to achieve stability.

Therefore, the load-balancing requirements for keeping about the same number of threads would be retained and the meaningful matter of top priority thread would also be retained.