Abstract
In this paper, we present a detection technique of and-parallelism in logic programs. The detection consists of three phases: analysis of entry modes, derivation of exit modes and determination of execution graph expressions. Compared with other techniques[2, 4, 5], our approach, with the compile- time program- level data- dependence analysis of logic programs, can efficiently exploit and- parallelism in logic programs. Two precompilers, based on our technique and DeGroot’s approach[3] respectively, have been implemented in SES- PIM system[12]. Through compiling and running some typical benchmarks in SES- PIM, we conclude that our technique can, in most cases, exploit as much and- parallelism as the dynamic approach[13] does under “producer- consumer” scheme, and needs less dynamic overhead while exploiting more and-parallelism than DeGroot’s approach does.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call