Vidal's libraryTitle: | Scalable Duplicate Pruning Strategies for Parallel A* Graph Search |
Author: | Nihar R. Mahapatra and Shantanu Dutt |
Book Tittle: | Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing |
Pages: | 290--297 |
Year: | 1993 |
Abstract: | In parallel A* graph search on distributed-memory machines, different processors may perform significant duplicated work if inter-processor duplicates are not pruned. The only known method for duplicate pruning associates a particular processor with each distinct node of the search space using a suitable hash function. Then duplicate nodes arising in different processors are transmitted to the same processor, and thereby pruned. There are two main drawbacks attributable to such an approach: (1) |
Cited by 2 - Google Scholar
@InProceedings{mahapatra93a,
author = {Nihar R. Mahapatra and Shantanu Dutt},
title = {Scalable Duplicate Pruning Strategies for Parallel
{A}* Graph Search},
googleid = {umw-gQ4j5zwJ:scholar.google.com/},
booktitle = {Proceedings of the Fifth {IEEE} Symposium on
Parallel and Distributed Processing},
pages = {290--297},
year = 1993,
abstract = {In parallel A* graph search on distributed-memory
machines, different processors may perform
significant duplicated work if inter-processor
duplicates are not pruned. The only known method for
duplicate pruning associates a particular processor
with each distinct node of the search space using a
suitable hash function. Then duplicate nodes arising
in different processors are transmitted to the same
processor, and thereby pruned. There are two main
drawbacks attributable to such an approach: (1)},
keywords = {distributed-search},
url =
{http://citeseer.ist.psu.edu/mahapatra93scalable.html},
cluster = {4388514907100703930}
}
Last modified: Wed Mar 9 10:13:48 EST 2011