Energy-aware online task dispatching and scheduling for edge systems with energy harvesting

被引:0
作者
Yuan, Mu [1 ]
Freris, Nikolaos M. [1 ]
机构
[1] Univ Sci & Technol China, Sch Comp Sci, Hefei 230000, Peoples R China
来源
2022 13TH INTERNATIONAL CONFERENCE ON NETWORK OF THE FUTURE, NOF | 2022年
关键词
Energy-aware scheduling; energy harvesting; task allocation; replacement; ALGORITHMS;
D O I
10.1109/NOF55974.2022.9942573
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we consider the problem of online task dispatching and scheduling in a system of devices that may possess energy harvesting capabilities. The objective is twofold, namely to maximize the cumulative weight of tasks that can be completed before their deadlines and to minimize the total energy consumption. Our proposed solution, termed ELISE, operates in an online fashion in that for each newly arriving task it decides between three alternatives (execute before another previously scheduled task, replace an existing task, or place in the waiting line) so as to meet the objectives. We analyze the complexity of ELISE and further provide performance guarantees in terms of bounds on the gap to optimality with regards to the two objectives. Extensive simulations attest to superior aggregate weight, energy consumption, guarantee ratio, and energy consumption per task, over baseline algorithms.
引用
收藏
页码:28 / 36
页数:9
相关论文
共 20 条
[1]   Energy-Aware Scheduling of Distributed Systems [J].
Agrawal, Pragati ;
Rao, Shrisha .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2014, 11 (04) :1163-1175
[2]  
Chi Zhang, 2020, Mobihoc '20: Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, P101, DOI 10.1145/3397166.3409122
[3]  
GARG N, 2006, INT C AUT ICAT, V4051, P181
[4]  
Guo S., 2016, P 35 C COMPUTER COMM, P1
[5]  
Im S., 2016, P ACM S PAR ALG ARCH, P165
[6]  
Li H, 2016, PROCEEDINGS OF 2016 12TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), P415, DOI [10.1109/CIS.2016.100, 10.1109/CIS.2016.0101]
[7]   SCHEDULING ALGORITHMS FOR MULTIPROGRAMMING IN A HARD-REAL-TIME ENVIRONMENT [J].
LIU, CL ;
LAYLAND, JW .
JOURNAL OF THE ACM, 1973, 20 (01) :46-61
[8]  
Meng JY, 2019, IEEE INFOCOM SER, P2287, DOI [10.1109/INFOCOM.2019.8737577, 10.1109/infocom.2019.8737577]
[9]   Randomized Algorithms for Scheduling Multi-Resource Jobs in the Cloud [J].
Psychas, Konstantinos ;
Ghaderi, Javad .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (05) :2202-2215
[10]   PASTA: a power-aware solution to scheduling of precedence-constrained tasks on heterogeneous computing resources [J].
Sharifi, Mohsen ;
Shahrivari, Saeed ;
Salimi, Hadi .
COMPUTING, 2013, 95 (01) :67-88