Detection of and-parallelism in logic programs
Detection of And-Parallelism in Logic Programs

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 techniques2, 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 approach3] respectively, have been implemented in SES- PIM system12]. 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 approach13] does under “producer- consumer” scheme, and needs less dynamic overhead while exploiting more and-parallelism than DeGroot’s approach does. This research was partially supported by the Fok Ying Tung Education Foundation.