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

Włodzimierz Bielecki (), Krzysztof Kraska () and Tomasz Klimek ()
Additional contact information
Włodzimierz Bielecki: West Pomeranian University of Technology
Krzysztof Kraska: West Pomeranian University of Technology
Tomasz Klimek: West Pomeranian University of Technology

Journal of Combinatorial Optimization, 2015, vol. 30, issue 2, No 4, 253-275

Abstract: 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.

Keywords: Basis dependence vectors; Transitive closure; Floyd–Warshall algorithm; Arbitrarily nested loop; Parallelizing compiler (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9740-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:2:d:10.1007_s10878-014-9740-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9740-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().