Abstract
This paper presents DAOS, a model for exploitation of And-and Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically shared address space. Exploiting both major forms of implicit parallelism should serve a broadest range of applications. Besides, a model that uses a distributed memory environment provides scalability and can be implemented over a computer network. However, distributed implementations of logic programs have to deal with communication overhead and inherent complexity of distributed memory managent. DAOS overcomes those problems through the use of a distributed shared memory layer to provide single-writer, multiple-readers sharing for the main execution stacks combined with explicit message passing for work distribution and management.
Chapter PDF
References
K.A.M. Ali and R. Karlsson. The Muse Or-parallel Prolog Model and its Performance. In Proceedings of the North American Conference on Logic Programming, pages 757–776. MIT Press, October 1990.
J. Briat, M. Favre, C. Geyer, and J. Chassin. Scheduling of or-parallel Prolog on a scaleable, reconfigurable, distributed-memory multiprocessor. In Proceedings of Parallel Architecture and Languages Europe. Springer Verlag, 1991.
C. Amza et al. TreadMarks: Shared memory computing on networks of workstations. IEEE Computer, 19(2):18–28, February 1996.
P. Codognet and D. Diaz. wamcc: Compiling Prolog to C. In 12th International Conference on Logic Programming. The MIT Press, 1995.
M.E. Correia, F.M.A. Silva, and V. Santos Costa. The SBA: Exploiting orthogonality in OR-AND Parallel Systems. In Proceedings of the 1997 International Logic Programming Symposium, October 1997.
G. Gupta, M. Hermenegildo, and V. Santos Costa. And-Or Parallel Prolog: A Recomputation based Approach. New Generation Computing, 11(3,4):770–782, 1993.
M.V. Hermenegildo. An Abstract Machine for Restricted And-Parallel Execution of Logic Programs. In E. Shapiro, editor, Third International Conference on Logic Programming, London, pages 25–39. Springer-Verlag, July 1986.
E. Lusk, R. Butler, T. Disz, R. Olson, R. Overbeek, R. Stevens, D.H.D. Warren, A. Calderwood, P. Szeredi, S. Haridi, P. Brand, M. Carlsson, A. Ciepelewski, and B. Hausman. The Aurora or-parallel Prolog system. In International Conference on Fifth Generation Computer Systems 1988, pages 819–830. ICOT, Tokyo, Japan, Nov. 1988.
E. Pontelli, G. Gupta, M. Hermenegildo, M. Carro, and D. Tang. Efficient Implementation of And-Parallel Logic Programming Systems. Computer Languages, 22(2/3), 1996.
V. Santos Costa, R. Bianchini, and I.C. Dutra. Parallel Logic Programming Systems on Scalable Multiprocessors. In Proceedings of the 2nd International Symposium on Parallel Symbolic Computation, PASCO’97, pages 58–67, July 1997.
V. Santos Costa, M.E. Correia, and F. Silva. Performance of Sparse Binding Arrays for Or-Parallelism. In Proceedings of the VIII Brazilian Symposium on Computer Architecture and High Performance Processing-SBAC-PAD, August 1996.
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 Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming PPOPP, pages 83–93. ACM press, April 1991. SIGPLAN Notices vol 26(7), July 1991.
K. Shen. Initial Results from the Parallel Implementation of DASWAM. In M. Maher, editor, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming. The MIT Press, 1996.
F.M.A. Silva. An Implementation of Or-Parallel Prolog on a Distributed Shared Memory Architecture. PhD thesis, Dept. of Computer Science, Univ. of Manchester, September 1993.
A.R. Verden and H. Glaser. Independent And-Parallel Prolog for Distributed Memory Architectures. Technical report, Department of Electronics and Computer Science, University of Southampton, Apr. 1990.
D.H.D. Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI International, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castro, L., Geyer, C.F.R., Vargas, P.K., Costa, V.S., Silva, F., Correia, M.E. (1999). DAOS — Scalable And-Or Parallelism. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_125
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_125
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive