Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Communication complexity for parallel divide-and-conquer
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Tight bounds for on-line tree embeddings
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
An introduction to parallel algorithms
An introduction to parallel algorithms
Dynamic tree embeddings in butterflies and hypercubes
SIAM Journal on Computing
An atomic model for message-passing
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Randomized parallel algorithms for backtrack search and branch-and-bound computation
Journal of the ACM (JACM)
Branch-and-bound and backtrack search on mesh-connected arrays of processors
Proceedings of the 4th ACM symposium on Parallel algorithms and architectures
Optimal speedup for backtrack search on a butterfly network
Proceedings of the 3rd ACM symposium on Parallel algorithms and architectures
Near-perfect Token Distribution
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Optimal deterministic approximate parallel prefix sums and their applications
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method
A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method
Higher-order linkage learning in the ECGA
Proceedings of the 14th annual conference on Genetic and evolutionary computation
A multi-parent search operator for bayesian network building
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
| Hi-index | 5.23 |
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. We present a fast, deterministic backtrack search algorithm for a p-processor COMMON CRCW-PRAM, which visits any n-node tree of height h in time O((n/p+h)(logloglogp)22). This upper bound compares favourably with a natural &Ohgr;(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.