Computer Engineering & Science ›› 2024, Vol. 46 ›› Issue (10): 1711-1719.
• High Performance Computing • Previous Articles Next Articles
LI Bao,ZHU Shu,WANG Xiao-chuan,REN Yi,TAN Yu-song
Received:
Revised:
Accepted:
Online:
Published:
Abstract: To address the issues of unfair resource allocation and low utilization caused by resource preemption among different workloads in Function-as-a-Service (FaaS) edge computing, a time-aware dominant resource fair scheduling algorithm is proposed. Firstly, the limitations of existing dominant resource fair scheduling algorithms when applied to edge function computing services are analyzed. Then, the algorithm incorporates the runtime weight of function instances and utilizes a time-aware queue in conjunction with a dominant resource fair queue to achieve fair allocation of resources required for function execution and maximize cluster resource utilization. Finally, the algorithm is implemented based on the scheduler of a mainstream open-source function computing service platform. Test results using public workload datasets show that the proposed algorithm improves CPU utilization by up to 18.1% and memory utilization by up to 21.8%, while reducing execution time by up to 26.1%. This effectively enhances the fairness of resource allocation and improves resource utilization in edge function computing services.
Key words: edge computing, function-as-a-service (FaaS), time-aware, dominant resource fair scheduling
LI Bao, ZHU Shu, WANG Xiao-chuan, REN Yi, TAN Yu-song. A time-aware dominant resource fair scheduling algorithm for edge function computing[J]. Computer Engineering & Science, 2024, 46(10): 1711-1719.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://joces.nudt.edu.cn/EN/
http://joces.nudt.edu.cn/EN/Y2024/V46/I10/1711