A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
For heterogeneous distributed computing systems, important design issues are scalability and system optimization. Given such systems, it is crucial to develop low computational complexity algorithms to schedule tasks in a manner that exploits the heterogeneity of the resources and applications. In this paper, we report three scalable, and fast scheduling heuristics for highly heterogeneous distributed computing systems. The heuristics are thoroughly compared with three other heuristics from thedoi:10.1007/s11227-013-1038-0 fatcat:oj6fxypk4rbvlbbmn4txi532pe