Makespan-minimization workflow scheduling for complex networks with social groups in edge computing

2020 ◽  
Vol 108 ◽  
pp. 101799 ◽  
Author(s):  
Jin Sun ◽  
Lu Yin ◽  
Minhui Zou ◽  
Yi Zhang ◽  
Tianqi Zhang ◽  
...  
2020 ◽  
Vol 17 (3) ◽  
pp. 56-68
Author(s):  
Yin Li ◽  
Yuyin Ma ◽  
Ziyang Zeng

Edge computing is pushing the frontier of computing applications, data, and services away from centralized nodes to the logical extremes of a network. A major technological challenge for workflow scheduling in the edge computing environment is cost reduction with service-level-agreement (SLA) constraints in terms of performance and quality-of-service requirements because real-world workflow applications are constantly subject to negative impacts (e.g., network congestions, unexpected long message delays, shrinking coverage, range of edge servers due to battery depletion. To address the above concern, we propose a novel approach to location-aware and proximity-constrained multi-workflow scheduling with edge computing resources). The proposed approach is capable of minimizing monetary costs with user-required workflow completion deadlines. It employs an evolutionary algorithm (i.e., the discrete firefly algorithm) for the generation of near-optimal scheduling decisions. For the validation purpose, the authors show that our proposed approach outperforms traditional peers in terms multiple metrics based on a real-world dataset of edge resource locations and multiple well-known scientific workflow templates.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Binbin Huang ◽  
Yuanyuan Xiang ◽  
Dongjin Yu ◽  
Jiaojiao Wang ◽  
Zhongjin Li ◽  
...  

Mobile edge computing as a novel computing paradigm brings remote cloud resource to the edge servers nearby mobile users. Within one-hop communication range of mobile users, a number of edge servers equipped with enormous computation and storage resources are deployed. Mobile users can offload their partial or all computation tasks of a workflow application to the edge servers, thereby significantly reducing the completion time of the workflow application. However, due to the open nature of mobile edge computing environment, these tasks, offloaded to the edge servers, are susceptible to be intentionally overheard or tampered by malicious attackers. In addition, the edge computing environment is dynamical and time-variant, which results in the fact that the existing quasistatic workflow application scheduling scheme cannot be applied to the workflow scheduling problem in dynamical mobile edge computing with malicious attacks. To address these two problems, this paper formulates the workflow scheduling problem with risk probability constraint in the dynamic edge computing environment with malicious attacks to be a Markov Decision Process (MDP). To solve this problem, this paper designs a reinforcement learning-based security-aware workflow scheduling (SAWS) scheme. To demonstrate the effectiveness of our proposed SAWS scheme, this paper compares SAWS with MSAWS, AWM, Greedy, and HEFT baseline algorithms in terms of different performance parameters including risk probability, security service, and risk coefficient. The extensive experiments results show that, compared with the four baseline algorithms in workflows of different scales, the SAWS strategy can achieve better execution efficiency while satisfying the risk probability constraints.


2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Zhenxing Wang ◽  
Wanbo Zheng ◽  
Peng Chen ◽  
Yong Ma ◽  
Yunni Xia ◽  
...  

Recently, mobile edge computing (MEC) is widely believed to be a promising and powerful paradigm for bringing enterprise applications closer to data sources such as IoT devices or local edge servers. It is capable of energizing novel mobile applications, especially the ultra-latency-sensitive ones, by providing powerful local computing capabilities and lower end-to-end delays. Nevertheless, various challenges, especially the reliability-guaranteed scheduling of multitask business processes in terms of, e.g., workflows, upon distributed edge resources and servers, are yet to be carefully addressed. In this paper, we propose a novel edge-environment-based multi-workflow scheduling method, which incorporates a reliability estimation model for edge-workflows and a coevolutionary algorithm for yielding scheduling decisions. The proposed approach aims at maximizing the reliability, in terms of success rates, of services deployed upon edge infrastructures while minimizing service invocation cost for users. We conduct simulative experimental case studies based on multiple well-known scientific workflow templates and a well-known dataset of edge resource locations as well. Simulative results clearly suggest that our proposed approach outperforms traditional ones in terms of workflow success rate and monetary cost.


2010 ◽  
Vol 76 (1) ◽  
pp. 87-97 ◽  
Author(s):  
A. Hernando ◽  
D. Villuendas ◽  
C. Vesperinas ◽  
M. Abad ◽  
A. Plastino

2021 ◽  
Author(s):  
Jan Lansky ◽  
Mokhtar Mohammadi ◽  
Adil Hussein Mohammed ◽  
Sarkhel H.Taher Karim ◽  
Shima Rashidi ◽  
...  

Abstract Mobile Edge Computing (MEC) is an interesting technology aimed at providing various processing and storage resources at the edge of the Internet of things (IoT) networks. However, MECs contain limited resources, and they should be managed effectively to improve resource utilization. Workflow scheduling is a process that tries to map the workflow tasks to the most proper set of computing resources regarding some objectives. For this purpose, this paper presents DBOA, a discrete version of the Butterfly Optimization Algorithm (BOA) that applies the Levy flight to improve its convergence speed and prevent the local optima problem. Then, DBOA is applied for DVFS-based data-intensive workflow scheduling and data placement in MEC environments. This scheme also employs the HEFT algorithm's task prioritization method to find the task execution order in the scientific workflows. For evaluating the performance of the proposed scheduling scheme, extensive simulations are conducted on various well-known scientific workflows with different sizes. The obtained experimental results indicate that this method can outperform other algorithms regarding energy consumption, data access overheads, etc.


2021 ◽  
Vol 18 (2) ◽  
pp. 25-39
Author(s):  
Tao Tang ◽  
Yuyin Ma ◽  
Wenjiang Feng

Edge computing is an evolving decentralized computing infrastructure by which end applications are situated near the computing facilities. While the edge servers leverage the close proximity to the end-users for provisioning services at reduced latency and lower energy costs, their capabilities are constrained by limitations in computational and radio resources, which calls for smart, quality-of-service (QoS) guaranteed, and efficient task scheduling methods and algorithms. For addressing the edge-environment-oriented multi-workflow scheduling problem, the authors consider a probabilistic-QoS-aware approach to multi-workflow scheduling upon edge servers and resources. It leverages a probability-mass function-based QoS aggregation model and a discrete firefly algorithm for generating the multi-workflow scheduling plans. This research conducted an experimental case study based on varying types of workflow process models and a real-world dataset for edge server positions. It can be observed the method clearly outperforms its peers in terms of workflow completion time, cost, and deadline violation rate.


Sign in / Sign up

Export Citation Format

Share Document