2026-08-10T16:16:48Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4493 2024-03-06T10:35:08Z ddc:004 open_access

Communication Lower Bounds for Distributed-Memory Computations Scquizzato, Michele Silvestri, Francesco Communication lower bounds distributed memory parallel algorithms BSP 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Michele Scquizzato and Francesco Silvestri 2014 Is Part Of LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2014.627 urn:nbn:de:0030-drops-44937 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.627 eng https://creativecommons.org/licenses/by/3.0/legalcode