IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v30y2015i2d10.1007_s10878-014-9740-2.html
   My bibliography  Save this article

Using basis dependence distance vectors in the modified Floyd–Warshall algorithm

Author

Listed:
  • Włodzimierz Bielecki

    (West Pomeranian University of Technology)

  • Krzysztof Kraska

    (West Pomeranian University of Technology)

  • Tomasz Klimek

    (West Pomeranian University of Technology)

Abstract

In this paper, we present a modified Floyd–Warshall algorithm, where the most time-consuming part—calculating transitive closure describing self-dependences for each loop statement—is computed applying basis dependence distance vectors derived from all vectors describing self-dependences. We demonstrate that the presented approach reduces the transitive closure calculation time for parameterized graphs representing all dependences in the loop in comparison with that yielded by means of techniques implemented in the Omega and ISL libraries. This increases the applicability scope of techniques based on transitive closure of dependence graphs and being aimed at building optimizing compilers. Experimental results for NASA Parallel Benchmarks are discussed.

Suggested Citation

  • Włodzimierz Bielecki & Krzysztof Kraska & Tomasz Klimek, 2015. "Using basis dependence distance vectors in the modified Floyd–Warshall algorithm," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 253-275, August.
    • Handle: RePEc:spr:jcomop:v:30:y:2015:i:2:d:10.1007_s10878-014-9740-2
    DOI: 10.1007/s10878-014-9740-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9740-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-014-9740-2?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.

    References listed on IDEAS

    as
    1. Xiaotie Deng & Patrick Dymond, 1998. "On Multiprocessor System Scheduling," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 377-392, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:30:y:2015:i:2:d:10.1007_s10878-014-9740-2. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.