Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
The recent surge in Internet of Things (IoT) applications and smart devices has led to a substantial rise in the data generation. One of the major issues involved is to meet strict quality of service (QoS) requirements for computing these applications in terms of execution time, cost and in an energy-efficient manner. To extract useful information, fast processing and analysis of data is needed. Consequently, moving all the data to centralized cloud data centers would lead to high processing times, increased cost and energy consumption and more bandwidth usage; thus, processing of applications with strict latency requirements becomes challenging. The addition of fog layer between cloud and IoT devices has provided promising solutions to such issues. However, efficient employment of computing resources in the hybrid infrastructure of fog and cloud nodes is of great significance and demands an optimal scheduling strategy. Toward this direction, a novel Pareto-based algorithm in fog computing, namely energy-efficient time and cost (ETC) constraint scheduling algorithm, is introduced in this paper for scheduling workflow applications. ETC attempts to optimize monetary cost along with time and energy objectives. Improved multi-objective differential evolution (I-MODE) meta-heuristic is introduced and incorporated with deadline-aware stepwise frequency scaling approach that is based on our previously proposed energy makespan multi-objective optimization (EM-MOO) algorithm. Synthetic and real-world application workflows are used to conduct evaluation of the proposed work with existing well-known algorithms from the literature. The experimental results for synthetic workflows reveal that the proposed algorithm lessens energy utilization by 14–21%, execution time by almost 25% and cost consumption by 22–27%, while for real-world application workflows, energy consumption is reduced by 12–24%, execution time by 14–16% and cost consumption by 23–29%.
The recent surge in Internet of Things (IoT) applications and smart devices has led to a substantial rise in the data generation. One of the major issues involved is to meet strict quality of service (QoS) requirements for computing these applications in terms of execution time, cost and in an energy-efficient manner. To extract useful information, fast processing and analysis of data is needed. Consequently, moving all the data to centralized cloud data centers would lead to high processing times, increased cost and energy consumption and more bandwidth usage; thus, processing of applications with strict latency requirements becomes challenging. The addition of fog layer between cloud and IoT devices has provided promising solutions to such issues. However, efficient employment of computing resources in the hybrid infrastructure of fog and cloud nodes is of great significance and demands an optimal scheduling strategy. Toward this direction, a novel Pareto-based algorithm in fog computing, namely energy-efficient time and cost (ETC) constraint scheduling algorithm, is introduced in this paper for scheduling workflow applications. ETC attempts to optimize monetary cost along with time and energy objectives. Improved multi-objective differential evolution (I-MODE) meta-heuristic is introduced and incorporated with deadline-aware stepwise frequency scaling approach that is based on our previously proposed energy makespan multi-objective optimization (EM-MOO) algorithm. Synthetic and real-world application workflows are used to conduct evaluation of the proposed work with existing well-known algorithms from the literature. The experimental results for synthetic workflows reveal that the proposed algorithm lessens energy utilization by 14–21%, execution time by almost 25% and cost consumption by 22–27%, while for real-world application workflows, energy consumption is reduced by 12–24%, execution time by 14–16% and cost consumption by 23–29%.
Task scheduling is a crucial challenge in cloud computing paradigm as variety of tasks with different runtime processing capacities generated from various heterogeneous devices are coming up to cloud application console which effects system performance in terms of makespan, resource utilization, resource cost. Therefore, traditional scheduling algorithms may not adapt to this paradigm efficiently. Many existing authors developed various task schedulers by using metaheuristic approaches to solve Task scheduling problem(TSP) to get near optimal solutions but still TSP is a highly dynamic challenging scenario as it is a NP hard problem. To tackle this challenge, this paper introduces a multi objective prioritized task scheduler using improved asynchronous advantage actor critic(a3c) algorithm which uses priorities of tasks based on length of tasks, runtime processing capacities and priorities of VMs based on electricity unit cost using multi cloud environment. Scheduling process carried out in two stages. In the first stage, all incoming tasks, VM priorities are calculated at the task manager level and in the second stage, Priorities are fed to (MOPTSA3C) scheduler to generate scheduling decisions to map tasks effectively onto VMs by considering priorities and schedule tasks based on cost, resource utilization, makespan in the available multi cloud environment. Extensive simulations are conducted on Cloudsim toolkit by giving input trace different fabricated data distributions and real time worklogs of HPC2N, NASA datasets to the scheduler. For evaluating the efficacy of proposed MOPTSA3C, it compared against existing techniques i.e. DQN, A2C, MOABCQ. From the results, it is evident that proposed MOPTSA3C outperforms existing algorithms for makespan, resource utilization, resource cost, reliability.
No abstract
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.