Abstract
Committed-choice logic programming languages provide the user with a paradigm to program declaratively in and at the same time allow the user to control and inform the implementation where parallelism might be exploited efficiently. The architecture which supports such programming languages is then outlined. The load balancing scheme for the architecture is then described followed by a method for recovering from deadlock due to there not being enough distributed memory available. Finally the results of the simulation of the distributed memory architecture are presented and discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
7. References
Gregory S. Parallel Logic Programming In Parlog: The Language And Its Implementation Addison-Wesley Publishers Ltd., 1987
Shapiro E. Concurrent Prolog: A Progress Report IEEE Computer, Vol 19, No 8, pp 44–58, August 1986
Ueda K. Guarded Horn Clauses Thesis submitted to the Information Engineering Course of the University of Tokyo, Graduate School in partial fulfillment of the Requirements for the Degree of Doctor of Engineering, March 1986
Westphal H. & Robert P. & Chassin J. & Syre J.-C. The PEPSys Model: Combining Backtracking, AND-and OR-Parallelism Proceedings 4th Symposium on Logic Programming, pp 436–448 September 1987
Connery J.S. Binding Environments for Parallel Logic Programs in Non-Shared Memory Multiprocessors pp 457–467, Proceedings 1987 Symposium on Logic Programming San Francisco, California, U.S.A., August 31–September 4, 1987
Peyton Jones S. L. & Clack C. & Salkild J. & Hardie M. GRIP — A High Performance Architecture for Parallel Graph Reduction Proceedings IFIP Conference on Functional Programming Languages and Computer Architecture, Portland, USA, pp 98–112, Springer Verlag Lecture Notes in Computer Science no. 274 (ed. Kahn G.), September 1987
Crammond J. Implementation of Committed Choice Logic Languages on Shared Memory Multiprocessors Research Report PAR 88/4 and PhD Thesis Department of Computing, Imperial College, October 1988
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheese, A. (1991). Implementing committed-choice logic programming languages on distributed memory computers. In: Bode, A. (eds) Distributed Memory Computing. EDMCC 1991. Lecture Notes in Computer Science, vol 487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032952
Download citation
DOI: https://doi.org/10.1007/BFb0032952
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53951-3
Online ISBN: 978-3-540-46478-5
eBook Packages: Springer Book Archive