Abstract
In this paper we propose a new approach to the study of the communication requirements of distributed computations, which advocates for the removal of the restrictive assumptions under which earlier results were derived. We illustrate our approach by giving tight lower bounds on the communication complexity required to solve several computational problems in a distributed-memory parallel machine, namely standard matrix multiplication, stencil computations, comparison sorting, and the Fast Fourier Transform. Our bounds rely only on a mild assumption on work distribution, and significantly strengthen previous results which require either the computation to be balanced among the processors, or specific initial distributions of the input data, or an upper bound on the size of processors' local memories.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS) |
| Volume | 25 |
| Publisher | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH |
| Publication date | 2014 |
| Pages | 627-638 |
| ISBN (Print) | 978-3-939897-65-1 |
| DOIs | |
| Publication status | Published - 2014 |
| Externally published | Yes |
| Event | International Symposium on Theoretical Aspects of Computer Science - ENS Lyon, Lyon, France Duration: 5 Mar 2014 → 8 Mar 2014 Conference number: 31st http://stacs2014.sciencesconf.org/resource/page/id/5 |
Conference
| Conference | International Symposium on Theoretical Aspects of Computer Science |
|---|---|
| Number | 31st |
| Location | ENS Lyon |
| Country/Territory | France |
| City | Lyon |
| Period | 05/03/2014 → 08/03/2014 |
| Internet address |
| Series | Leibniz International Proceedings in Informatics (LIPIcs) |
|---|---|
| ISSN | 1868-8969 |
Keywords
- Communication
- lower bounds
- distributed memory
- parallel algorithms
- BSP