4 papers · 1 filter
Multiple-Function Approximated Coded Computing: Constructions and Error Bounds
Rimpi Borah, Wilton Kim, J. Harshan +2
Coded computing mitigates stragglers in distributed computation. While Lagrange coded computing (LCC) enables exact polynomial computation over finite fields, Berrut approximated c…
Robust Berrut-Approximated Coded Computing via Discrete Cosine Transforms
Rimpi Borah, J. Harshan
Coded computing is a reliable and fault-tolerant paradigm for executing large-scale computational tasks over distributed worker nodes. Among existing coded computing frameworks, Be…
Balancing Privacy and Robustness in Coded Computing Under Profiled Workers
Rimpi Borah, J. Harshan, Aaditya Sharma
In distributed computing with untrusted workers, the assignment of evaluation indices plays a critical role in determining both privacy and robustness. In this work, we study how t…
Basis-Spline Assisted Coded Computing: Strategies and Error Bounds
Rimpi Borah, J. Harshan, V. Lalitha
Coded computing has emerged as a key framework for addressing the impact of stragglers in distributed computation. While polynomial functions often admit exact recovery under exist…