Resource Scheduling Strategy and Algorithm Design Based on QoS Constraints in Heterogeneous Edge Environments

Read full text Summarise with VIRAT
Authors: Xiazi Zhao
Cited by: 0
References: 5

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Heterogeneous edge computing suffers from severe load imbalance due to node resource differences, and traditional scheduling algorithms fail to synergistically optimize QoS guarantee and load balancing. To address this issue, this paper constructs a multi-dimensional system model integrating QoS constraints and load balancing rules, and designs a two-layer scheduling algorithm: the Location-Aware Heterogeneous QoS Prediction Algorithm (LAQP-H) and the Improved Artificial Bee Colony Load Balancing Scheduling Algorithm (IABC-LB). Simulation experiments with synthetic datasets verify that the proposed strategy outperforms contrast algorithms in average resource utilization, system load imbalance degree, maximum makespan and QoS prediction accuracy (MAE/RMSE). Limitations include ignoring dynamic task access and node failure, which will be optimized with fault-tolerant and adaptive modules in future research.

Fields of Study & Subjects

IoT and Edge/Fog Computing Distributed and Parallel Computing Systems Cloud Computing and Resource Management

Publication details

Journal / source
Applied and Computational Engineering
Volume
228
Issue
1
Pages
85–91
Publication date
30 March 2026
Language
EN