A Non-Shared Binding Scheme for Parallel Prolog Implementation
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. 1
Cite
Text
Zhang and Thomas. "A Non-Shared Binding Scheme for Parallel Prolog Implementation." International Joint Conference on Artificial Intelligence, 1991.Markdown
[Zhang and Thomas. "A Non-Shared Binding Scheme for Parallel Prolog Implementation." International Joint Conference on Artificial Intelligence, 1991.](https://mlanthology.org/ijcai/1991/zhang1991ijcai-non/)BibTeX
@inproceedings{zhang1991ijcai-non,
title = {{A Non-Shared Binding Scheme for Parallel Prolog Implementation}},
author = {Zhang, Kang and Thomas, Ray},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1991},
pages = {877-883},
url = {https://mlanthology.org/ijcai/1991/zhang1991ijcai-non/}
}