Skip to main content
SpringerLink
Log in

Optimal speedup for backtrack search on a butterfly network

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

We present a generic algorithm for implementing backtrack search on anN processor butterfly network. For a backtrack search tree havingM nodes the heighth, our algorithm requires timeO(M/N +h) with high probability. This is optimal and is obtained without making assumptions about the shape of the tree being searched.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. Aiello and T. Leighton. Optimal speedup for bracktrack search on a butterfly network.Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 125–136, July 1991.

  2. G. Bennett. Probability inequalities for the sum of independent random variables.Journal of the American Statistical Association, 57:33–45, 1962.

    Google Scholar 

  3. S. Bhatt, D. Greenberg, T. Leighton, and P. Liu. Tight bounds for on-line tree embeddings. Manuscript, 1991.

  4. W. Hoeffding. Probability inequalities for sums of bounded random variables.Journal of the American Statistical Association, 58:13–30, 1963.

    Google Scholar 

  5. R. Karp and Y. Zhang. A randomized parallel branch-and-bound procedure.Proceedings of the ACM Annual Symposium on Theory of Computing, pages 290–300, 1988.

  6. T. Leighton, M. Newman, A. Ranade, and E. Schwabe. Dynamic tree embeddings on butterflies and hypercubes.Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 224–234, June 1989.

  7. A. G. Ranade. A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method. Technical Report UCB/CSD 90/586, University of California, August 1990.

  8. Y. Zhang. Parallel Algorithms for Combinatorial Search Problems. Ph.D. thesis, UCB/CSD 89/543, University of California, 1989.

Download references

Author information

Authors and Affiliations

  1. Computer Science Division, University of California, 94720, Berkeley, CA, USA

    Abhiram Ranade

Authors
  1. Abhiram Ranade
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by NSF-DARPA Grant No. CCR-9005448 and Air Force Office of Scientific Research, Grant No. F49620-90-C-0029. A preliminary version of this paper appeared in theProceedings of the Third ACM Symposium on Parallel Algorithms and Architectures, July 1991, Hilton Head, South Carolina.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ranade, A. Optimal speedup for backtrack search on a butterfly network. Math. Systems Theory 27, 85–101 (1994). https://doi.org/10.1007/BF01187094

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01187094

Keywords

Search

Navigation