Advertisement

ALPUK 91 pp 1-22 | Cite as

Towards Implementing Prolog on Massively Parallel Mixed Architecture Computers

  • Peter Kacsuk
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

A method for implementing Prolog on Massively Parallel Mixed Architecture Systems (MAPMAS) is shown in the paper. First the physical and logical structure of the target MAPMAS (a DAP/Multi-Transputer system) is described. A generalised dataflow model for transforming Prolog programs into the Dataflow Search Graph (DSG) and executing them based on the DSG is shortly overviewed and illustrated with simple examples. In the paper an informal description of the model is given for exploiting OR-parallelism and pipelined AND-parallelism. The main contribution of the paper is the explanation how fact- intensive Prolog programs can be implemented on the DAP side of the MAPMAS. The key points of the implementation are the mapping of the operators and the organisation of parallel token communication in an SIMD environment.

Keywords

Prolog Program Logical Plane Dataflow Model Result Token Clause Representation 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AMT 90]
    Fortran-Plus Language, (man 002), AMT DAP Series, Active Memory Technology Ltd, 1990.Google Scholar
  2. [Barklund et al 88]
    Barklund, J. et al. “KL1 in Condition Graphs on a Connection Machine”, in Proceedings of the International Conference on Fifth Generation Computer Systems, 1988, pp 1041–1050Google Scholar
  3. [Gupta & Jayaraman 90]
    Gupta, G. and Jayaraman, B. “Optimizing And- Or Parallel Implementations”, in Proceedings of the North American Logic Programming Conference, 1990, pp 605–623Google Scholar
  4. [Ichiyoshi et al 88]
    Ichiyoshi, N. et al. “A New External Reference Management and Distributed Unification for KL1”, in Proceedings of the International Conference on Fifth Generation Computer Systems, 1988Google Scholar
  5. [Kacsuk & Bale 87]
    Kacsuk, P. and Bale, A. “DAP Prolog: A Set- Oriented Approach to Prolog”, The Computer Journal, Vol. 30, No. 5, 1987, pp 393–403CrossRefGoogle Scholar
  6. [Kacsuk 90]
    Kacsuk, P. Execution Models of Prolog for Parallel Computers, Pitman Publishing and MIT Press, 1990Google Scholar
  7. [Kacsuk 91]
    Kacsuk, P. “A Parallel Prolog Abstract Machine and its Multi-Transputer Implementation”, The Computer Journal, Vol. 34, No.1, 1991, pp 52–63CrossRefGoogle Scholar
  8. [Kale & Ramkumar 90]
    Kale, L. V. and Ramkumar, B. “Joining AND parallel Solutions in AND/OR parallel Systems”, in Proceedings of the North American Logic Programming Conference, 1990, pp 624–643Google Scholar
  9. [Knuth 73]
    Knuth, D. E. The Art of Computer Programming, Vol. 3 (Sorting and Searching), Addison- Wesley, 1973, p232Google Scholar
  10. [Taylor et al 87]
    Taylor, S., Safra, S. and Shapiro, E. “A Parallel Implementation of Flat Concurrent Prolog”, in Concurrent Prolog Collected Papers, ed. E. Shapiro, MIT Press, 1987, pp 575–604Google Scholar
  11. [Warren 83]
    Warren, D. H. D. An Abstract Prolog Instruction Set, Technical Note 309, SRI International, 1983Google Scholar
  12. [Warren 87]
    Warren, D. H. D. “The SRI Model of OR-Parallel Execution of Prolog — Abstract Design and Implementation Issues”, in Proceedings of the 1987 Symposium on Logic Programming, 1987, pp 92–102Google Scholar

Copyright information

© Springer-Verlag London 1992

Authors and Affiliations

  • Peter Kacsuk
    • 1
  1. 1.Centre for Parallel ComputingQueen Mary and Westfield CollegeLondonEngland

Personalised recommendations