Generalized cross subspace alignment codes for coded distributed batch matrix multiplication
The goal of coded distributed batch matrix multiplication is to efficiently multiply L instances
of λ x κ matrices, A=(A 1,···, AL), with L instances of κ x μ matrices B=(B 1,···, BL), by …
of λ x κ matrices, A=(A 1,···, AL), with L instances of κ x μ matrices B=(B 1,···, BL), by …
Generalized Cross Subspace Alignment Codes for Coded Distributed Batch Matrix Multiplication
Z Jia, SA Jafar - 2019 - escholarship.org
The goal of coded distributed batch matrix multiplication is to efficiently multiply L instances
of\lambda x\kappa matrices, A=(A_1,..., A_L) $, with L instances of\kappa x\mu matrices …
of\lambda x\kappa matrices, A=(A_1,..., A_L) $, with L instances of\kappa x\mu matrices …