2 citations · 2 across the 1 of their papers we have counts for
4 papers
Coded sparse matrix computation schemes that leverage partial stragglers
Anindya Bijoy Das, Aditya Ramamoorthy
Distributed matrix computations over large clusters can suffer from the problem of slow or failed worker nodes (called stragglers) which can dominate the overall job execution time…
Straggler-resistant distributed matrix computation via coding theory
Aditya Ramamoorthy, Anindya Bijoy Das, Li Tang
The current BigData era routinely requires the processing of large scale data on massive distributed computing clusters. Such large scale clusters often suffer from the problem of…
Efficient and Robust Distributed Matrix Computations via Convolutional Coding
Anindya B. Das, Aditya Ramamoorthy, Namrata Vaswani
Distributed matrix computations -- matrix-matrix or matrix-vector multiplications -- are well-recognized to suffer from the problem of stragglers (slow or failed worker nodes). Muc…
: Codes for Coded Computation that Leverage Stragglers
Anindya B. Das, Li Tang, Aditya Ramamoorthy
In distributed computing systems, it is well recognized that worker nodes that are slow (called stragglers) tend to dominate the overall job execution time. Coded computation utili…