PVM computation of the transitive closure: The dependency graph approach

DOI10.1007/3-540-45417-9_35MaRDI QIDQ4787343zbMATH OpenFDO

Authors Aris Pagourtzis, Igor Potapov, Wojciech Rytter

Publication date 6 January 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45417-9_35

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Recommendations

• Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
• scientific article; zbMATH DE number 1948455
• scientific article; zbMATH DE number 813252
• Computing transitive closure on systolic arrays of fixed size
• Using basis dependence distance vectors to calculate the transitive closure of dependence relations by means of the Floyd-Warshall algorithm

Cited in

(8)

• Distributed computation of fixed points on dependency graphs
• Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
• Using basis dependence distance vectors to calculate the transitive closure of dependence relations by means of the Floyd-Warshall algorithm
• scientific article; zbMATH DE number 2089168 (Why is no real title available?)
• The transitive closure and related algorithms of digraph on the reconfigurable architecture
• scientific article; zbMATH DE number 15249 (Why is no real title available?)
• scientific article; zbMATH DE number 1948455 (Why is no real title available?)
• scientific article; zbMATH DE number 219224 (Why is no real title available?)

This page was built for publication: PVM computation of the transitive closure: The dependency graph approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787343)