TY - GEN
T1 - Uncoded Download in Lagrange-Coded Elastic Computing with Straggler Tolerance
AU - Zhong, Xi
AU - Lu, Samuel
AU - Kliewer, Jörg
AU - Ji, Mingyue
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - Coded elastic computing, introduced by Yang et al. in 2018, is a technique designed to mitigate the impact of elasticity in cloud computing systems, where machines can be preempted or be added during computing rounds. This approach utilizes maximum distance separable (MDS) coding for both storage and download in matrix-matrix multiplications. The proposed scheme is unable to tolerate stragglers and has high encoding complexity and upload cost. In 2023, we addressed these limitations by employing uncoded storage and Lagrange-coded download. However, it results in a large storage size. To address the challenges of storage size and upload cost, in this paper, we focus on Lagrange-coded elastic computing based on uncoded download. We propose a new class of elastic computing schemes, using Lagrange-coded storage with uncoded download (LCSUD). Our proposed schemes address both elasticity and straggler challenges while achieving lower storage size, reduced encoding complexity, and upload cost compared to existing methods.
AB - Coded elastic computing, introduced by Yang et al. in 2018, is a technique designed to mitigate the impact of elasticity in cloud computing systems, where machines can be preempted or be added during computing rounds. This approach utilizes maximum distance separable (MDS) coding for both storage and download in matrix-matrix multiplications. The proposed scheme is unable to tolerate stragglers and has high encoding complexity and upload cost. In 2023, we addressed these limitations by employing uncoded storage and Lagrange-coded download. However, it results in a large storage size. To address the challenges of storage size and upload cost, in this paper, we focus on Lagrange-coded elastic computing based on uncoded download. We propose a new class of elastic computing schemes, using Lagrange-coded storage with uncoded download (LCSUD). Our proposed schemes address both elasticity and straggler challenges while achieving lower storage size, reduced encoding complexity, and upload cost compared to existing methods.
UR - https://www.scopus.com/pages/publications/105021922826
UR - https://www.scopus.com/pages/publications/105021922826#tab=citedBy
U2 - 10.1109/ISIT63088.2025.11195368
DO - 10.1109/ISIT63088.2025.11195368
M3 - Conference contribution
AN - SCOPUS:105021922826
T3 - IEEE International Symposium on Information Theory - Proceedings
BT - ISIT 2025 - 2025 IEEE International Symposium on Information Theory, Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2025 IEEE International Symposium on Information Theory, ISIT 2025
Y2 - 22 June 2025 through 27 June 2025
ER -