Skip Navigation

The Computer Journal 1991 34(1):52-63; doi:10.1093/comjnl/34.1.52
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kacsuk, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Parallel Prolog Abstract Machine and its Multi-Transputer Implementation

P. Kacsuk *

Centre for Parallel Computing, Queen Mary and Westfield College, Mile End Road, London E1 4NS, UK

A second and revised version of the Parallel Prolog Abstract Machine (PPAM) is described in the paper. PPAM-2 is suitable for implementing Prolog on communicating process architecture-type, highly parallel computers with regular interconnection network. The parallel computational model behind PPAM-2 is an extended cellular-dataflow model, whose main features have been published elsewhere.16 Based on the model, Prolog programs are transformed into a dataflow search graph representing the static structure of the program. The paper explain in detail how the Prolog programs can be transformed into the dataflow graph form.

The dynamic behaviour of the program is determined by the extended transition functions of the operators. By modifying the extended transition functions different kinds of parallelism can be achieved during the execution of the PPAM-2 code. In the paper an informal description is given of the transition functions realising OR-parallelism and pipelined AND-parallelism.

A multi-transputer implementation of PPAM-2 has been investigated in the paper. First the chosen interconnection topology of the multi-transputer-based machine is described, then the method for mapping the dataflow search graph of Prolog programs on to the chosen topology. Finally, the realisation of the dataflow operations on transputers are overviewed.

Received February 1988. revised July 1990.

* Centre for Parallel Computing, Queen Mary and Westfield College, Mile End Road, London E1 4NS


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.