Abstract
FCP is a general purpose concurrent logic programming language. We describe a distributed implementation of FCP on a multi-transputer environment based on the design of a parallel FCP machine.
Substantial design issues including the applied distributed reduction algorithm as well as the integration of the different communication models — the one for the application language and the one for the target architecture — are considered in detail. From our prototype implementation running on a Parsytec Supercluster multi-transputer system, we present some performance results.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E. W., Feijen, W. H. J., and van Gasteren, A. J. M. 1983. Derivation of a Termination Detection Algorithm for Distributed Computations. In Information Processing Letters, Vol. 16, pp. 217–219.
Foster, I., and Taylor, S. 1990. Strand, New Concepts in Parallel Programming. Prentice-Hall.
Glässer, U., and Lehrenfeld, G. 1990. A distributed implementation of Flat Concurrent Prolog on Transputer architectures. In Proceedings of the UNESCO Conference on Parallel Computing in Engeneering and Engeneering Education, Paris, pp. 181–185.
Hoare, C. A. R. 1978. Communicating Sequential Processes. In Communications of the ACM, Vol. 21 (8), pp. 666–677.
May, D. 1990. Future Directions in Transputer Technology. In Proceedings of UNESCO Conference on Parallel Computing in Engineering and Engineering Education, Paris, pp. 193–203.
Mierowsky, C., Taylor, S., Shapiro, E., Levy, J., and Safra, S. 1985. The design an implementation of Flat Concurrent Prolog. Tech. Rep. CS85-9, Dept. of Computer Science, The Weizmann Institute of Science, Rehovot, Israel.
Parsec 1989. Par.C System: User's Manual and Library Reference Version 1.22. Parsec Developments, Leiden, The Netherlands.
Shapiro, E. 1989. The Family of Concurrent Logic Programming Languages. In ACM Computing Surveys, Vol. 21 (3), pp. 413–510.
Silverman, W., Hirsch, M., Houri, A., and Shapiro, E. 1987. The Logix system user manual Version 1.21. In Concurrent Prolog: Collected Papers, Vol. 2, E. Shapiro, Ed. MIT Press, Cambridge, Mass., pp. 46–77.
Takeuchi, A., and Furukawa, K. 1987. Parallel Logic Programming Languages. In Proceedings of the 3rd International Conference on Logic Programming, Lecture Notes in Computer Science, Vol 225, Springer-Verlag, New York, pp. 242–254
Taylor, S., Safra, S., and Shapiro, E. 1987. A Parallel Implementation of Flat Concurrent Prolog. In International Journal of Parallel Programming, Vol. 15, No. 3, pp. 245–275
Taylor, S. 1989. Parallel Logic Programming Techniques. Prentice-Hall.
Ueda, K. 1989. Parallelism in Logic Programming. In Proceedings of the IFIP Congress, North-Holland Amsterdam, pp. 957–964.
Warren, D. H. D. 1983. An Abstract Prolog Instruction Set. Technical Note 309, Artificial Intelligence Center, SRI.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glässer, U., Hannesen, G., Kärcher, M., Lehrenfeld, G. (1992). A distributed implementation of flat concurrent prolog on multi-transputer environments. In: Zima, H.P. (eds) Parallel Computation. ACPC 1991. Lecture Notes in Computer Science, vol 591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55437-8_87
Download citation
DOI: https://doi.org/10.1007/3-540-55437-8_87
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55437-0
Online ISBN: 978-3-540-47073-1
eBook Packages: Springer Book Archive