A Budget Constrained Scheduling Algorithm for Workflow Applications

• Tipo: Artigo em Revista Científica Internacional
• Data: 2014

Autores

Hamid Arabnejad (Autor) FEUP; Jorge Manuel Gomes Barbosa (Autor) FEUP

Revista

Título: Journal of Grid Computing

Vol. 12 Nº 4

Páginas: 665-679

ISSN: 1570-7873

Editora: Springer Nature

Indexação

ISI Web of Knowledge

ISI Web of Science

Classificação Científica

FOS: Ciências da engenharia e tecnologias > Engenharia electrotécnica, electrónica e informática

CORDIS: Ciências Tecnológicas > Tecnologia > Tecnologia de computadores

Outras Informações

DOI: 10.1007/s10723-014-9294-7

Abstract (EN): Service-oriented computing has enabled a new method of service provisioning based on utility computing models, in which users consume services based on their Quality of Service (QoS) requirements. In such pay-per-use models, users are charged for services based on their usage and on the fulfilment of QoS constraints; execution time and cost are two common QoS requirements. Therefore, to produce effective scheduling maps, service pricing must be considered while optimising execution performance. In this paper, we propose a Heterogeneous Budget Constrained Scheduling (HBCS) algorithm that guarantees an execution cost within the user’s specified budget and that minimises the execution time of the user’s application. The results presented show that our algorithm achieves lower makespans, with a guaranteed cost per application and with a lower time complexity than other budget-constrained state-of-the-art algorithms. The improvements are particularly high for more heterogeneous systems, in which a reduction of 30 % in execution time was achieved while maintaining the same budget level.

Idioma: Inglês

Tipo (Avaliação Docente): Científica