Skip Navigation

The Computer Journal 1990 33(3):215-218; doi:10.1093/comjnl/33.3.215
© 1990 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 (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ng, K. W.
Right arrow Articles by Leung, H. F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Competition: A Model of AND-Parallel Execution of Logic Programs

K. W. Ng1 * and H. F. Leung2 §

1 Department of Computer Science, School of Electrical Engineering and Computer Science, The University of New South Wales, P.O. Box 1, Kensington, NSW 2033, Australia, 2 Dept. of Computing, Imperial College, London, SW7 2BZ, UK

In this paper an execution model for AND-parallel execution of logic programs is presented. This model is designed on the basis on the Lin-Kumar-Leung model and a Backward Execution algorithm proposed by Conery. The new algorithm is potentially more efficient than the Lin-Kumar-Leung model, and is also better than the Conery model because it is applicable to non-static data dependency graphs.

Received September 1987. revised November 1989.

* Present address: Department of Computer Science, School of Electrical Engineering and Computer Science, The University of New South Wales, P.O. Box 1, Kensington, NSW 2033, Australia.

§ Dept. of Computing, Imperial College, London, SW7 2BZ.

Department of Computer Science, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong


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.