Communication-efficient parallel graph algorithms. Technical report

Technical Report · Mon Dec 01 00:00:00 EST 1986

OSTI ID:6488052

Leiserson, C E; Maggs, B M

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 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 the tree contraction technique due to Miller and Reif.

• Research Organization: Massachusetts Inst. of Tech., Cambridge (USA). Lab. for Computer Science
• OSTI ID: 6488052
• Report Number(s): AD-A-178286/1/XAB; MIT/LCS/TM-318
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
COMPUTER GRAPHICS
PARALLEL PROCESSING
ALGORITHMS
COMPUTER NETWORKS
CONTRACTION
GRAPHS
MATHEMATICAL LOGIC
PROGRAMMING
990210* - Supercomputers- (1987-1989)