Delay Sensitive Application Partitioning and Task Scheduling in Mobile Edge Cloud Prototyping

Author(s):  
Abdullah Lakhan ◽  
Dileep Kumar Sajnani ◽  
Muhammad Tahir ◽  
Muhammad Aamir ◽  
Rakhshanda Lodhi
Electronics ◽  
2021 ◽  
Vol 10 (22) ◽  
pp. 2797
Author(s):  
Abdullah Lakhan ◽  
Jin Li ◽  
Tor Morten Groenli ◽  
Ali Hassan Sodhro ◽  
Nawaz Ali Zardari ◽  
...  

Currently, the use of biosensor-enabled mobile healthcare workflow applications in mobile edge-cloud-enabled systems is increasing progressively. These applications are heavyweight and divided between a thin client mobile device and a thick server edge cloud for execution. Application partitioning is a mechanism in which applications are divided based on resource and energy parameters. However, existing application-partitioning schemes widely ignore security aspects for healthcare applications. This study devises a dynamic application-partitioning workload task-scheduling-secure (DAPWTS) algorithm framework that consists of different schemes, such as min-cut algorithm, searching node, energy-enabled scheduling, failure scheduling, and security schemes. The goal is to minimize the energy consumption of nodes and divide the application between local nodes and edge nodes by applying the secure min-cut algorithm. Furthermore, the study devises the secure-min-cut algorithm, which aims to migrate data between nodes in a secure form during application partitioning in the system. After partitioning the applications, the node-search algorithm searches optimally to run applications under their deadlines. The energy and failure schemes maintain the energy consumption of the nodes and the failure of the system. Simulation results show that DAPWTS outperforms existing baseline approaches by 30% in terms of energy consumption, deadline, and failure of applications in the system.


Author(s):  
Yuvaraj Natarajan ◽  
Srihari Kannan ◽  
Gaurav Dhiman

Background: Cloud computing is a multi-tenant model for computation that offers various features for computing and storage based on user demand. With increasing cloud users, the usage increases that highlights the problem of load balancing with limited resource availability based on dynamic cloud environment. In such cases, task scheduling creates fundamental issue in cloud environment. Introduction: Certain problems such as, inefficiencies in load balancing latency, throughput ratio, proper utilization of the cloud resources, better energy consumption and response time have been observed. These drawbacks can be efficiently resolved through the incorporation of efficient load balancing and task scheduling strategies. Method: In this paper, we develop an efficient co-operative method to solve the most recent approaches against load balancing and task scheduling have been proposed using Ant Colony Optimization (ACO). These approaches enables in the clear cut identification of the problems associated with the load balancing and task scheduling strategies in the cloud environment. Results: The simulation is conducted to find the efficacy of the improved ACO system for load balancing in cloud than the other methods. The result shows that the proposed method obtains reduced execution time, reduced cost and delay. Conclusion: A unique strategic approach is developed in this paper, Load Balancing, which works with the ACO in relation to the cloud workload balancing task through the incorporation of the ACO technique. The strategy for determining the applicant nodes is based on which the load balancing approach would essentially depend. By incorporating two different approaches: the maximum minute rules and the forward-backward ant, this reliability task can be established. This method is intended to articulate the initialization of the pheromone and thus upgrade the relevant cloud-based physical properties.


2021 ◽  
Author(s):  
Abdullah Lakhan ◽  
Muhammad Suleman Memon ◽  
Qurat-ul-ain Mastoi ◽  
Mohamed Elhoseny ◽  
Mazin Abed Mohammed ◽  
...  

2021 ◽  
Vol 58 (5) ◽  
pp. 102676
Author(s):  
Samira Kanwal ◽  
Zeshan Iqbal ◽  
Fadi Al-Turjman ◽  
Aun Irtaza ◽  
Muhammad Attique Khan

Sign in / Sign up

Export Citation Format

Share Document