2021
DOI: 10.1109/tnse.2021.3095040
|View full text |Cite
|
Sign up to set email alerts
|

On Batch-Processing Based Coded Computing for Heterogeneous Distributed Computing Systems

Abstract: In recent years, coded distributed computing (CDC) has attracted significant attention, because it can efficiently facilitate many delay-sensitive computation tasks against unexpected latencies in distributed computing systems. Despite such a salient feature, many design challenges and opportunities remain. In this paper, we focus on practical computing systems with heterogeneous computing resources, and design a novel CDC approach, called batch-processing based coded computing (BPCC), which exploits the fact … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 23 publications
(5 citation statements)
references
References 33 publications
0
5
0
Order By: Relevance
“…We capture in this section the various bounds of Y δ k,i−1 by a single unifying description under different iterative optimization strategies. We conclude from ( 39), ( 45), (46), and ( 49) that Y δ k,i−1 is bounded as follows…”
Section: Distributed Agents Under Stochastic Gradient Descent Methodsmentioning
confidence: 78%
“…We capture in this section the various bounds of Y δ k,i−1 by a single unifying description under different iterative optimization strategies. We conclude from ( 39), ( 45), (46), and ( 49) that Y δ k,i−1 is bounded as follows…”
Section: Distributed Agents Under Stochastic Gradient Descent Methodsmentioning
confidence: 78%
“…Further, the scheme allows the enhancement in the efficiency by the dynamic loading of the object sharing for the task. Batch processing-based coded distributed computing has been incorporated in [81] to issue of latency in the distributed computing network. The optimization problem is based on the minimization of the task completion time to configure the computation load [81].…”
Section: A Related Workmentioning
confidence: 99%
“…Batch processing-based coded distributed computing has been incorporated in [81] to issue of latency in the distributed computing network. The optimization problem is based on the minimization of the task completion time to configure the computation load [81]. A coding theoretic scheme is investigated to handle the straggler-like problem.…”
Section: A Related Workmentioning
confidence: 99%
“…Proof. Based on Lemma 2 and the characteristics of order statistic, L cmp can be obtained by taking the expectation of (8).…”
Section: Proof See Appendix Bmentioning
confidence: 99%
“…It implied that MDS coding scheme could reduce the computation time significantly and achieve an order-wise improvement over the original uncoded scheme. The authors in [7], [8] further studied the corresponding scheme to allocate the optimal computational task for nodes in the heterogeneous networks with disparate computation capabilities.…”
mentioning
confidence: 99%