Enrico Pontelli, Gopal Gupta, Dongxing Tang, Manuel Carro, and Manuel V. Hermenegildo. Improving the efficiency of nondeterministic independent AND parallel systems. Computer Languages, 22(2/3):115--142, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Task Scheduling Algorithm for Parallel Logic Programming Systems - Tao, Ju (2000) (Correct)
....when the subgoals in the clause body do not affect each other (there are no variables in common) dependent And Parallelism arises when nonindependent goals are executed in parallel. Some exploitation of parallelism in prolog has concentrated on extracting only one of the two forms of parallelism [10, 14, 9, 16, 13, 6, 1] and some on combination of the two [15, 8, 5, 11, 3] But in whichever parallel logic system the case is the same: the subtask (subgoal) can fork their own subtasks before join and thus there may exist many subtasks at the same time which come from different layers of the search tree and are ....
....the often used examples to examine our algorithm: a fibonacci program, a hanoi tower program and a quicksort program, among which the first two have higher parallelism and the last one lower because of its short execution time. We have compared our results with other three parallel prolog systems [6, 3, 10] in order to know how our algorithm runs. The prolog system in [6] is an independent parallel prolog system upon a shared memory multiprocessor. In this system grain control is adopted but the processor allocation algorithm is FCFS (First Comes, First Served) All of the parallel subgoals are ....
[Article contains additional citation context not shown here]
Enrico Pontelli, Gopal Gupta, Dongxing Tang, Manuel Carro, and Manuel V. Hermenegildo. Improving the efficiency of nondeterministic independent AND parallel systems. Computer Languages, 22(2/3):115--142, 1996.
Data-parallel Implementation of Prolog - Bevemyr (1996) (Correct)
....using program transformation techniques. These have some similarities to the transformations described by Tarnlund [199] in his thesis. Hermenegildo and Carro also discuss how the Prolog implementation can be extended with low level primitives to support dataparallelism. Pontelli and Gupta [87, 156, 157, 158, 159] present a number of similar techniques for minimising the overheads for creating processes in ACE. They then argue that data parallelism can be efficiently exploited. However, there are still some significant differences compared to Reform Prolog. They can only exploit independent ....
....parallel computation. This is similar to AKL [108, 107, 140] where deterministic AND boxes are promoted. Gupta, Pontelli [156, 158] and Tang [157] use a similar technique in ACE for reducing the overheads for independent AND parallelism. Carro, Gupta, Hermenegildo, Pontelli, Santos Costa, Tang [95, 94, 99, 100, 159, 157, 87] and others have proposed different schemes for reducing the overheads for nested independent AND parallelism. These schemes reduce the performance difference between various independent AND parallel systems and Reform Prolog, at the cost of added implementation complexity. Our restriction on ....
E. Pontelli, G. Gupta, D. Tang, M. Carro, M. V. Hermenegildo, Improving the Efficiency of Nondeterministic Independent And-parallel Systems, Journal of Computer Languages, 22(2-3), 1996. --17, 81
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC