Accession Number:

ADA614374

Title:

Contention Bounds for Combinations of Computation Graphs and Network Topologies

Descriptive Note:

Technical rept.

Corporate Author:

CALIFORNIA UNIV BERKELEY DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES

Report Date:

2014-08-08

Pagination or Media Count:

14.0

Abstract:

Network topologies can have significant effect on the costs of algorithms due to inter-processor communication. Parallel algorithms that ignore network topology can suffer from contention along network links. However, for particular combinations of computations and network topologies, costly network contention may inevitably become a bottleneck, even for optimally designed algorithms. We obtain a novel contention lower bound that is a function of the network and the computation graph parameters. To this end, we compare the communication bandwidth needs of subsets of processors and the available network capacity as opposed to per-processor analysis in most previous studies. Applying this analysis we improve communication cost lower bounds for several combinations of fundamental computations on common network topologies.

Subject Categories:

  • Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE