This monograph concentrates on the implementation ofconcurrent logic programming languages on loosely-coupledparallel computer architectures. Two different abstractmodels are also considered: a graph reduction based modeland a more imperative approach. The design of a specializedinstruction set is presented that is general enough to beused for the whole family of concurrent logic programminglanguages. In particular the language Parlog is concentratedupon because it is the most efficiently implementable of allthe non-flat logic programming languages. Other issuesarising from the implementation of a programming languageare discussed, in particular the design of a load balancingscheme which deals with the large number of short-livedprocesses inherent in a correct language implementation.Detailed descriptions of all the data structures andsynchronisation algorithms are also presented. Resourceexhaustion is also discussed and handled within theimplementations. Detailed performance results for bothmodels of computation are given. From the material it shouldbe possible for the reader to create an implementation.
Parlog a concurrent logic programming language.- A fine-grain graph-reduction model of computation.- Implementing parlog on a packet-rewriting computational model.- The Multi-Sequential coarse-grain approach.- Summary, further work and conclusions.
Series: Lecture Notes in Computer Science
Number Of Pages: 190
Published: 20th May 1992
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6
Weight (kg): 0.29