A bi-criteria scheduling process with CoS support on grids and clouds

  • Authors:
  • Henrique Kloh;Bruno Schulze;Raquel Pinto;Antonio Mury

  • Affiliations:
  • Computao Cientifica Distribuda (ComCiDis), Laboratorio Nacional de Computao Cientifica (LNCC), Av. Getlio Vargas, 333–25651–075, Petropolis, Rio de Janeiro, Brazil;Computao Cientifica Distribuda (ComCiDis), Laboratorio Nacional de Computao Cientifica (LNCC), Av. Getlio Vargas, 333–25651–075, Petropolis, Rio de Janeiro, Brazil;Departamento de Engenharia da Computao, Instituto Militar de Engenharia (IME), Rio de Janeiro, Brazil;Computao Cientifica Distribuda (ComCiDis), Laboratorio Nacional de Computao Cientifica (LNCC), Av. Getlio Vargas, 333–25651–075, Petropolis, Rio de Janeiro, Brazil

  • Venue:
  • Concurrency and Computation: Practice & Experience
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a workflow scheduling model, which is based on a hybrid bi-criteria scheduling algorithm based on a class of service approach. The proposed model is based on the analysis of several related works on resource scheduling, trying to incorporate the most relevant aspects considered in these works, thus covering some shortcomings pointed out by them. The proposed model aims to optimize the criteria chosen by the users, based on their specified priority order and a variation limit specified by them. In order to validate this model, a set of tests were performed comparing the performance of the proposed model with the Join the Shortest Queue scheduling algorithm. The analysis of the obtained results showed an improvement in the overall quality and also a performance gain made available to the users – as they meet the priority criteria. Copyright © 2011 John Wiley & Sons, Ltd.