Abstract
Most models that have been proposed (or implemented) so far for exploiting both or-parallelism and independent and-parallelism have only considered pure logic programs (pure Prolog). We present an abstract model, called the Composition-Tree, for representing and-or parallelism in full Prolog. The Binding Array scheme is extended for And-Or parallel execution based on the Composition-tree. We also show how extra-logical predicates, such as cuts and side-effects, can be supported in this model.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Ali, “A Method for Implementing Cut in Parallel Execution of Prolog,” In International Symposium on Logic Programming, 1987, pp. 449–456.
K. Ali, R. Karlsson: “The Muse Or-parallel Prolog Model and its performance”. In Proceedings of the North American Conference on Logic Programming '90, MIT Press, to appear
K. Ali, R. Karlsson: “Full Prolog and Scheduling Or-parallelism in Muse”. To appear in International Journal of Parallel Programming, 1991.
Uri Baron, et. al.: “The Parallel ECRC Prolog System PEPSys: An Overview and Evaluation Results”. In Proceedings of FGCS '88, Tokyo, pp. 841–850.
T. Beaumont, S. Muthu Raman, et al.: “Flexible Scheduling or Or-parallelism in Aurora: The Bristol Scheduler”. In Proceedings of PARLE '91, Springer Verlag, LNCS 506, pp. 403–420.
S-E. Chang and Y.P. Chiang: “Restricted And-Parallelism Model with Side Effects”. In Proceedings of North American Conference on Logic Programming, 1989, MIT Press, pp. 350–368.
D. DeGroot: “Restricted And-Parallelism and Side-effects”. In International Symposium on Logic Programming, San Francisco, 1987, pp. 80–89.
G. Gupta and B. Jayaraman: “Compiled And-Or Parallel Execution of Logic Programs”. In Proceedings of the North American Conference on Logic Programming '89, MIT Press, pp. 332–349.
G. Gupta and B. Jayaraman: “On Criteria for Or-Parallel Execution Models of Logic Programs”. In Proceedings of the North American Conference on Logic Programming '90, MIT Press, pp. 604–623.
G. Gupta and B. Jayaraman: “Optimizing And-Or Parallel Implementations”. In Proceedings of the North American Conference on Logic Programming '90, MIT Press, pp. 737–756.
G. Gupta and M. Hermenegildo: “Recomputation Based And-Or Parallel Implementations of Prolog”. In Proceedings of International Conference on Fifth Generation Computer Systems '92, Tokyo, 1992.
G. Gupta, V. Santos Costa: “Cut and Side Effects in And-Or Parallel Prolog”. University of Bristol TR-91-26, 16 pages.
G. Gupta, V. Santos Costa, R. Yang, M. Hermenegildo: “IDIOM: A Model for Integrating Dependent-and, Independent-and and Or-parallelism”. In Proceedings of ILPS, MIT Press, Oct. 1991.
M. V. Hermenegildo: “An Abstract Machine Based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel”. PhD Thesis, University of Texas at Austin, 1986.
B. Hausman, A. Ciepielewski, and A. Calderwood: “Cut and Side-Effects in Or-Parallel Prolog”. In International Conference on Fifth Generation Computer Systems, Tokyo, Nov. 88, pp. 831–840.
B. Hausman, et. al.: “Or-Parallel Prolog Made Efficient on Shared Memory Multiprocessors” in IEEE Int. Symp. in Logic Prog., San Francisco, 1987.
M. V. Hermenegildo, K.J. Green, “&-Prolog and its performance: Exploiting Independent And-Parallelism”. In Proceedings of the 7th International Conference on Logic Programming, 1990, pp. 253–268.
S. Haridi, S. Janson: “Kernel Andorra Prolog and its Computation Model”. In Proceedings of ICLP, MIT Press, June, 1990, pp. 31–46.
L. V. Kalé, D. A. Padua, D. C. Sehr, “Parallel Execution of Prolog with Side-Effects”. In J. of Supercomputing, 2(2), 1988, pp. 209–223.
Y-J. Lin and V. Kumar: “AND-parallel execution of Logic Programs on a Shared Memory Multiprocessor: A Summary of Results”, in Fifth International Logic Programming Conference, Seattle, WA.
E. Lusk, D.H.D. Warren, S. Haridi et. al: “The Aurora Or-Prolog System”. In New Generation Computing, Vol. 7, No. 2,3, 1990 pp. 243–273.
K. Muthukumar and M. Hermenegildo: “Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted And-Parallelism”. In Proc. of ICLP, 1989.
B. Ramkumar and L. V. Kalé: “Compiled Execution of the REDUCE-OR Process Model”. In Proc. of NACLP '89, MIT Press, pp. 313–331.
M. Ratcliffe, J-C Syre: “A Parallel Logic Programming Language for PEPSys” In Proceedings of IJCAI '87, Milan, pp. 48–55.
R. Sindaha: “The Dharma Scheduler — Definitive Scheduling in Aurora on Multiprocessor Architecture”. Technical Report, University of Bristol.
K. Shen and M. V. Hermenegildo: “A Simulation Study of Or Independent And-Parallelism”. In Proc. of ILPS MIT Press, 1991.
K. Shen: “Studies of And-Or Parallelism in Prolog”. Ph.D. thesis, Cambridge University, 1992, forthcoming.
V. Santos Costa, D. H. D. Warren, R. Yang: “Andorra-I: A Parallel Prolog system that transparently exploits both And-and Or-Parallelism”. In Proceedings of Principles & Practice of Parallel Programming, Apr. '91, pp. 83–93.
A. Véron, J. Xu, et. al.: “Virtual Memory Support for Parallel Logic Programming Systems”. In PARLE'91, Springer Verlag, LNCS 506, 1991.
D. S. Warren: “Efficient Prolog Memory Management for Flexible Control Strategies”. In The 1984 Int. Syrnp. on Logic Prog., Atlantic City, pp. 198–202.
D. H. D. Warren: “The SRI-model for Or-Parallel execution of Prolog-Abstract Design and Implementation Issues”. In 1987 IEEE Int. Symp. in Logic Prog., San Francisco.
D.H.D. Warren: “Extended Andorra Model with Implicit Control” Talk given at Workshop on Parallel Logic Programming, 7th ICLP, Eilat.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, G., Costa, V.S. (1992). And-or parallelism in full Prolog with paged Binding Arrays. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_114
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_114
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive