Content area
Abstract
We study minimizing the communication cost in parallel algorithm signs, by minimizing the number of communication phases in coarse-grained parallel computers. We give an optimal algorithm for 2D convex hull problem and small communication algorithms for list ranking and shortest path problems.
Details
Title
Some parallel algorithms with small communication costs
Author
Zhou, Jieliang
Year
1998
ISBN
978-0-612-27394-8
Source type
Dissertation or Thesis
Language of publication
English
ProQuest document ID
304460877
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
