Gespeichert in:
| Hauptverfasser: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2410.02682 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916422265864192 |
|---|---|
| author | Bourgeois, Daniel Ding, Zhimin Jankov, Dimitrije Li, Jiehui Sleem, Mahmoud Tang, Yuxin Yao, Jiawen Yao, Xinyu Jermaine, Chris |
| author_facet | Bourgeois, Daniel Ding, Zhimin Jankov, Dimitrije Li, Jiehui Sleem, Mahmoud Tang, Yuxin Yao, Jiawen Yao, Xinyu Jermaine, Chris |
| contents | We consider the problem of automatically decomposing operations over tensors or arrays so that they can be executed in parallel on multiple devices. We address two, closely-linked questions. First, what programming abstraction should systems for tensor-based computing offer to enable such decompositions? Second, given that abstraction, how should such systems automatically decompose a tensor-based computation? We assert that tensor-based systems should offer a programming abstraction based on an extended Einstein summation notation, which is a fully declarative, mathematical specification for tensor computations. We show that any computation specified in the Einstein summation notation can be re-written into an equivalent tensor-relational computation, and this re-write generalizes existing notations of tensor parallelism such as "data parallel'' and "model parallel.'' We consider the algorithmic problem of optimally computing a tensor-relational decomposition of a graph of operations specified in our extended Einstein summation notation, and we experimentally show the value of the algorithm that we develop. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_02682 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | EinDecomp: Decomposition of Declaratively-Specified Machine Learning and Numerical Computations for Parallel Execution Bourgeois, Daniel Ding, Zhimin Jankov, Dimitrije Li, Jiehui Sleem, Mahmoud Tang, Yuxin Yao, Jiawen Yao, Xinyu Jermaine, Chris Distributed, Parallel, and Cluster Computing We consider the problem of automatically decomposing operations over tensors or arrays so that they can be executed in parallel on multiple devices. We address two, closely-linked questions. First, what programming abstraction should systems for tensor-based computing offer to enable such decompositions? Second, given that abstraction, how should such systems automatically decompose a tensor-based computation? We assert that tensor-based systems should offer a programming abstraction based on an extended Einstein summation notation, which is a fully declarative, mathematical specification for tensor computations. We show that any computation specified in the Einstein summation notation can be re-written into an equivalent tensor-relational computation, and this re-write generalizes existing notations of tensor parallelism such as "data parallel'' and "model parallel.'' We consider the algorithmic problem of optimally computing a tensor-relational decomposition of a graph of operations specified in our extended Einstein summation notation, and we experimentally show the value of the algorithm that we develop. |
| title | EinDecomp: Decomposition of Declaratively-Specified Machine Learning and Numerical Computations for Parallel Execution |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2410.02682 |