Modification of Traditional Bully Algorithm using Priority Queuing Technique Applied in CPU Memory Allocation

Purpose–This study aims to modify the Bully Algorithm, a leader-election algorithm, by introducing Priority Queuing to optimize its steps, and evaluate its efficiency based on message count, election time, and instances of communicating with inactive nodes. Method–Priority Queuing will organize active nodes in descending order based on their active status, with the election message sent only to the highest-ranked node in the queue. The study intends to compare the performances of three variations of the Bully Algorithm (the Traditional Bully Algorithm, the latest enhancement, and the proposed modification) using a simulator that ensures the algorithms share the same data set. Result–The findings show that the proposed modification trumps the latest enhancement only during an increased presence of inactive nodes in the distributed system. In return, the newest enhancement trumps the proposed modification when there is little to no presence of inactive nodes. Conclusion–The proposed modification has successfully reduced the time consumed, communication costs, and the instance