Document Type
Conference Proceeding
Publication Date
1-4-2022
Abstract
Partitioning large matrices is an important problem in distributed linear algebra computing, used in ML among others. Briefly, our goal is to perform a sequence of matrix algebra operations in a distributed manner on these large matrices. However, not all partitioning schemes work well with different matrix algebra operations and their implementations (algorithms). This is a type of data tiling problem. In this paper we consider a data tiling problem using hypergraphs. We prove some hardness results and give a theoretical characterization of its complexity on random instances. Additionally we develop a greedy algorithm and experimentally show its efficacy.
Publication Source (Journal or Book title)
ACM International Conference Proceeding Series
First Page
62
Last Page
71
Recommended Citation
Banerjee, A., Reeser, M., & Ding, G. (2022). Distributed Matrix Tiling Using A Hypergraph Labeling Formulation. ACM International Conference Proceeding Series, 62-71. https://doi.org/10.1145/3491003.3491017