Ordered structures for parallel rule-based computations

DOI10.1080/00207160108805128zbMath0990.68043OpenAlexW1981174102MaRDI QIDQ2776789

Camino R. Vela, Ramiro Varela, Jorge Puente, Cesar Alonso

Publication date: 6 March 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160108805128

zbMATH Keywords

data flow lattice

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• The best nondeterministic representations of finite orderings.
• The reduce-or process model for parallel execution of logic programs
• An algorithm to minimize representations of finite order relations
• Compile-time derivation of variable dependency using abstract interpretation
• Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
• Efficient dataflow analysis of logic programs
• Some results on the complexity of exploiting data dependency in parallel logic programs