Searching Game Trees in Parallel Using SSS
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Tools. Pages 42-46.
Abstract
PARSSS* is a parallel fonnulation of SSS* that is suitable for shared-memory multiprocessor systems. It is based on the distributed tree search paradigm of Ferguson and Korf. The main difficulty in parallelizing SSS* lies in achieving proper coordination between processes running on different subtrees of the game tree. This has been resolved in PARSSS* by the use of a shared array which maintains summary infonnation on all processes that are currently in execution. Problem-independent speed-up values for PARSSS* have been obtained experimentally. It is shown that an earlier algorithm of the authors, called ITERSSS*, which allows SSS* to run in restricted memory, can also be parallelized using the above scheme.
@inproceedings{ijcai1989p7,
title = {Searching Game Trees in Parallel Using SSS},
author = {Bhattacharya, Subir and Bagchi, Amitava},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {42--46},
year = {1989},
month = {8},
note = {Tools},
url = {https://ijcai.org/proceedings/1989/7},
}
TY - CPAPER TI - Searching Game Trees in Parallel Using SSS AU - Bhattacharya, Subir AU - Bagchi, Amitava T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 42 EP - 46 UR - https://ijcai.org/proceedings/1989/7 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
