Abstract
Scheduling a set of independent tasks onto a network of heterogeneous computing systems to minimize the overall execution time is NP-hard. Among the algorithms that have been proposed in the past, the Sufferage algorithm [5] has the best performance in minimizing the makespan of a set of independent tasks. We propose a new low complexity scheduling algorithm, Heterogeneous Largest Task First (HLTF). Its complexity is O(s(Log s + m)) vs. O(s2*m) of Sufferage, where s is the number of tasks and m is the number of available machines. Simulation results reveal that in terms of minimizing the makespan, the performance of HLTF is slightly better than that of the Sufferage algorithm. In terms of running cost, HLTF significantly outperforms the Sufferage algorithm.
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.
