Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication
We propose a rateless fountain coding strategy and prove that its latency is asymptotically equal to ideal load balancing, and it performs asymptotically zero redundant computations.
