A Comparative Study of Two Dynamic Load Balancing Algorithms as a Means to Increase Performance in Shared Memory Parallel Computing

The proliferation of multicore computing devices ranging from notebooks, tablets and smartphones has led
to a need for load balancing to ensure optimum and full utilization of all the cores. Various algorithms exist for implementing load balancing in these multicore platforms albeit with different performance
characteristics. To ensure optimum usage of all the cores, an experimental comparison of the performance
of the various algorithms on real world problem domains is necessary to inform on which algorithm to use
for each domain of computational problems.
This research focused on two dynamic load balancing algorithms namely, centralized dynamic load
balancing algorithm and cyclic load balancing algorithm using matrix multiplication, sorting and searching
as the problem domains, with the measured parameters being processing time and processor idle time.

Article file ID not found.

The authors declare no conflict of interest.

Not applicable

The datasets used in this study are openly available at [repository link] and the source code is available on GitHub at [GitHub link].

This work did not receive any external funding.