Abstract
Independent task scheduling algorithms in distributed computing systems deal with three main conflicting factors including load balance, task execution time and scheduling cost. In this paper, the problem of scheduling tasks arriving at a low rate and with long execution time in heterogeneous computing systems is studied, and a new scheduling algorithm based on prediction is proposed. This algorithm evaluates the utility of task scheduling based on statistics and prediction to solve the influence of heterogeneous computing systems. The experimental results reveal that the proposed algorithm adequately balances the conflicting factors, and thus performs better than some classical algorithms such as MCT and MET when the parameters are well selected.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.