Ordered structures for parallel rule-based computations

DOI10.1080/00207160108805128MaRDI QIDQ2776789zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Parallel bottom-up processing of datalog queries
• Data structures for order-sensitive predicates in parallel nondeterministic systems
• Some results on the complexity of exploiting data dependency in parallel logic programs
• Ordering conjunctive queries
• Parallel complexity of logical query programs

Cites work

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

Cited in

(2)

• Data structures for order-sensitive predicates in parallel nondeterministic systems
• Partial order programming (revisited)

This page was built for publication: Ordered structures for parallel rule-based computations

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