Distributed matrix multiplication with straggler tolerance using algebraic function fields (2401.13573v1)
Abstract: The problem of straggler mitigation in distributed matrix multiplication (DMM) is considered for a large number of worker nodes and a fixed small finite field. Polynomial codes and matdot codes are generalized by making use of algebraic function fields (i.e., algebraic functions over an algebraic curve) over a finite field. The construction of optimal solutions is translated to a combinatorial problem on the Weierstrass semigroups of the corresponding algebraic curves. Optimal or almost optimal solutions are provided. These have the same computational complexity per worker as classical polynomial and matdot codes, and their recovery thresholds are almost optimal in the asymptotic regime (growing number of workers and a fixed finite field).
- R.G.L. D’Oliveira, S. El Rouayheb and D. Karpuk “GASP codes for secure distributed matrix multiplication” In IEEE Transactions on Information Theory 66.7 IEEE, 2020, pp. 4038–4050
- S. Dutta, V. Cadambe and P. Grover “Coded convolution for parallel and distributed computing within a deadline” In 2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 2403–2407 IEEE
- “On the Optimal Recovery Threshold of Coded Matrix Multiplication” In IEEE Transactions on Information Theory 66.1, 2020, pp. 278–301
- R. Froberg, C. Gottlieb and R. Häggkvist “On numerical semigroups” In Semigroup Forum 35, 1986, pp. 63–83
- “On the asymptotic behaviour of some towers of function fields over finite fields” In Journal of number theory 61.2 Academic Press, 1996, pp. 248–273
- T. Høholdt, J. Lint and R. Pellikaan “Algebraic Geometry Codes” In Handbook of Coding Theory 1 Amsterdam: Elsevier, 1998, pp. 871–961
- R.A. Machado, G.L. Matthews and W. Santos “Hera scheme: Secure distributed matrix multiplication via Hermitian codes” In 2023 IEEE International Symposium on Information Theory (ISIT), 2023, pp. 1729–1734 IEEE
- “General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers”, 2023 arXiv:2205.07052 [cs.IT]
- O. Makkonen, E. Saçıkara and C. Hollanti “Algebraic Geometry Codes for Secure Distributed Matrix Multiplication”, 2023 arXiv:2303.15429 [cs.IT]
- C. Munuera, F. Torres and J. Villanueva “Sparse Numerical Semigroups” In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 23–31
- R. Pellikaan, H. Stichtenoth and F. Torres “Weierstrass Semigroups in an Asymptotically Good Tower of Function Fields” In Finite Fields and Their Applications 4.4, 1998, pp. 381–392
- “Numerical Semigroups”, Developments in Mathematics Springer New York, 2009
- H. Stichtenoth “Algebraic function fields and codes” 254, Graduate Texts in Mathematics Springer-Verlag Berlin Heidelberg, 2009, pp. XIV\bibrangessep360
- Q. Yu, M. Maddah-Ali and S. Avestimehr “Polynomial codes: an optimal design for high-dimensional coded matrix multiplication” In Advances in Neural Information Processing Systems 30, 2017
- Q. Yu, M. Maddah-Ali and S. Avestimehr “Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding” In IEEE Transactions on Information Theory 66.3, 2020, pp. 1920–1933