A Non-shared Binding Scheme for Parallel Prolog Implementation
Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Logic Programming. Pages 877-882.
Abstract
To allow efficient parallel processing of Prolog programs on distributed multiprocessors, a non-shared variable binding approach is required such that binding environments can be independently distributed among processors. This paper presents a binding scheme, which realises the independence of a clause's binding environment by eagerly instantiating variables across clause arguments. The application of the scheme on a Prolog virtual machine has illustrated its features of efficiency in execution and simplicity in implementation. The preliminary performance evaluation has demonstrated the feasibility of the scheme.
@inproceedings{ijcai1991p129,
title = {A Non-shared Binding Scheme for Parallel Prolog Implementation},
author = {Zhang, Kang and Thomas, Ray},
booktitle = {Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, {IJCAI-91}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John Mylopoulos and Ray Reiter},
pages = {877--882},
year = {1991},
month = {8},
note = {Logic Programming},
url = {https://ijcai.org/proceedings/1991/129},
}
TY - CPAPER TI - A Non-shared Binding Scheme for Parallel Prolog Implementation AU - Zhang, Kang AU - Thomas, Ray T2 - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91 PB - International Joint Conferences on Artificial Intelligence PY - 1991 SP - 877 EP - 882 UR - https://ijcai.org/proceedings/1991/129 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
