IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v4y2000i3d10.1023_a1009859026994.html
   My bibliography  Save this article

Graph Algorithms with Small Communication Costs

Author

Listed:
  • Jieliang Zhou

    (York University)

  • Patrick Dymond

    (York University)

  • Xiaotie Deng

    (City University of Hong Kong)

Abstract

We study minimizing communication cost in parallel algorithm design, by minimizing the number of communication phases in coarse-grained parallel computers. There have been several recent papers dealing with parallel algorithms of small communication cost under different models. Most of these results are for computational geometry problems. For these problems it has been possible to decompose tasks into appropriate subproblems in a communication-efficient way. It appears to be somewhat more difficult to design parallel algorithms with small communication phases for graph theory problems. In this paper we focus on the design of deterministic algorithms with a small number of communication phases for the list ranking problem and the shortest path problem.

Suggested Citation

  • Jieliang Zhou & Patrick Dymond & Xiaotie Deng, 2000. "Graph Algorithms with Small Communication Costs," Journal of Combinatorial Optimization, Springer, vol. 4(3), pages 291-305, September.
    • Handle: RePEc:spr:jcomop:v:4:y:2000:i:3:d:10.1023_a:1009859026994
    DOI: 10.1023/A:1009859026994
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009859026994
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009859026994?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:4:y:2000:i:3:d:10.1023_a:1009859026994. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.