A lower bound technique for communication on BSP with application to the FFT

Authors:
Gianfranco Bilardi;Michele Scquizzato;Francesco Silvestri
Affiliations:
Department of Information Engineering, University of Padova, Italy;Department of Information Engineering, University of Padova, Italy;Department of Information Engineering, University of Padova, Italy
Venue:
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Year:
2012

Citing 18
Cited 0

A communication-time tradeoff

SIAM Journal on Computing
The input/output complexity of sorting and related problems

Communications of the ACM
Communication complexity of PRAMs

Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
A bridging model for parallel computation

Communications of the ACM
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Work-preserving emulations of fixed-connection networks

Journal of the ACM (JACM)
The bulk-synchronous parallel random access machine

Theoretical Computer Science - Special issue on parallel computing
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model

ESA '95 Selected papers from the third European symposium on Algorithms
A quantitative comparison of parallel computation models

ACM Transactions on Computer Systems (TOCS)
Communication-Efficient Parallel Sorting

SIAM Journal on Computing
Models of Computation: Exploring the Power of Computing

Models of Computation: Exploring the Power of Computing
Submachine Locality in the Bulk Synchronous Setting (Extended Abstract)

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
On the Space and Access Complexity of Computation DAGs

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
I/O complexity: The red-blue pebble game

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Communication lower bounds for distributed-memory matrix multiplication

Journal of Parallel and Distributed Computing
The Universality of the Shuffle-Exchange Network

IEEE Transactions on Computers
Graph expansion and communication costs of fast matrix multiplication: regular submission

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Cache-Oblivious Algorithms

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Communication complexity is defined, within the Bulk Synchronous Parallel (BSP) model of computation, as the sum of the degrees of all the supersteps. A lower bound to the communication complexity is derived for a given class of DAG computations in terms of the switching potential of a DAG, that is, the number of permutations that the DAG can realize when viewed as a switching network. The proposed technique yields a novel and tight lower bound for the FFT graph.