### Abstract

When N processors perform depth-first search on disjoint parts of a state space tree to find a solution, the speedup can be superlinear (i.e., > N) or sublinear (i.e., <N) depending upon when a solution is first encountered in the space by one of the processors. It may appear that on the average, the speedup would be either linear or sublinear. Using an analytical model, we show that if the search space has more than one solution and if these solutions are randomly distributed in a relatively small region of the search space, then the average speedup in parallel depth-first search can be superlinear. If all the solutions (one or more) are uniformly distributed over the whole search space, then the average speedup is linear. This model is validated by our experiments on synthetic state-space trees and the 15-puzzle problem. The same model predicts average superlinear speedup in parallel best-first branch-and-bound algorithms on suitable problems.

Original language | English (US) |
---|---|

Title of host publication | Foundations of Software Technology and Theoretical Computer Science - 8th Conference, Proceedings |

Editors | Kesav V. Nori, Sanjeev Kumar |

Publisher | Springer- Verlag |

Pages | 161-174 |

Number of pages | 14 |

ISBN (Print) | 9783540505174 |

DOIs | |

State | Published - Jan 1 1988 |

Event | 8th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1988 - Pune, India Duration: Dec 21 1988 → Dec 23 1988 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 338 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 8th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1988 |
---|---|

Country | India |

City | Pune |

Period | 12/21/88 → 12/23/88 |

## Fingerprint Dive into the research topics of 'Superlinear speedup in parallel state-space search'. Together they form a unique fingerprint.

## Cite this

*Foundations of Software Technology and Theoretical Computer Science - 8th Conference, Proceedings*(pp. 161-174). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 338 LNCS). Springer- Verlag. https://doi.org/10.1007/3-540-50517-2_79