In this work, we propose approaches to creation of a ranked jobs framework within a model of cycle scheduling in virtual organizations of utility Grids with the decoupling of users from resource providers. Two methods for job selection and scheduling are proposed and compared: the first one is based on the knapsack problem solution, while the second one introduces a heuristic parameter of a job and a computational resource set “compatibility”. Along with these methods we present experimental results demonstrating the efficiency of proposed approaches and compare them with random job selection.
CITATION STYLE
Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D., & Potekhin, P. (2015). Job ranking and scheduling in utility grids VOs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9251, pp. 285–297). Springer Verlag. https://doi.org/10.1007/978-3-319-21909-7_29
Mendeley helps you to discover research relevant for your work.