.png){kind=icon}
.png){kind=icon}
Return
Workflow scheduling applying adaptable and dynamic fragmentation (WSADF) based on runtime conditions in cloud computing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2018.07.041.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Workflows are a set of tasks and the dependency among them, which are divided into scientific and business categories. To avoid problems of centralized execution of workflows, they are broken into segments that is known as fragmentation. To fragment the workflow, it is highly important to consider the dependency among tasks and runtime conditions. The cooperation between the scheduler and fragmentor must be such that the latter generates appropriate tasks with optimized communication cost, delay time, response time, and throughput. To this end, in the present study, a framework is proposed for scheduling and fragmentation of tasks in scientific workflows that are conducted in fragmentation and scheduling phases. In the fragmentation phase, the fragments are generated with regard to the number of virtual machines available during runtime. In the scheduling phase, the virtual machines are selected with the aim of reducing bandwidth usage. The experiments are performed with three Configurations during both phases of fragmentation and scheduling. Response time, throughput, and cost (BW and RAM) were improved compared to the baseline studies on Sipht, Inspiral, Epigenomics, Montage, and CyberShake workflows as datasets. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Scientific workflow
Scheduling
Dynamic and adaptive fragmentation
Adaptive scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W