Abstract
In this study, a heterogeneous computing environment is employed as a computational platform. In order to increase the efficiency of the system, a dynamic task-scheduling algorithm is proposed, which balances the load among the nodes of the system. The technique is dynamic, nonpreemptive, adaptive, and it uses a mixed centralised and decentralised policies. Based on the divide and conquer principle, the algorithm models the system as hypergrids and then balances the load among them. Recursively, the hypergrids of dimension k are divided into grids of dimensions k − 1, until the dimension is 1. Then, all the nodes of the system are almost equally loaded. The optimum dimension of the hypergrid is chosen in order to achieve the best performance. The simulation results demonstrate the effectiveness of this technique. In addition, we determined the critical points representing lower bounds for which the algorithm should be effective and therefore should be triggered.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
