Coded sparse matrix computation schemes that leverage partial stragglers
Anindya Bijoy Das, Aditya Ramamoorthy

TL;DR
This paper introduces coded sparse matrix computation schemes that exploit partial straggler computations, reducing worker time and improving numerical stability in distributed matrix processing, especially for sparse matrices.
Contribution
It presents novel schemes that leverage partial straggler computations with controlled coding, addressing sparsity and stability issues in coded matrix computations.
Findings
Reduced worker computation time compared to previous methods
Improved numerical stability in decoding process
Validated effectiveness through AWS cluster experiments
Abstract
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. Coded computation utilizes concepts from erasure coding to mitigate the effect of stragglers by running 'coded' copies of tasks comprising a job; stragglers are typically treated as erasures. While this is useful, there are issues with applying, e.g., MDS codes in a straightforward manner. Several practical matrix computation scenarios involve sparse matrices. MDS codes typically require dense linear combinations of submatrices of the original matrices which destroy their inherent sparsity. This is problematic as it results in significantly higher worker computation times. Moreover, treating slow nodes as erasures ignores the potentially useful partial computations performed by them. Furthermore, some MDS…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques · Complexity and Algorithms in Graphs
