A Budget Constrained Scheduling Algorithm for Workflow Applications

• Type: Article in International Scientific Journal
• Date: 2014

Authors

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

Journal

Title: Journal of Grid Computing

Vol. 12 No. 4

Pages: 665-679

ISSN: 1570-7873

Publisher: Springer Nature

Indexing

ISI Web of Knowledge

ISI Web of Science

Scientific classification

FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering

CORDIS: Technological sciences > Technology > Computer technology

Other information

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.

Language: English

Type (Professor's evaluation): Scientific