Abstract
Much work has been done in the areas of and-parallelism and data-parallelism in Logic Programs. Both types of parallelism offer advantages and disadvantages: traditional (and-) parallel models offer generality, whereas data-parallelism techniques offer increased performance for a restricted class of programs. The thesis of this paper is that these two forms of parallelism are not fundamentally different and that relating them opens the possibility of obtaining the advantages of both within the same system. Some relevant issues are discussed and solutions proposed. The discussion is illustrated through visualizations of actual parallel executions implementing the ideas proposed.
The authors have been partially supported by ESPRIT project 6707 ParForce
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
K.A.M. Ali and R. Karlsson. The Muse Or-Parallel Prolog Model and its Performance. In 1990 North American Conference on Logic Programming, pages 757–776. MIT Press, October 1990.
Henrik Arro, Jonas Barklund, and Johan Bevemyr. Parallel bounded quantification—preliminary results. ACM SIGPLAN Notices, 28:117–124, 1993.
Jonas Barklund. Parallel Unification. PhD thesis, Comp. Sci. Dept., Uppsala Univ., Uppsala, 1990.
J. Bevemyr, T. Lindgren, and H. Millroth. Reform Prolog: the language and its implementation. In Proc. 10th Intl. Conf. Logic Programming, Cambridge, Mass., 1993. MIT Press.
M. Carro, L. Gómez, and M. Hermenegildo. Some Paradigms for Visualizing Parallel Execution of Logic Programs. In 1993 International Conference on Logic Programming, pages 184–201. MIT Press, June 1993.
J. S. Conery. The And/Or Process Model for Parallel Interpretation of Logic Programs. PhD thesis, The University of California At Irvine, 1983. Technical Report 204.
M. García de la Banda, M. Hermenegildo, and K. Marriott. Independence in Constraint Logic Programs. In 1993 International Logic Programming Symposium, pages 130–146. MIT Press, Cambridge, MA, October 1993.
S. Debray and M. Jain. A Simple Program Transformation for Parallelism. In 1994 International Symposium on Logic Programming, pages 305–319. MIT Press, November 1994.
S. K. Debray, N.-W. Lin, and M. Hermenegildo. Task Granularity Analysis in Logic Programs. In Proc. of the 1990 ACM Conf. on Programming Language Design and Implementation, pages 174–188. ACM Press, June 1990.
D. DeGroot. Restricted AND-Parallelism and Side-Effects. In International Symposium on Logic Programming, pages 80–89. San Francisco, IEEE Computer Society, August 1987.
P. López García, M. Hermenegildo, and S.K. Debray. Towards Granularity Based Control of Parallelism in Logic Programs. In Proc. of First International Symposium on Parallel Symbolic Computation, PASCO'94, pages 133–144. World Scientific Publishing Company, September 1994.
Philip J. Hatcher and Michael J. Quinn. Data-parallel Programming on MIMD Computers. MIT Press, Cambridge, Mass., 1991.
M. Hermenegildo and M. Carro. A Note on Data-Parallelism and (And-Parallel) Prolog. Technical report CLIP 6/94.0, School of Computer Science, Technical University of Madrid (UPM), Facultad Informática UPM, 28660-Boadilla del Monte, Madrid-Spain, June 1995.
M. Hermenegildo and K. Greene. The &-prolog System: Exploiting Independent And-Parallelism. New Generation Computing, 9(3,4):233–257, 1991.
M. Hermenegildo and F. Rossi. Strict and Non-Strict Independent And-Parallelism in Logic Programs: Correctness, Efficiency, and Compile-Time Conditions. Journal of Logic Programming, 22(1):1–45, 1995.
M. Hermenegildo and the CLIP group. Some Methodological Issues in the Design of CIAO — A Generic, Parallel Concurrent Constraint System. In Principles and Practice of Constraint Programming, LNCS 874, pages 123–133. Springer-Verlag, May 1994.
L. Kale. Parallel Execution of Logic Programs: the REDUCE-OR Process Model. In Fourth International Conference on Logic Programming, pages 616–632. Melbourne, Australia, May 1987.
Y. J. Lin and V. Kumar. AND-Parallel Execution of Logic Programs on a Shared Memory Multiprocessor: A Summary of Results. In Fifth International Conference and Symposium on Logic Programming, pages 1123–1141. MIT Press, August 1988.
E. Lusk et. al. The Aurora Or-Parallel Prolog System. New Generation Computing, 7(2,3), 1990.
Håkan Millroth. Reforming compilation of logic programs. In Vijay Saraswat and Kazunori Ueda, editors, Logic Programming, Proceedings of the 1991 International Symposium, pages 485–502, San Diego, USA, 1991. The MIT Press.
L. Naish. Parallelizing NU-Prolog. In Fifth International Conference and Symposium on Logic Programming, pages 1546–1564. University of Washington, MIT Press, August 1988.
E. Pontelli, G. Gupta, and M. Hermenegildo. &ACE: A High-Performance Parallel Prolog System. In International Parallel Processing Symposium. IEEE Computer Society Technical Committee on Parallel Processing, IEEE Computer Society, April 1995.
E. Pontelli, G. Gupta, D. Tang, M. Hermenegildo, and M. Carro. Efficient Implementation of And-parallel Prolog Systems. Technical Report CLIP4/95.0, T.U. of Madrid (UPM), June 1995.
S. Prestwich. On parallelisation strategies for logic programs. In Springer-Verlag, editor, Proceedings of the International Conference on Parallel Processing, number 854 in Lecture Notes in Computer Science, pages 289–300, 1994.
V. Santos-Costa, D.H.D. Warren, and R. Yang. The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model. In 1991 International Conference on Logic Programming, pages 825–839. MIT Press, June 1991.
K. Shen. Exploiting Dependent And-Parallelism in Prolog: The Dynamic, Dependent And-Parallel Scheme. In Proc. Joint Int'l. Conf. and Symp. on Logic Prog. MIT Press, 1992.
Thinking Machines Corp., Cambridge, Mass. The Essential * LISP Manual, 1986.
Thinking Machines Corp., Cambridge, Mass. C * Programming Guide, 1990.
Andrei Voronkov. Logic programming with bounded quantifiers. In Andrei Voronkov, editor, Logic Programming-Proc. Second Russian Conf. on Logic Programming, LNCS 592, Berlin, 1992. Springer-Verlag.
R. Warren and M. Hermenegildo. Experimenting with Prolog: An Overview. Technical Report 43, MCC, March 1987.
X. Zhong, E. Tick, S. Duvvuru, L. Hansen, A.V.S. Sastry, and R. Sundararajan. Towards an Efficient Compile-Time Granularity Analysis Algorithm. In Proc. of the 1992 International Conference on Fifth Generation Computer Systems, pages 809–816. Institute for New Generation Computer Technology (ICOT), June 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hermenegildo, M.V., Carro, M. (1995). Relating data-parallelism and (and-) parallelism in logic programs. In: Haridi, S., Ali, K., Magnusson, P. (eds) EURO-PAR '95 Parallel Processing. Euro-Par 1995. Lecture Notes in Computer Science, vol 966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020453
Download citation
DOI: https://doi.org/10.1007/BFb0020453
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60247-7
Online ISBN: 978-3-540-44769-6
eBook Packages: Springer Book Archive