Stream Distributed Coded Computing
Alejandro Cohen, Guillaume Thiran, Homa Esfahanizadeh, Muriel, M\'edard

TL;DR
This paper introduces a novel framework for distributed coded computing that optimally schedules and assigns tasks to heterogeneous workers in streaming environments, significantly reducing job delays compared to naive methods.
Contribution
It presents the first end-to-end joint scheduling and coding framework for heterogeneous distributed streaming computations, optimizing load distribution based on worker capabilities.
Findings
Performance is dramatically better than naive uniform load splitting.
Framework achieves near-ideal job execution delay.
Effective in heterogeneous, streaming computational environments.
Abstract
The emerging large-scale and data-hungry algorithms require the computations to be delegated from a central server to several worker nodes. One major challenge in the distributed computations is to tackle delays and failures caused by the stragglers. To address this challenge, introducing efficient amount of redundant computations via distributed coded computation has received significant attention. Recent approaches in this area have mainly focused on introducing minimum computational redundancies to tolerate certain number of stragglers. To the best of our knowledge, the current literature lacks a unified end-to-end design in a heterogeneous setting where the workers can vary in their computation and communication capabilities. The contribution of this paper is to devise a novel framework for joint scheduling-coding, in a setting where the workers and the arrival of stream…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
