Optimistic and-parallelism in Prolog
The principle of stream-parallelism is used to discuss a general method for AND-parallelism in executing logic programs written in Prolog. The method is entirely transparent, it delivers solutions in the same order as Prolog, but tries to achieve a higher degree of parallelism than other dynamic methods for clauses containing shared variables.
Unable to display preview. Download preview PDF.
- 2.Conery, J.S., “The AND/OR Process Model for Parallel Interpretation of Logic Programs,” Technical Report 204, University of California Irvine (1983).Google Scholar
- 3.Conery, J.S. and D.F. Kibler, “AND Parallelism and Nondeterminism in Logic Programs,” New Generation Computing 3, pp. 43–70 (1985).Google Scholar
- 4.DeGroot, D., “Restricted And-Parallelism,” Proceedings of the International Conference on Fifth Generation Computer Systems, pp. 471–478 (1984).Google Scholar
- 5.DeGroot, D. and Jung-Herng Chang, “A Comparison of two And-Parallel Execution Models,” Hardware and Software Components and Architecture for the 5th Generation, AFCET informatique (1985).Google Scholar
- 6.Goto, A. and D.H.D. Warren, “An Abstract Prolog Instruction Set,” Technical Note 309, SRI International, Menlo Parc, CA (October 1983).Google Scholar
- 7.Nakajima, K., “Evaluation of PSI Micro-interpreter,” ICOT Technical Report 142 (1986).Google Scholar
- 9.Shapiro, E.Y., “A Subset of Concurrent Prolog and Its Interpreter,” ICOT Technical Report TR-003, Institute for New Generation Computer Technology, Tokyo (February, 1983).Google Scholar
- 10.Stroustrup, B., “A Set of C Classes for Co-routine Style Programming,” Bell Laboratories Computing Science Technical Report No 90 (July, 1982).Google Scholar
- 11.Tick, E. and D.H.D. Warren, “Towards a Pipelined Prolog Processor,” Proc. of the 1984 International Symposium on Logic Programming, pp. 29–42 (February 6–9, 1984).Google Scholar
- 12.Ueda, K., “Guarded Horn Clauses,” ICOT Technical Report 103 (1985).Google Scholar
- 13.Warren, D.H.D., “Implementing Prolog — compiling predicate logic programs,” D.A.I. Research Report No. 39 & 40 (May, 1977).Google Scholar