P. Biswas, S. Su, and D. Yun. A Scalable Abstract Machine Model to Support Limited-OR/Restricted AND Parallelism in Logic Programs. In Fifth International Conference and Symposium on Logic Programming, pages 1160--1179, Seattle,Washington, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of the same variable corresponding to different branches of a Prolog search space. Several OR parallel models have been proposed [4, 14, 23, 28, 47, 54, 79, 92] incorporating different binding schemes. Binding schemes for combining OR parallelism with AND parallelism have also been developed [19, 30, 56, 94]. Recent approaches attempt to exploit stream AND parallelism while retaining the full search capability of Prolog [42, 43, 71, 80, 76] Other important issues in the efficient implementation of OR parallel Prolog are scheduling work so as to minimize speculative computations, and supporting the ....

....exploitation of parallelism in Prolog programs are under current investigation. Many of these deal with the implementation of Prolog on multiprocessor machines by exploiting either OR parallelism [6, 14, 23, 28, 54, 60, 65, 95] or independent AND parallelism [32, 50, 61] or a combination of both [19, 30, 56, 94]. The Muse approach exploits only OR parallelism (see Chapter 3) In the execution of Prolog a tree of alternatives is examined. OR parallel execution of a Prolog program means exploring the branches of this search tree in parallel. In the Muse approach (as in other OR parallel Prolog approaches, ....

[Article contains additional citation context not shown here]

Prasenjit Biswas, Shyh-Chang Su, and David Y. Y. Yun. A Scalable Abstract Machine Model to Support Limited-OR (LOR)/Restricted-AND parallelism (RAP) in Logic Programs. In the Proceedings of the Fifth International Conference ` and Symposium on Logic Programming, pages 1160--1179. MIT Press, August 1988.

.... models that combine independent and parallelism and dependent and parallelism such as DDAS [123] described earlier, as well as models that combine or parallelism and dependent and parallelism such as Andorra I [120] Other combined independent and and or parallel models have also been proposed [21]. We next describe a model, called IDIOM [63] that combines or parallelism, independent and parallelism and (determinate) dependent and parallelism. IDIOM 10 The parcall frame [79] records the control information for the CGE and its independent and parallel goals. 36 P2 P1 0 1 2 3 0 ....

P. Biswas, S-C Su, D.Y.Y. Yun. A Scalable Abstract Machine Model to Support Limited-OR (LOR)/Restricted-AND Parallelism (RAP) in Logic Programs. In Fifth International Logic Programming Conference, Seattle, WA., August 1988, pages 1160--1179.

....execution, i.e. the WAM (Warren Abstract Machine) 38] In this connection, it may be noted that we can readily adapt the WAM for shared memory machines. Thus, our approach contrasts with approaches such as the Reduce Or Process Model (ROPM) 22] Limited OR Restricted And Parallel Model (LORAP) [2] and others which are primarily designed for non shared memory multiprocessors. While there are many opportunities for or parallelism and and parallelism in logic programs, realizing them in an actual implementation poses significant challenges. Therefore, before describing our proposed approach, ....

P. Biswas, S-C Su, D.Y.Y. Yun, "A Scalable Abstract Machine Model to Support Limited-OR (LOR)/Restricted-AND Parallelism (RAP) in Logic Programs," in Fifth International Logic Programming Conference, Seattle, WA., pp. 1160-1179.

....processes are created to execute the cross product solutions. Not much is reported about combination of and parallelism w ith or parallelism. PEPSys deals w ith cuts by introducing a new built in predicate one s o l ut i on 2. This assures that only one solution w ill be exhibited. LORAP [10] is another model that combines limited or parallelism w ith restricted andparallelism, and wasdesigned for distributed memorymachines. Restricted and parallelism is obtained when we impose restrictions to execute goals in parallel. For example, CGEs restrict the parallel execution of some goals. ....

.... 8 , 8 , 4 , 4 , 2 ] 0 , 0 , 0 , 0 , 0 , 1 , 2 , 5 , 6 , 4 , 4 , 6 , 7 , 7 , 8 , 8 , 5 , 6 , 6 , 6 , 6 , 5 , 5 , 3 , 3 , 1 , 1 , 1 , 0 , 0 ] 0 , 1 , 2 , 3 , 3 , 3 , 2 , 4 , 5 , 5 , 7 , 9 , 9 , 6 , 6 , 5 , 4 , 5 , 5 , 4 , 5 , 4 , 2 , 2 , 2 , 2 , 1 , 0 , 0 , 0 ] s c anne r dat a( vt 100 , [ 0 , 0 , 0 , 26 , 20 , 13 , 13 , 11 , 11 , 11 , 12 , 11 , 11 , 10 , 13 , 24 , 18 , 2 , 2 , 14 , 2 , 16 , 9 , 26 , 15 , 25 , 13 , 16 , 28 , 6 , 0 , 0 ] , 0 , 6 , 18 , 6 , 8 , 21 , 20 , 14 , 14 , 15 , 14 , 13 , 12 , 13 , 13 , 13 , 12 , 14 , 14 , 16 , 14 , 20 , 16 , 3 , 10 , 7 , 11 , 8 , 10 , 17 , 6 , 0 ] 0 , 0 , 0 , 0 , 0 , 0 , 2 , 2 , 2 , 3 , 4 , 5 , 6 , 5 , 8 , 5 , 10 , 5 , 11 , 5 , 12 , 3 , 14 , 7 , 10 , 6 , 16 , 10 , 14 , 10 , 13 , 12 , ....

[Article contains additional citation context not shown here]

Prasenjit Biswas, Shyh-Chang Su, and David Y. Y. Yun. A Scalable Abstract Machine Model to Support Limited-OR (LOR)/Restricted-AND Parallelism (RAP). In Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1161-- 1180. MIT Press, June 1988.

....rossi di.unipi.it THE JOURNAL OF LOGIC PROGRAMMING c flElsevier Science Publishing Co. Inc. 1993 655 Avenue of the Americas, New York, NY 10010 0743 1066 93 3.50 2 MANUEL V. HERMENEGILDO AND FRANCESCA ROSSI 1. INTRODUCTION There has been significant interest (e.g. see [11] 22] 26] 8] [3], 5] 21] 27] 37] 38] and their references) in parallel execution models for logic programs which exploit independent and parallelism. This type of parallelism appears to have (in common with or parallelism see [34] and its references for several models exploiting such parallelism) the ....

P. Biswas, S. Su, and D. Yun. A Scalable Abstract Machine Model to Support Limited-OR/Restricted AND Parallelism in Logic Programs. In Fifth International Conference and Symposium on Logic Programming, pages 1160--1179, Seattle, Washington, 1988. STRICT AND NON-STRICT INDEPENDENT AND-PARALLELISM 43

....1 Introduction With the availability of multiprocessors many approaches to parallel implementations of the Prolog language have been developed. Some of them exploit either ORparallelism [2, 5, 7, 10, 16, 18, 21, 27] or independent AND parallelism [12, 15, 19] or a combination of both [6, 11, 17, 26]. The Muse approach [2] exploits OR parallelism only. In OR parallel execution branches of a Prolog search tree are executed in parallel. Muse based on SICStus Prolog [9] a fast and portable Prolog system) is currently implemented on both bus based and switch based shared memory machines. The ....

Prasenjit Biswas, Shyh-Chang Su, and David Y. Y. Yun. A Scalable Abstract Machine Model to Support Limited-OR (LOR)/Restricted-AND parallelism (RAP) in Logic Programs. In the Proceedings of the Fifth International Conference ` and Symposium on Logic Programming, pages 1160--1179. MIT Press, August 1988.

....during a period of great excitement in the logic programming community. One of the primary triggers of this excitement were the new shared memory multiprocessors from Sequent, Encore and BBN in the mid 1980 s. Many research groups were developing schemes for exploiting parallelism (e.g. [3, 8, 16, 26, 45, 50, 55, 89]) I think funding for the FGCS Project motivated many international researchers to continue in this area. Two particularly promising systems at the time were Aurora OR parallel Prolog 3 [13, 51, 72] and the family of committed choice languages [69, 68] Aurora was being developed at the ....

P. Biswas, S-C. Su, and D. Y. Y. Yun. A Scalable Abstract Machine Model to Support Limited-OR (LOR)/Restricted-AND Parallelism in Logic Programs. In International Conference and Symposium on Logic Programming, pages 1160-- 1179. University of Washington, MIT Press, August 1988.

No context found.

P. Biswas, S. Su, and D. Yun. A Scalable Abstract Machine Model to Support Limited-OR/Restricted AND Parallelism in Logic Programs. In Fifth International Conference and Symposium on Logic Programming, pages 1160--1179, Seattle,Washington, 1988.

No context found.

P. Biswas, S. Su, and D. Yun. A Scalable Abstract Machine Model to Support LimitedOR /Restricted AND Parallelism in Logic Programs. In Fifth International Conference and Symposium on Logic Programming, pages 1160--1179, Seattle,Washington, 1988.

No context found.

Prasenjit Biswas, Shyh-Chang Su, and David Y. Y. Yun. A Scalable Abstract Machine Model to Support Limited-OR (LOR)/Restricted-AND parallelism (RAP) in Logic Programs. In Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages pages 1160 -- 1179, MIT Press, August 1988.

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