task scheduling
Recently Published Documents


TOTAL DOCUMENTS

4084
(FIVE YEARS 1942)

H-INDEX

64
(FIVE YEARS 28)

2022 ◽  
Vol 2022 ◽  
pp. 1-14
Author(s):  
Feng Hong ◽  
Tianming Zhang ◽  
Bin Cao ◽  
Jing Fan

With the development of the smart Internet of Things (IoT), an increasing number of tasks are deployed on the edge of the network. Considering the substantially limited processing capability of IoT devices, task scheduling as an effective solution offers low latency and flexible computation to improve the system performance and increase the quality of services. However, limited computing resources make it challenging to assign the right tasks to the right devices at the edge of the network. To this end, we propose a polynomial-time solution, which consists of three steps, i.e., identifying available devices, estimating device quantity, and searching for feasible schedules. In order to shrink the number of potential schedules, we present a pairwise-allocated strategy (PA). Based on these, a capability average matrix (CAM)-based index is designed to further boost efficiency. In addition, we evaluate the schedules by the technique for order preference by similarity to an ideal solution (TOPSIS). Extensive experimental evaluation using both real and synthetic datasets demonstrates the efficiency and effectiveness of our proposed approach.


2022 ◽  
Vol 2022 ◽  
pp. 1-22
Author(s):  
Xiaoyan Gu ◽  
Feng He ◽  
Rongwei Wang ◽  
Liang Chen

In the unmanned aerial vehicle (UAV) swarm combat system, multiple UAVs’ collaborative operations can solve the bottleneck of the limited capability of a single UAV when they carry out complicated missions in complex combat scenarios. As one of the critical technologies of UAV collaborative operation, the mobility model is the basic infrastructure that plays an important role for UAV networking, routing, and task scheduling, especially in high dynamic and real-time scenarios. Focused on real-time guarantee and complex mission cooperative execution, a multilevel reference node mobility model based on the reference node strategy, namely, the ML-RNGM model, is proposed. In this model, the task decomposition and task correlation of UAV cluster execution are realized by using the multilayer task scheduling model. Based on the gravity model of spatial interaction and the correlation between tasks, the reference node selection algorithm is proposed to select the appropriate reference node in the process of node movement. This model can improve the real-time performance of individual tasks and the overall mission group carried out by UAVs. Meanwhile, this model can enhance the connectivity between UAVs when they are performing the same mission group. Finally, OMNeT++ is used to simulate the ML-RNGM model with three experiments, including the different number of nodes and clusters. Within the three experiments, the ML-RNGM model is compared with the random class mobility model, the reference class mobility model, and the associated class mobility model for the network connectivity rate, the average end-to-end delay, and the overhead caused by algorithms. The experimental results show that the ML-RNGM model achieves an obvious improvement in network connectivity and real-time performance for missions and tasks.


2022 ◽  
Vol 2022 ◽  
pp. 1-14
Author(s):  
Zhenzhong Zhang ◽  
Wei Sun ◽  
Yanliang Yu

With the vigorous development of the Internet of Things, the Internet, cloud computing, and mobile terminals, edge computing has emerged as a new type of Internet of Things technology, which is one of the important components of the Industrial Internet of Things. In the face of large-scale data processing and calculations, traditional cloud computing is facing tremendous pressure, and the demand for new low-latency computing technologies is imminent. As a supplementary expansion of cloud computing technology, mobile edge computing will sink the computing power from the previous cloud to a network edge node. Through the mutual cooperation between computing nodes, the number of nodes that can be calculated is more, the types are more comprehensive, and the computing range is even greater. Broadly, it makes up for the shortcomings of cloud computing technology. Although edge computing technology has many advantages and has certain research and application results, how to allocate a large number of computing tasks and computing resources to computing nodes and how to schedule computing tasks at edge nodes are still challenges for edge computing. In view of the problems encountered by edge computing technology in resource allocation and task scheduling, this paper designs a dynamic task scheduling strategy for edge computing with delay-aware characteristics, which realizes the reasonable utilization of computing resources and is required for edge computing systems. This paper proposes a resource allocation scheme combined with the simulated annealing algorithm, which minimizes the overall performance loss of the system while keeping the system low delay. Finally, it is verified through experiments that the task scheduling and resource allocation methods proposed in this paper can significantly reduce the response delay of the application.


2022 ◽  
Vol 72 (1) ◽  
pp. 49-55
Author(s):  
Biji Nair ◽  
S. Mary Saira Bhanu

Fog computing architecture competent to support the mission-oriented network-centric warfare provides the framework for a tactical cloud in this work. The tactical cloud becomes situation-aware of the war from the information relayed by fog nodes (FNs) on the battlefield. This work aims to sustain the network of FNs by maintaining the operational efficiency of the FNs on the battlefield at the tactical edge. The proposed solution monitors and predicts the likely overloading of an FN using the long short-term memory model through a buddy FN at the fog server (FS). This paper also proposes randomised task scheduling (RTS) algorithm to avert the likely overloading of an FN by pre-empting tasks from the FN and scheduling them to another FN. The experimental results demonstrate that RTS with linear complexity has a schedulability measure 8% - 26% higher than that of other base scheduling algorithms. The results show that the LSTM model has low mean absolute error compared to other time-series forecasting models.


Sign in / Sign up

Export Citation Format

Share Document