Efficient Workflow Scheduling Algorithm for Cloud Computing System: A Dynamic Priority-Based Approach

Workflow scheduling is one of the burning topics that has drawn enormous attention recently in the research community of cloud computing due to its wide applications in astronomy, physics, bioinformatics, health care and so on. This is a well-known NP-complete problem. It presents an interesting asp...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Arabian journal for science and engineering (2011) Ročník 43; číslo 12; s. 7945 - 7960
Hlavní autori: Gupta, Indrajeet, Kumar, Madhu Sudan, Jana, Prasanta K.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2018
Springer Nature B.V
Predmet:
Algorithms
Astronomy
Bioinformatics
Cloud computing
Computer simulation
Engineering
Humanities and Social Sciences
multidisciplinary
Priority scheduling
Production scheduling
Research Article - Computer Engineering and Computer Science
Science
Statistical tests
Task scheduling
Variance analysis
Virtual environments
Workflow
Cloud computing
Resource utilization
Makespan
Min–max normalization
Workflow scheduling
ISSN:2193-567X, 1319-8025, 2191-4281
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Workflow scheduling is one of the burning topics that has drawn enormous attention recently in the research community of cloud computing due to its wide applications in astronomy, physics, bioinformatics, health care and so on. This is a well-known NP-complete problem. It presents an interesting aspect of achieving minimum processing time of all the tasks and maximum resource utilization in cloud resources. Therefore, many algorithms have been developed for workflow scheduling. However, most of them consider a static priority of the tasks which is non-realistic for heterogeneous cloud computing environment. In this paper, we propose a workflow scheduling algorithm which considers dynamic priority of the tasks. The algorithm undergoes a process of min–max normalization followed by the calculation of the dynamic threshold to dispatch the tasks into one of the virtual machines. The algorithm is extensively simulated using various benchmark, scientific and real-life workflows. All the simulated results are compared with other four existing workflow scheduling algorithms. The simulated results confirm that the proposed algorithm lags behind all the four existing algorithms in terms of makespan and average cloud resource utilization. The simulation results are also validated through analysis of variance statistical test.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2193-567X
1319-8025
2191-4281
DOI:10.1007/s13369-018-3261-8