DocumentCode :
3219765
Title :
Efficient techniques for distributed implementation of search-based AI systems
Author :
Gupta, G. ; Pontelli, E.
Author_Institution :
Dept. of Comput. Sci., New Mexico State Univ., Las Cruces, NM, USA
fYear :
1999
fDate :
24-24 Sept. 1999
Firstpage :
319
Lastpage :
326
Abstract :
We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a technique for implementing or-parallelism, which when coupled with appropriate scheduling strategies leads to: (i) reduced communication during distributed execution; and, (ii) distribution of larger grain- sized work to processors. The modified technique can also be implemented on shared memory machines and should be quite competitive with existing methods. Indeed, an implementation has been carried out on shared memory machines, and the results are reported here.
Keywords :
artificial intelligence; parallel programming; search problems; shared memory systems; distributed machines; or-parallelism; parallelism; scheduling; search-based AI systems; shared memory machines; stack-splitting; Artificial intelligence; Artificial neural networks; Computer science; Databases; Image recognition; Laboratories; Logic programming; Parallel processing; Read only memory; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing, 1999. Proceedings. 1999 International Conference on
Conference_Location :
Aizu-Wakamatsu City, Japan
ISSN :
0190-3918
Print_ISBN :
0-7695-0350-0
Type :
conf
DOI :
10.1109/ICPP.1999.797418
Filename :
797418
Link To Document :
بازگشت