Abstract/Details
Some parallel algorithms with small communication costs
Zhou, Jieliang.
York University (Canada) ProQuest Dissertations Publishing, 1998. MQ27394.
Abstract (summary)
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.
Indexing (details)
Subject
Computer science
Classification
0984: Computer science
Identifier / keyword
Applied sciences
Title
Some parallel algorithms with small communication costs
Author
Zhou, Jieliang
Number of pages
46
Degree date
1998
School code
0267
Source
MAI 36/05M, Masters Abstracts International
Place of publication
Ann Arbor
Country of publication
United States
ISBN
978-0-612-27394-8
Advisor
Dymond, Patrick
University/institution
York University (Canada)
University location
Canada -- Ontario, CA
Degree
M.Sc.
Source type
Dissertation or Thesis
Language
English
Document type
Dissertation/Thesis
Dissertation/thesis number
MQ27394
ProQuest document ID
304460877
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Document URL
https://www.proquest.com/docview/304460877