scholarly journals An efficient population-based multi-objective task scheduling approach in fog computing systems

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Zahra Movahedi ◽  
Bruno Defude ◽  
Amir mohammad Hosseininia
Keyword(s):  
Energy Consumption ◽  
Task Scheduling ◽  
Heuristic Algorithms ◽  
Rapid Development ◽  
Fog Computing ◽  
Scheduling Problem ◽  
Distributed Resources ◽  
Iot Applications ◽  
Whale Optimization ◽  
Iot Devices

AbstractWith the rapid development of Internet of Things (IoT) technologies, fog computing has emerged as an extension to the cloud computing that relies on fog nodes with distributed resources at the edge of network. Fog nodes offer computing and storage resources opportunities to resource-less IoT devices which are not capable to support IoT applications with computation-intensive requirements. Furthermore, the closeness of fog nodes to IoT devices satisfies the low-latency requirements of IoT applications. However, due to the high IoT task offloading requests and fog resource limitations, providing an optimal task scheduling solution that considers a number of quality metrics is essential. In this paper, we address the task scheduling problem with the aim of optimizing the time and energy consumption as two QoS parameters in the fog context. First, we present a fog-based architecture for handling the task scheduling requests to provide the optimal solutions. Second, we formulate the task scheduling problem as an Integer Linear Programming (ILP) optimization model considering both time and fog energy consumption. Finally, we propose an advanced approach called Opposition-based Chaotic Whale Optimization Algorithm (OppoCWOA) to enhance the performance of the original WOA for solving the modelled task scheduling problem in a timely manner. The efficiency of the proposed OppoCWOA is shown by providing extensive simulations and comparisons with the original WOA and some existing meta-heuristic algorithms such as Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA).

scholarly journals Computation Offloading and Scheduling in Edge-Fog Cloud Computing

2019 ◽  
Vol 1 (1) ◽  
Author(s):  
Dadmehr Rahbari ◽  
Mohsen Nickray
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Energy Consumption ◽  
Task Scheduling ◽  
Fog Computing ◽  
Edge Computing ◽  
Computation Offloading ◽  
Test Environment ◽  
Iot Devices ◽  
And Task

Resource allocation and task scheduling in the Cloud environment faces many challenges, such as time delay, energy consumption, and security. Also, executing computation tasks of mobile applications on mobile devices (MDs) requires a lot of resources, so they can offload to the Cloud. But Cloud is far from MDs and has challenges as high delay and power consumption. Edge computing with processing near the Internet of Things (IoT) devices have been able to reduce the delay to some extent, but the problem is distancing itself from the Cloud. The fog computing (FC), with the placement of sensors and Cloud, increase the speed and reduce the energy consumption. Thus, FC is suitable for IoT applications. In this article, we review the resource allocation and task scheduling methods in Cloud, Edge and Fog environments, such as traditional, heuristic, and meta-heuristics. We also categorize the researches related to task offloading in Mobile Cloud Computing (MCC), Mobile Edge Computing (MEC), and Mobile Fog Computing (MFC). Our categorization criteria include the issue, proposed strategy, objectives, framework, and test environment. 

scholarly journals Independent Task Scheduling in Heterogeneous System

2019 ◽  
Vol 8 (4) ◽  
pp. 10093-10099
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Task Scheduling ◽  
Rapid Development ◽  
Network Connectivity ◽  
Variable Number ◽  
Cloud Infrastructure ◽  
Storage Devices ◽  
Quantum Genetic Algorithm ◽  
Test Scenarios

Recently, the rapid development in processing speeds, fast storage devices and better network connectivity, hasaccelerated the popularization of cloud computing. Cloud computing is an on-demand-servicewhich provides users with high end servers,storage and processing capabilities where the user need not be concerned with its infrastructure.Although, there are abundant resources in the cloud infrastructure, for the efficient working and execution of tasks, task scheduling plays a crucial role. Task scheduling results in better performance (throughput) of the system along with better resource utilization which ultimately results inreduced energy consumption. At any given time, a processor should never be in idle state, as it still consumes some amount of energy. In this paper, the use of Quantum Genetic Algorithm has led to the reduction in energy consumption. The objective is to find a scheduling sequencewhich can be implemented ina cloud computing environment. Along with minimizing energy consumption, the algorithm helps reduce makespan time of a processor as well.The results show a decrease in energy consumption by 10-15% under different test scenarios involving a variable number of tasks, processors, and the number of iterations (generations) for which the algorithm was run. The algorithm converges to the desired result within 10-15 iterations, as can be seen from the results published in this paper.

scholarly journals Task Scheduling Based on a Hybrid Heuristic Algorithm for Smart Production Line with Fog Computing

Sensors ◽  
2019 ◽  
Vol 19 (5) ◽  
pp. 1023 ◽  
Author(s):  
Juan Wang ◽  
Di Li
Keyword(s):  
Energy Consumption ◽  
Fault Detection ◽  
Real Time ◽  
Task Scheduling ◽  
Fog Computing ◽  
Superior Performance ◽  
Smart Manufacturing ◽  
Hybrid Heuristic ◽  
Scheduling Strategy ◽  
Terminal Equipment

Fog computing provides computation, storage and network services for smart manufacturing. However, in a smart factory, the task requests, terminal devices and fog nodes have very strong heterogeneity, such as the different task characteristics of terminal equipment: fault detection tasks have high real-time demands; production scheduling tasks require a large amount of calculation; inventory management tasks require a vast amount of storage space, and so on. In addition, the fog nodes have different processing abilities, such that strong fog nodes with considerable computing resources can help terminal equipment to complete the complex task processing, such as manufacturing inspection, fault detection, state analysis of devices, and so on. In this setting, a new problem has appeared, that is, determining how to perform task scheduling among the different fog nodes to minimize the delay and energy consumption as well as improve the smart manufacturing performance metrics, such as production efficiency, product quality and equipment utilization rate. Therefore, this paper studies the task scheduling strategy in the fog computing scenario. A task scheduling strategy based on a hybrid heuristic (HH) algorithm is proposed that mainly solves the problem of terminal devices with limited computing resources and high energy consumption and makes the scheme feasible for real-time and efficient processing tasks of terminal devices. Finally, the experimental results show that the proposed strategy achieves superior performance compared to other strategies.

Architecture of Fog-Enabled and Cloud-Enhanced Internet of Things Applications

2020 ◽  
Vol 10 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Sanjay P. Ahuja ◽  
Nathan Wheeler
Keyword(s):  
Internet Of Things ◽  
Fog Computing ◽  
Reference Architecture ◽  
Iot Applications ◽  
Iot Devices ◽  
The Many ◽  
Future Work

Fog computing has been rising in popularity over the last few years due in part to the many benefits that Fog confers upon Internet of Things (IoT) applications. Fog Computing extends the Cloud to the IoT devices. In this paper, the author explore IoT, Fog, and Cloud, as well as the benefits that are possible and have been realized by utilizing the 3 technologies in a 3-tier architecture. A reference architecture is provided, applications of the 3-tier architecture from the literature are discussed, and recommendations are made for future work.

Load and Cost Aware Min-Min Workflow Scheduling Algorithm for Heterogeneous Resources in Fog, Cloud and Edge Scenarios

2022 ◽  
Vol 12 (1) ◽  
pp. 0-0
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Fog Computing ◽  
Workflow Scheduling ◽  
Heterogeneous Environment ◽  
Cloud Servers ◽  
Heterogeneous Resources

Fog computing and Edge computing are few of the latest technologies which are offered as solution to challenges faced in Cloud Computing. Instead of offloading of all the tasks to centralized cloud servers, some of the tasks can be scheduled at intermediate Fog servers or Edge devices. Though this solves most of the problems faced in cloud but also encounter other traditional problems due to resource-related constraints like load balancing, scheduling, etc. In order to address task scheduling and load balancing in Cloud-fog-edge collaboration among servers, we have proposed an improved version of min-min algorithm for workflow scheduling which considers cost, makespan, energy and load balancing in heterogeneous environment. This algorithm is implemented and tested in different offloading scenarios- Cloud only, Fog only, Cloud-fog and Cloud-Fog-Edge collaboration. This approach performed better and the result gives minimum makespan, less energy consumption along with load balancing and marginally less cost when compared to min-min and ELBMM algorithms

Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem

2018 ◽  
Vol 35 (06) ◽  
pp. 1850041 ◽  
Author(s):  
Guo-Sheng Liu ◽  
Jin-Jin Li ◽  
Ying-Si Tang
Keyword(s):  
Energy Consumption ◽  
Energy Saving ◽  
Heuristic Algorithms ◽  
Flow Shop ◽  
Power Level ◽  
Optimal Schedule ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop

In this paper, we investigate the well-known permutation flow shop (PFS) scheduling problem with a particular objective, the minimization of total idle energy consumption of the machines. The problem considers the energy waste induced by the machine idling, in which the idle energy consumption is evaluated by the multiplication of the idle time and power level of each machine. Since the problem considered is NP-hard, theoretical results are given for several basic cases. For the two-machine case, we prove that the optimal schedule can be found by employing a relaxed Johnson’s algorithm within O([Formula: see text]) time complexity. For the cases with multiple machines (not less than 3), we propose a novel NEH heuristic algorithm to obtain an approximate energy-saving schedule. The heuristic algorithms are validated by comparison with NEH on a typical PFS problem and a case study for tire manufacturing shows an energy consumption reduction of approximately [Formula: see text] by applying the energy-saving scheduling and the proposed algorithms.

scholarly journals Energy-Efficient Scheduling for a Job Shop Using an Improved Whale Optimization Algorithm

Mathematics ◽  
2018 ◽  
Vol 6 (11) ◽  
pp. 220 ◽  
Author(s):  
Tianhua Jiang ◽  
Chao Zhang ◽  
Huiqi Zhu ◽  
Jiuchun Gu ◽  
Guanlong Deng
Keyword(s):  
Energy Consumption ◽  
Optimization Algorithm ◽  
Energy Efficient ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Whale Optimization ◽  
Energy Efficient Scheduling

Under the current environmental pressure, many manufacturing enterprises are urged or forced to adopt effective energy-saving measures. However, environmental metrics, such as energy consumption and CO2 emission, are seldom considered in the traditional production scheduling problems. Recently, the energy-related scheduling problem has been paid increasingly more attention by researchers. In this paper, an energy-efficient job shop scheduling problem (EJSP) is investigated with the objective of minimizing the sum of the energy consumption cost and the completion-time cost. As the classical JSP is well known as a non-deterministic polynomial-time hard (NP-hard) problem, an improved whale optimization algorithm (IWOA) is presented to solve the energy-efficient scheduling problem. The improvement is performed using dispatching rules (DR), a nonlinear convergence factor (NCF), and a mutation operation (MO). The DR is used to enhance the initial solution quality and overcome the drawbacks of the random population. The NCF is adopted to balance the abilities of exploration and exploitation of the algorithm. The MO is employed to reduce the possibility of falling into local optimum to avoid the premature convergence. To validate the effectiveness of the proposed algorithm, extensive simulations have been performed in the experiment section. The computational data demonstrate the promising advantages of the proposed IWOA for the energy-efficient job shop scheduling problem.

scholarly journals Evolutionary Algorithms to Optimize Task Scheduling Problem for the IoT Based Bag-of-Tasks Application in Cloud–Fog Computing Environment

2019 ◽  
Vol 9 (9) ◽  
pp. 1730 ◽  
Author(s):  
Binh Minh Nguyen ◽  
Huynh Thi Thanh Binh ◽  
Tran The Anh ◽  
Do Bao Son
Keyword(s):  
Task Scheduling ◽  
Completion Time ◽  
Fog Computing ◽  
Operating Cost ◽  
Operating Costs ◽  
Scheduling Problem ◽  
Computing Environment ◽  
Swarm Optimization ◽  
New Approach ◽  
Modified Particle Swarm Optimization

In recent years, constant developments in Internet of Things (IoT) generate large amounts of data, which put pressure on Cloud computing’s infrastructure. The proposed Fog computing architecture is considered the next generation of Cloud Computing for meeting the requirements posed by the device network of IoT. One of the obstacles of Fog Computing is distribution of computing resources to minimize completion time and operating cost. The following study introduces a new approach to optimize task scheduling problem for Bag-of-Tasks applications in Cloud–Fog environment in terms of execution time and operating costs. The proposed algorithm named TCaS was tested on 11 datasets varying in size. The experimental results show an improvement of 15.11% compared to the Bee Life Algorithm (BLA) and 11.04% compared to Modified Particle Swarm Optimization (MPSO), while achieving balance between completing time and operating cost.

scholarly journals Task Placement on Fog Computing Made Efficient for IoT Application Provision

2019 ◽  
Vol 2019 ◽  
pp. 1-17 ◽  
Author(s):  
Minh-Quang Tran ◽  
Duy Tai Nguyen ◽  
Van An Le ◽  
Duc Hai Nguyen ◽  
Tran Vu Pham
Keyword(s):  
Energy Consumption ◽  
Response Time ◽  
Intelligent Transportation System ◽  
Fog Computing ◽  
Simulated Data ◽  
Global Scale ◽  
Operational Cost ◽  
Network Load ◽  
Iot Devices ◽  
Location Response

Fog computing is one of the promising technologies for realizing global-scale Internet of Things (IoT) applications as it allows moving compute and storage resources closer to IoT devices, where data is generated, in order to solve the limitations in cloud-based technologies such as communication delay, network load, energy consumption, and operational cost. However, this technology is still in its infancy stage containing essential research challenges. For instance, what is a suitable fog computing scheme where effective service provision models can be deployed is still an open question. This paper proposes a novel multitier fog computing architecture that supports IoT service provisioning. Concretely, a solid service placement mechanism that optimizes service decentralization on fog landscape leveraging context-aware information such as location, response time, and resource consumption of services has been devised. The proposed approach optimally utilizes virtual resources available on the network edges to improve the performance of IoT services in terms of response time, energy, and cost reduction. The experimental results from both simulated data and use cases from service deployments in real-world applications, namely, the intelligent transportation system (ITS) in Ho Chi Minh City, show the effectiveness of the proposed solution in terms of maximizing fog device utilization while reducing latency, energy consumption, network load, and operational cost. The results confirm the robustness of the proposed scheme revealing its capability to maximize the IoT potential.

Sign in / Sign up

Export Citation Format

Share Document