A novel method for parallel implementation of findall
The goal of this paper is to present and evaluate a new method for parallel implementation of findall, preserving the sequential semantics. The method is implemented in the Muse OR-parallel Prolog system and the performance results have been compared with two other methods. The results obtained indicate that our new method is the better one.
Unable to display preview. Download preview PDF.
- Khayri A. M. Ali and Roland Karlsson. Full Prolog and Scheduling Or-Parallelism in Muse. International Journal of Parallel Programming, pages 445–475, Vol. 19, No. 6, December 1990.Google Scholar
- Mats Carlsson, Ken Danhof, and Ross Overbeek. A Simplified Approach to the Implementation of AND-parallelism in an OR-parallel Environment. In the Proceedings of the Fifth International Conference on Logic Programming, pages 1565–1577. MIT Press, August 1988.Google Scholar
- Mats Carlsson, et al. SICStus Prolog User's Manual. SICS Technical Report T91:11B, October 1991.Google Scholar
- Mats Carlsson. Design and Implementation of an OR-Parallel Prolog Engine. PhD thesis, Swedish Institute of Computer Science, SICS Dissertation Series 02, March 1990.Google Scholar
- Roland Karlsson. A High Performance OR-parallel Prolog System. PhD thesis, Swedish Institute of Computer Science, SICS Dissertation Series 07, March 1992.Google Scholar
- Ewing Lusk, David H. D. Warren, Scif Haridi, et al. The Aurora Or-parallel Prolog System. New Generation Computing, 7(2,3): 243–271, 1990.Google Scholar
- David H. D. Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI International, 1983.Google Scholar