A simple and efficient explicit parallelization of logic programs using low-level threading primitives

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this work, we present an automatic way to parallelize logic programs for finding all the answers to queries using a transformation to low level threading primitives. Although much work has been done in parallelization of logic programming more than a decade ago (e.g., Aurora, Muse, YapOR), the current state of parallelizing logic programs is still very poor. This work presents a way for parallelism of tabled logic programs in XSB Prolog under the well founded semantics. An important contribution of this work relies in merging answer-tables from multiple children threads without incurring copying or full-sharing and synchronization of data-structures. The implementation of the parent-children shared answer-tables surpasses in efficiency all the other data-structures currently implemented for completion of answers in parallelization using multi-threading. The transformation and its lower-level answer merging predicates were implemented as an extension to the XSB system.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A simple and efficient explicit parallelization of logic programs using low-level threading primitives does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A simple and efficient explicit parallelization of logic programs using low-level threading primitives, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple and efficient explicit parallelization of logic programs using low-level threading primitives will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-348613

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.