arrow
返回

Algorithms for Data Sharing-Aware Task Allocation in Edge Computing Systems

delete2025-01-01
delete0
PRE
AI
N
Niloofar Didar
M
Marco Brocanelli
D
Daniel Grosu *
DOI:10.1109/TPDS.2024.3486184delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Edge computing has been developed as a low-latency data driven computation paradigm close to the end user to maximize profit, and/or minimize energy consumption. Edge computing allows each user's task to analyze locally-acquired sensor data at the edge to reduce the resource congestion and improve the efficiency of data processing. To reduce application latency and data transferred to edge servers it is essential to consider data sharing for some user tasks that operate on the same data items. In this article, we formulate the data sharing-aware allocation problem which has as objectives the maximization of profit and minimization of network traffic by considering data-sharing characteristics of tasks on servers. Because the problem is NP - hard, we design the DSTA algorithm to find a feasible solution in polynomial time. We investigate the approximation guarantees of DSTA by determining the approximation ratios with respect to the total profit and the amount of total data traffic in the edge network. We also design a variant of DSTA, called DSTAR that uses a smart rearrangement of tasks to allocate some of the unallocated tasks for increased total profit. We perform extensive experiments to investigate the performance of DSTA and DSTAR, and compare them with a representative greedy baseline that only maximizes profit. Our experimental analysis shows that, compared to the baseline, DSTA reduces the total data traffic in the edge network by up to 20% across 45 case study instances at a small profit loss. In addition, DSTAR increases the total profit by up to 27% and the number of allocated tasks by 25% compared to DSTA, all while limiting the increase of total data traffic in the network.
Keyword:
Servers
Resource management
Edge computing
Scheduling
Energy consumption
Delays
Computational modeling
Costs
Cameras
Time factors
data sharing
task allocation
profit maximization
network load minimization

期刊

IEEE Transactions on Parallel and Distributed Systems 封面图
IEEE Transactions on Parallel and Distributed Systems
IF:
6
论文数:
5.2K
被引数:
1.1W

机构

U
University System of Ohio
学者数:
15.4W
论文数: 13.0W
被引数: 200
W
wayne state university
学者数:
2.0W
论文数: 1.6W
被引数: 17
引用论文

引用论文

Crystal Growth and Characterization of Rare Earth Doped ${\hbox{K}}_{3}{\hbox{LuF}}_{6}$
err2010-06-01
err0
PREAI
errNaoto Abe; Yuui Yokota; Takayuki Yanagida; Noriaki Kawaguchi; Kentaro Fukuda; Jan Pejchal; Martin Nikl; Akira Yoshikawa
err分享
err收藏
Offloading in Mobile Edge Computing: Task Allocation and Computational Frequency Scaling
err2017-01-01
err754
PREAI
errThinh Quang Dinh; Tang, Jianhua; La, Quang Duy; Quek, Tony Q. S.
err分享
err收藏
Self-starting stable coherent mode-locking in a two-section laser
err2016-02-01
err0
errOAAI
errR.M. Arkhipov; M.V. Arkhipov; I. Babushkin
err分享
err收藏
Highly selective and sensitive colorimetric chemosensor for detection of Co2+ in a near-perfect aqueous solution
err2016-01-01
err0
PREAI
errSeong Youl Lee; Jae Jun Lee; Kwon Hee Bok; So Young Kim; Cheal Kim
err分享
err收藏
学者 查看更多内容