Deadline-Constrained Cost Minimisation for Cloud Computing Environments

The interest in performing scientific computations using commercially available cloud computing resources has grown rapidly in the last decade. However, scheduling multiple workflows in cloud computing is challenging due to its non-functional constraints and multi-dimensional resource requirements....

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE access Ročník 11; s. 38514 - 38522
Hlavní autori: Manam, Samuel, Moessner, Klaus, Vural, Serdar
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Cloud computing
Constraints
Costs
deadline constraints
Delays
Dynamic scheduling
optimisation
Optimization
Resource scheduling
Scheduling algorithms
scientific workflow
Task analysis
Task scheduling
ISSN:2169-3536, 2169-3536
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The interest in performing scientific computations using commercially available cloud computing resources has grown rapidly in the last decade. However, scheduling multiple workflows in cloud computing is challenging due to its non-functional constraints and multi-dimensional resource requirements. Scheduling algorithms proposed in literature use search-based approaches which often result in very high computational overhead and long execution time. In this paper, a Deadline-Constrained Cost Minimisation (DCCM) algorithm is proposed for resource scheduling in cloud computing. In the proposed scheme, tasks were grouped based on their scheduling deadline constraints and data dependencies. Compared to other approaches, DCCM focuses on meeting the user-defined deadline by sub-dividing tasks into different levels based on their priorities. Simulation results showed that DCCM achieved higher success rates when compared to the state-of-the-art approaches.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2023.3258682