.png){kind=icon}
Return
A Node-Selection-Based Sub-Task Assignment Method for Coded Edge Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2019.2909034.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, coded computation has emerged as a promising technique to reduce the influence of straggling computing nodes in distributed computing systems. However, most existing works neglect the time cost of communicating messages from the client to the computing nodes. Besides straggling computing nodes, straggling receivers also have significant influence on the total computing time, especially in edge computing systems, in which the client and the edge computing nodes are connected through wireless links. Motivated by this observation, we propose in this letter a new sub-task assignment method based on edge node selection to reduce the total computing time for coded edge computing systems. In the proposed method, a sub-task is assigned to the first computing node which decodes the associated messages of the sub-task successfully. Comprehensive numerical results are presented, which show that, with the proposed assignment method, the overall computing time can be reduced. We also show that further reduction can be achieved if additional edge nodes are available.
Keywords:
Coded computation
edge computation
edge node selection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
Mineralogy of Terra Meridiani and western Arabia Terra from OMEGA/MEx and implications for their formation.png)
Icarus
IcarusIF0
PREAI
ShareSave
ShareSaveShareSaveShareSave no more
no more