Communication-efficient Parallel Graph Algorithms
Name
MIT-LCS-TM-318.pdf
Size
10.46 MB
Format
Adobe PDF
Checksum (MD5)
a99627b6a105714156b4acc157f32f77
Author(s)
Leiserson, Charles E.
Maggs, Bruce M.
Date Issued
December 1986
Series/Report no.
MIT-LCS-TM-318
Abstract
Communication bandwidth is a resource ignored by most parallel random-access machine (PRAM) models. This paper shows that many graph problems can be solved in parallel, not only with polylogarithmic performance, but with efficient communication at each step of the computation. We measure the communication requirements of an algorithm in a model called the distributed random-access machine (DRAM), in whcih communication cost is measured in terms of the congestion of memory access across cuts of an underlying network. The algorithms are based on a communication-efficient variant of the tree contraction technique due to Miller and Reif.
Persistent DSpace Link
