We consider the problem of private distributed matrix multiplication under
limited resources. Coded computation has been shown to be an effective solution
in distributed matrix multiplication, both providing privacy against the
workers and boosting the computation speed by efficiently mitigating
stragglers. In this work, we propose the use of recently-introduced bivariate
polynomial codes to further speed up private distributed matrix multiplication
by exploiting the partial work done by the stragglers rather than completely
ignoring them. We show that the proposed approach significantly reduces the
average computation time of private distributed matrix multiplication compared
to its competitors in the literature, while improving the upload communication
cost and the workers’ storage efficiency.

Go to Source of this post
Author Of this post: <a href="http://arxiv.org/find/cs/1/au:+Hasircioglu_B/0/1/0/all/0/1">Burak Hasircioglu</a>, <a href="http://arxiv.org/find/cs/1/au:+Gomez_Vilardebo_J/0/1/0/all/0/1">Jesus Gomez-Vilardebo</a>, <a href="http://arxiv.org/find/cs/1/au:+Gunduz_D/0/1/0/all/0/1">Deniz Gunduz</a>

By admin