Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)
Shared memory execution of committed-choice languages
We presents a framework for execution of Committed-choice Logic Programming languages on shared memory multiprocessors. Synchronization of exclusive access issues are explored.
KeywordsShared Memory Memory Location Computation Unit Status Word Memory Architecture
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.
Unable to display preview. Download preview PDF.
- J. Dongarra, A Comparative Study of Commercial MultiProcessors, to appear as ANL-MCS Technical Report, 1985.Google Scholar
- E. Shapiro, A Subset of Concurrent Prolog and Its Interpreter, Technical Report TR-003, ICOT, Tokio, February 1983.Google Scholar
- K.L. Clark and S. Gregory, PARLOG: a Parallel Logic Programming Language, Research Report DOC 84/15, Dept. of Computing, Imperial College, London, June 1984.Google Scholar
- K. Ueda, Guarded Horn Clauses, Technical Report TR-103, ICOT, Tokio, June 1985.Google Scholar
- J. Levy, N. Friedmann and E. Shapiro, Concurrent Prolog — Two New Implementation Schemes, to appear as Weizmann Institute Technical Report, 1985.Google Scholar
- J. Levy, A GHC Abstract Machine and Instruction Set, Weizmann Institute Technical Report CS85-11, August 1985.Google Scholar
- S. Taylor, M. Safra, E. Shapiro, L. Hellerstein and U. Bar-on, A Distributed Unification Scheme for Flat Concurrent Prolog, to appear as Weizmann Technical Report, 1985.Google Scholar
- C. Mierowski, Design and Implementation of Flat Concurrent Prolog, Weizmann Institute Technical Report CS84-21, 1984.Google Scholar
- J. Levy, Shared-memory Execution of Committed-choice Languages, To appear as Weizmann Institute Technical Report.Google Scholar
© Springer-Verlag Berlin Heidelberg 1986