| Full text | |
| Author(s): |
Genez, Thiago A. L.
;
Sakellariou, Rizos
;
Bittencourt, Luiz F.
;
Madeira, Edmundo R. M.
;
Braun, Torsten
;
Sill, A
;
Spillner, J
Total Authors: 7
|
| Document type: | Journal article |
| Source: | 2018 IEEE/ACM 11TH INTERNATIONAL CONFERENCE ON UTILITY AND CLOUD COMPUTING (UCC); v. N/A, p. 10-pg., 2018-01-01. |
| Abstract | |
By renting pay-as-you-go cloud resources (e.g., virtual machines) to do science, the data transfers required during the execution of data-intensive scientific workflows may be remarkably costly not only regarding the workflow execution time (makespan) but also regarding money. As such transfers are prone to delays, they may jeopardise the makespan, stretch the period of resource rentals and, as a result, compromise budgets. In this paper, we explore the possibility of trading some communication for computation during the scheduling production, aiming to schedule a workflow by duplicating some computation of its tasks on which other dependent-tasks critically depend upon to lessen communication between them. This paper explores this premise by enhancing the Heterogeneous Earliest Finish Time (HEFT) algorithm and the Lookahead variant of HEFT. The proposed approach is evaluated using simulation and synthetic data from four real-world scientific workflow applications. Our proposal, which is based on task duplication, can effectively reduce the size of data transfers, which, in turn, contributes to shortening the rental duration of the resources, in addition to minimising network traffic within the cloud. (AU) | |
| FAPESP's process: | 15/24494-8 - Communications and processing of big data in cloud and fog computing |
| Grantee: | Nelson Luis Saldanha da Fonseca |
| Support Opportunities: | Research Projects - Thematic Grants |