COMMUNICATION-EFFICIENT PARALLEL GRAPH ALGORITHMS.

Published

Journal Article

Communication bandwidth is a resource ignored by most parallel random-access machine (PRAM) models. It is shown that many graph problems can be solved in parallel, not only with polylogarithmic performance, but with efficient communication at each step of the computation. Measurements were made of the communication requirements of an algorithm in a model called the distributed random-access machine (DRAM), in which communication cost is measured in terms of the congestion of memory accesses across cuts of an underlying network. The algorithms are based on a communication-efficient variant of a tree contraction technique.

Duke Authors

Cited Authors

  • Leiserson, CE; Maggs, BM

Published Date

  • December 1, 1986

Published In

Start / End Page

  • 861 - 868

International Standard Serial Number (ISSN)

  • 0190-3918

Citation Source

  • Scopus