Johan Montelius. Penny, A Parallel Implementation of AKL. In ILPS'94 Post-Conference Workshop in Design and Implementation of Parallel Logic Programming Systems, Ithaca, NY, USA, November 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....will be: 1. To support cut and commits. 2. To improve the AND scheduler. 3. To implement a more flexible scheduler to allow workers to migrate freely between teams [4] 4. To implement other execution models and goal rule selection, in order to simulate new models such as PBA [7] ParAKL [12], IDIOM [6] and EAM [17] 5. To exploit independent AND parallelism. No. of Prolog Andorra Teams 1 1 2 3 1 1.06 1.00 1.08 1.11 2 1.97 1.88 2.06 2.12 3 2.79 2.64 2.88 3.00 4 3.49 3.31 3.64 3.75 5 4.06 3.89 4.31 4.46 6 4.60 4.44 4.90 5.07 7 5.14 4.73 5.52 5.57 8 5.50 5.19 5.90 6.12 9 ....

Johan Montelius. Penny, A Parallel Implementation of AKL. In ILPS'94 Post-Conference Workshop in Design and Implementation of Parallel Logic Programming Systems, Ithaca, NY, USA, November 1994.

....logic programming systems that exploit only one form of control parallelism, and parallelism or orparallelism, but has not been addressed for systems that exploit both forms of control parallelism. In the most recent implementations, such as Andorra I [19] PBA [8] ACE [6] ParAKL [11] and Penny [10], and models of parallel logic programming systems, such as the Extended Andorra Model [16] and IDIOM [7] both and and or parallelism are exploited in a single framework. The aim of these systems is to achieve the most parallelism from the applications. When allowing both kinds of parallelism to ....

Johan Montelius. Penny, A Parallel Implementation of AKL. In ILPS'94 Post-Conference Workshop in Design and Implementation of Parallel Logic Programming Systems, Ithaca, NY, USA, November 1994.

.... in the systems Aurora [20] and Muse [3] independent and parallelism, as in Prolog [14] and ACE [13] dependent andparallelism, as in Parlog s JAM [9] KLIC [30] and DASWAM [27, 28] data parallelism, as in Reform Prolog [6] and combined and or parallelism, as in Andorra I [26] and Penny [21]. This work was sponsored by CNPq, Brazilian Research Council. y On leave from the Universidade do Porto, Portugal. 1 All these systems have been able to obtain good performance on bus based systems, such as the Sequent Symmetry multiprocessors [19] The complexity of PLP systems and the ....

Johan Montelius. Penny, A Parallel Implementation of AKL. In ILPS'94 Post-Conference Workshop in Design and Implementation of Parallel Logic Programming Systems, Ithaca, NY, USA, November 1994.

....arises when two or more goals in the body of a clause have a common variable and are executed in parallel. Research on parallel LP has been going on for almost 20 years. Significant progress has been made and many implementation techniques devised that have led to efficient parallel systems [27, 24, 1, 18, 20, 17, 16]. Most research so far has focused on techniques aimed at shared memory multiprocessors (SMMs) Relatively fewer efforts [11, 2, 8, 7, 6] have been devoted to implementing LP systems on distributed memory multiprocessors (DMMs) Out of these efforts only a very small number have been implemented ....

....for Maintaining Multiple Environments Stack copying [1] has been one of the most successful approaches for solving the multiple environments representation problem. It has been incorporated in the Muse OP system [1] and used as basis for more complex parallel systems (e.g. ACE [24] and Penny [20]) In this approach, processors working in OP maintain a separate but identical address space, i.e. they allocate their data areas starting at the same logical addresses. Whenever a processor A working in OP becomes idle (let us call A the idle agent) it will start looking for unexplored ....

J. Montelius and K. Ali. A Parallel Implementation of AKL. New Generation Computing, 14(1), 1996.

....Implementing the EAM is an extremely complicated task the only attempt made, the AKL system [25] suffers the drawback of being based on a rather different language and semantics w.r.t. Prolog. Different parallel implementations of AKL have been recently completed with good performance results [29, 28, 33]. 12 suspend suspend suspend suspend Binding of Y in r is determinately promoted. Non determinate promotion is performed. X, Y p(X, Y) q(X, Y) r(Y) X = 2, m(Y) X = 3, n(Y) X = 3, t(Y) X = 3, s(Y) Y=5 n(5) t(5) n(5) s(5) X=3, Y=5 X=3, Y=5 X p(X, 5) q(X, 5) X = 2, m(5) X = 3, ....

J. Montelius and K. Ali. A Parallel Implementation of AKL. New Generation Computing, 14(1):31--52, 1996.

.... exploited in the systems Aurora [18] and Muse [1] independent and parallelism, as in Prolog [12] and ACE [11] dependent and parallelism, as in Parlog s JAM [6] KLIC [27] and DDAS [26] data parallelism, as in Reform Prolog [4] and combined and or parallelism, as in Andorra I [25] Penny [20], and ACE [10] All these systems have been able to obtain good performance on early bus based systems, such as the Sequent Symmetry multiprocessors. As modern architectures are developed and the gap between CPU and memory speeds widens, the issue arises of whether the current parallel logic ....

Johan Montelius. Penny, A Parallel Implementation of AKL. In ILPS'94 PostConference Workshop in Design and Implementation of Parallel Logic Programming Systems, Ithaca, NY, USA, November 1994.

.... as exploited in Aurora [21] and Muse [1] independent and parallelism, as in Prolog [16] and ACE [15] dependent and parallelism, as in Parlog s JAM [9] KLIC [27] and DDAS [26] data parallelism, as in Reform Prolog [4] and combined and or parallelism, as in Andorra I [25] and Penny [23]. All these systems have been able to obtain good performance on bus based systems, such as the Sequent Symmetry multiprocessors. As modern architectures are developed and the gap between CPU and memory speeds widens, the issue arises of whether the current parallel logic programming systems can ....

Johan Montelius. Penny, A Parallel Implementation of AKL. In ILPS'94 Post-Conference Workshop in Design and Implementation of Parallel Logic Programming Systems, Ithaca, NY, USA, November 1994. 19

....programming systems that exploit only one form of control parallelism, and parallelism or or parallelism, but has not been addressed for systems that exploit both forms of control parallelism. In the most recentimplementations, such as Andorra I [148] PBA [63] ACE [58] ParAKL [92] and Penny [91], and models of parallel logic programming systems, such as the Extended Andorra Model [140] and IDIOM [62] both and parallelism and or parallelism are exploited in a single framework. The aim of these systems is to achieve the most parallelism from the applications. When allowing both kinds of ....

....for more parallelism, but the algorithm to combine solutions can be very complex because of the number of variables to be cross checked, and number of solutions for each goal. Most recent parallel logic programming systems that combine and parallelism w ith orparallelism are ParAKL [92] and Penny [91]. Both systems are based on the Extended Andorra Model, w ithout implicit control. The systems assume that the programmer has 3.2 Parallel Logic Programming Models 45 control over the parallelism by using language constructs to guide the exploitation of parallelism. ParAKLhas its main execution ....

[Article contains additional citation context not shown here]

Johan Montelius. Penny, A Parallel Implementation of AKL. In ILPS'94 Post-Conference Workshop in Design and Implementation of Parallel Logic Programming Systems, Ithaca, NY, USA, November 1994. BIBLIOGRAPHY 261

....the EAM is an extremely complicated task the only attempt made, the AKL system [14] suffers the drawback of being based on a rather different language and semantics w.r.t. Prolog. A parallel implementation of AKL, called Penny, has been recently completed with good performance results [17, 16]. 3.1 EDDAP: A Step Towards EAM Dynamic DAP extended with allowing deterministic consumers to become a producer (Extended Dynamic Dependent And Parallelism (EDDAP) is arguably an implementation of a weak form of the EAM. Allowing a consumer goal to bind the dependent variable if it is doing so ....

Montelius, J., and Ali, K. A Parallel Implementation of AKL. New Generation Computing 14, 1 (1996).

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