Abstract
The backtrack search problem involves visiting all the nodes of an arbitrary binary tree given a pointer to its root, subject to the constraint that the children of a node are revealed only after their parent is visited. This note describes a fast, deterministic backtrack search algorithm for a p-processor COMMON CRCW-PRAM that visits any n-node tree of height h in time O ((n/p + h)(log log log p)2). This upper bound compares favorably with a natural Ω(n/p + h) lower bound for this problem. Our approach embodies novel, efficient techniques for dynamically assigning tree-nodes to processors to ensure that the work is shared equitably among them.
This research was supported, in part, by MURST and CNR of Italy and by the ESPRIT III Basic Research Programme of the EC under contract No. 9072 (project GEPPCOM).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Aiello and T. Leighton. Coding theory, hypercube embeddings and faulttolerance. In Proceedings of 3rd ACM Symposium on Parallel Algorithms and Architectures, pages 125–136, 1991.
A.Z. Broder, A.M. Frieze, E. Shamir, and E. Upfal. Near-perfect token distribution. In Proceedings of the 19th International Colloquium on Automata, Languages and Programming, pages 308–317, July 1992.
S.N. Bhatt, D. Greenberg, F.T. Leighton, and P. Liu. Tight bounds for online tree embeddings. In Proceedings of the 2nd ACM-SIAM Symposium On Discrete Algorithms, pages 344–350, January 1991.
R. Cole and U. Vishkin. Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM Journal on Computing, 17(1):128–142, 1988.
T. Goldberg and U. Zwick. Optimal deterministic approximate parallel prefix sums and their applications. In Proceedings of 3th Israel Symposium on Theory and Computing Systems, 1994.
J. JáJá. An Introduction to Parallel Algorithms. Addison Wesley, Reading MA, 1992.
C. Kaklamanis and G. Persiano. Branch-and-bound and backtrack search on mesh-connected arrays of processors. Mathematical Systems Theory, 27:471–489, 1994.
R.M. Karp and Y. Zhang. Randomized parallel algorithms for backtrack search and branch and bound computation. Journal of the ACM, 40:765–789, 1993.
P. Liu, W. Aeillo and S. Bhatt. An atomic model for message-passing. In Proceedings of 5th ACM Symposium on Parallel Algorithms and Architectures, pages 154–163, 1993.
T. Leighton, M. Newman, A. G. Ranade and E. Schwabe. Dynamic tree embeddings in butterflies and hypercubes. SIAM Journal on Computing, 21:639–654, 1992.
A.G. Ranade. A simpler analysis of the Karp-Zhang parallel branch-and-bound method. Technical Report No. 586, Computer Science Division, University of California at Berkeley, Berkeley, California, 1990.
A.G. Ranade. Optimal speed-up for backtrack search on a butterfly network. Mathematical Systems Theory, 27:85–101, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herley, K.T., Pietracaprina, A., Pucci, G. (1996). Fast deterministic backtrack search. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_162
Download citation
DOI: https://doi.org/10.1007/3-540-61440-0_162
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61440-1
Online ISBN: 978-3-540-68580-7
eBook Packages: Springer Book Archive