Consistent Linear Speedups to a First Solution in Parallel State-Space Search

Vikram A. Saletore, L. V. Kalé

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Consider the problem of exploring a large statespace for a goal state. Although many such states may exist, finding any one state satisfying the requirements is sufficient. All methods known until now for conducting such search in parallel fail to provide consistent linear speedups over sequential execution. The speedups vary between sublinear to superlinear and from run to run. Further, adding processors may sometimes lead to a slow-down rather than speedup, giving rise to speedup anomalies. We present prioritizing strategies which yield consistent linear speedups and requires substantially smaller memory over other methods. The performance of these strategies is demonstrated on a multiprocessor.

Original languageEnglish (US)
Title of host publicationProceedings of the 8th National Conference on Artificial Intelligence, AAAI 1990
PublisherAmerican Association for Artificial Intelligence (AAAI) Press
Pages227-233
Number of pages7
ISBN (Electronic)026251057X, 9780262510578
StatePublished - 1990
Event8th National Conference on Artificial Intelligence, AAAI 1990 - Boston, United States
Duration: Jul 29 1990Aug 3 1990

Publication series

NameProceedings of the 8th National Conference on Artificial Intelligence, AAAI 1990

Conference

Conference8th National Conference on Artificial Intelligence, AAAI 1990
Country/TerritoryUnited States
CityBoston
Period7/29/908/3/90

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software

Fingerprint

Dive into the research topics of 'Consistent Linear Speedups to a First Solution in Parallel State-Space Search'. Together they form a unique fingerprint.

Cite this