Deadline-aware Task Scheduling for Cloud Computing using Firefly Optimization Algorithm
TL;DR: In this paper , a deadline-aware task scheduling algorithm for cloud environments based on the Firefly Optimization Algorithm (FOA) is proposed to achieve a higher level of efficiency in multiple parameters, including execution time, waiting time, resource utilization, the percentage of missed tasks, power consumption, and makespan.
read more
Abstract: —Task scheduling poses a major challenge for cloud computing environments. Task scheduling ensures cost-effective task execution and improved resource utilization. It is classified as a NP-hard problem due to its nondeterministic polynomial time nature. This characteristic motivates researchers to employ meta-heuristic algorithms. The number of cloud users and computing capabilities is leading to increased concerns about energy consumption in cloud data centers. In order to leverage cloud resources in the most energy-efficient manner while delivering real-time services to users, a viable cloud task scheduling solution is necessary. This study proposes a new deadline-aware task scheduling algorithm for cloud environments based on the Firefly Optimization Algorithm (FOA). The suggested scheduling algorithm achieves a higher level of efficiency in multiple parameters, including execution time, waiting time, resource utilization, the percentage of missed tasks, power consumption, and makespan. According to simulation results, the proposed algorithm is more effective and superior to the CSO algorithm under HP2CN and NASA workload archives.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Dynamic Task Scheduling Algorithm Based on Learning Automata for Cloud Computing
Heng Shi,Zhenping Xie +1 more
- 29 Mar 2024
TL;DR: The DTSALA algorithm ensures equitable distribution of tasks across available system resources, thereby optimizing resource utilization and reduces task execution time through efficient allocation of tasks to appropriate resources, ultimately enhancing the overall system performance and user experience within the cloud computing environment.
A Dynamic Algorithm for VM Scheduling for Prioritized Cloudlets
Lipika Datta,Taniya Purkait +1 more
- 26 Apr 2024
TL;DR: A dynamic algorithm for VM scheduling for prioritized cloudlets optimizes system performance and resource utilization by prioritizing tasks and considering VM load.
References
Task scheduling mechanisms in cloud computing: A systematic review
TL;DR: This paper presents an SLR‐based analysis on the task scheduling approaches that classify into (a) single cloud environments that evaluate cost‐aware, energy‐ Aware, multi‐objective, and QoS‐aware approaches in task scheduling; (b) multicloud environment that evaluates cost-aware, multi-objectives, andQoS-aware tasks; and (c) mobile cloud environment that is energy‐aware and QSOS‐aware task scheduling.
61
Load Balancing in Cloud—A Systematic Review
Veenita Kunwar,Neha Agarwal,Ajay Rana,J. P. Pandey +3 more
- 01 Jan 2018
TL;DR: Load balancing allows even distribution of workload across various nodes in the cloud and aims to provide efficient utilization of resources, improving the system performance, minimizing the resource consumption resulting in low energy usage.
59
Efficient resource management techniques in cloud computing environment: a review and discussion
TL;DR: This survey triggered innovative methods to handle the existing problems of resource management in cloud computing and it is hoped that it can be used as a source of interested readers to understand the existing methodologies in this research area for future enhancements.
47
Task Scheduling in Big Data Platforms: A Systematic Literature Review
TL;DR: This SLR analyses the design decisions of different scheduling models proposed in the literature for Hadoop, Spark, Storm, and Mesos over the period between 2005 and 2016 and provides a research taxonomy for succinct classification of these scheduling models.
44