Abstract
In this paper we propose a complete scheme for automatic exploitation of independent and-parallelism in CLP programs. We first discuss the new problems involved because of the different properties of the independence notions applicable to CLP. We then show how independence can be derived from a number of standard analysis domains for CLP. Finally, we perform a preliminary evaluation of the efficiency, accuracy, and effectiveness of the approach by implementing a parallelizing compiler for CLP based on the proposed ideas and applying it on a number of CLP benchmarks.
This work was funded in part by ESPRIT project 7195 “ACCLAIM” and by CICYT projects TIC93-0975-CE and TIC93-0737-C02-01 IPL-D. We thank M. Bruynooghe for comments on previous versions of this paper.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Bueno, M. García de la Banda, and M. Hermenegildo. A Comparative Study of Methods for Automatic Compile-time Parallelization of Logic Programs. In Parallel Symbolic Computation, pages 63–73. World Scientific Publishing, 1994.
F. Bueno, M. García de la Banda, and M. Hermenegildo. Effectiveness of Global Analysis in Strict Independence-Based Automatic Program Parallelization. In International Logic Programming Symposium, pages 320–336. MIT Press, 1994.
A. Cortesi, G. File, and W. Winsborough. Prop Revisited: Prepositional Formulas as Abstract Domains for Groundness Analysis. In Sixth IEEE Symposium on Logic in Computer Science, pages 222–327, 1991. IEEE Computer Society.
P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In ACM Symposium on Principles of Programming Languages, pages 238–252, 1977.
M. García de la Banda and M. Hermenegildo. A Practical Approach to the Global Analysis of Constraint Logic Programs. In International Logic Programming Symposium, pages 437–455. MIT Press, 1993.
M. García de la Banda, M. Hermenegildo, and K. Marriott. Independence in Constraint Logic Programs. In ILPS'93, pages 130–146. MIT Press, 1993.
V. Dumortier, G. Janssens, M. Bruynooghe, and M. Codish. Freeness Analysis in the Presence of Numerical Constraints. In Tenth International Conference on Logic Programming, pages 100–115. MIT Press, 1993.
M.J. Fernández, M. Carro, and M. Hermenegildo. Idra (ideal resource allocation): Computing ideal speedups in parallel logic programming. In Proceedings of EuroPar'96, LNCS. Springer-Verlag, 1996.
P. Van Hentenryck. Parallel Constraint Satisfaction in Logic Programming. In International Conference on Logic Programming, pages 165–180. MIT Press, 1989.
M. Hermenegildo, F. Bueno, M. García de la Banda, and G. Puebla. The CIAO Multi-Dialect Compiler and System. In Proc. of the ILPS'95 Workshop on Visions for the Future of Logic Programming, 1995.
M. Hermenegildo and K. Greene. The &-Prolog System: Exploiting Independent And-Parallelism. New Generation Computing, 9(3,4):233–257, 1991.
C. Holzbaur. Metastructures vs. Attributed Variables in the Context of Extensible Unification. In International Symposium on Programming Language Implementation and Logic Programming, pages 260–268. LNCS631, Springer Verlag, 1992.
J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 13/20:503–581, 1994.
S. Janson and S. Haridi. Programming Paradigms of the Andorra Kernel Language. In Int'l Logic Programming Symp., pages 167–183. MIT Press, 1991.
K. Marriott and P. Stuckey. Approximating Interaction Between Linear Arithmetic Constraints. In Int'l Logic Prog. Symp., pages 571–585. MIT Press, 1994.
K. Muthukumar and M. Hermenegildo. Compile-time Derivation of Variable Dependency Using Abstract Interpretation. Journal of Logic Programming, 13(2 and 3):315–347, 1992.
V. Santos-Costa, D.H.D. Warren, and R. Yang. Andorra-I: A Parallel Prolog System that Transparently Exploits both And-and Or-parallelism. In ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming. ACM, 1990.
K. Shen. Exploiting Dependent And-Parallelism in Prolog: The Dynamic, Dependent And-Parallel Scheme. In Joint Int'l. Conference and Symposium on Logic Programming MIT Press, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
García de la Banda, M., Bueno, F., Hermenegildo, M. (1996). Towards independent and-parallelism in CLP. In: Kuchen, H., Doaitse Swierstra, S. (eds) Programming Languages: Implementations, Logics, and Programs. PLILP 1996. Lecture Notes in Computer Science, vol 1140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61756-6_78
Download citation
DOI: https://doi.org/10.1007/3-540-61756-6_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61756-3
Online ISBN: 978-3-540-70654-0
eBook Packages: Springer Book Archive