Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
DIB—a distributed implementation of backtracking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Superlinear speedup for parallel backtracking
Proceedings of the 1st International Conference on Supercomputing
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Communication complexity for parallel divide-and-conquer
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
An adaptive granularity control algorithm for the parallel execution of functional programs
Future Generation Computer Systems
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
Parallel logic programming systems
ACM Computing Surveys (CSUR)
Studying overheads in massively parallel MIN/MAX-tree evaluation
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Thread scheduling for multiprogrammed multiprocessors
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
An inherent bottleneck in distributed counting
Journal of Parallel and Distributed Computing - Parallel and distributed data structures
Better Algorithms for Parallel Backtracking
IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Scheduling Algorithms for Strict Multithreaded Computations
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Parallel Crew Scheduling on Workstation Networks Using PVM
Proceedings of the 4th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Parallel discovery of network motifs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Many applications in parallel processing have to traverse large, implicitly defined trees with irregular shape. The receiver initiated load balancing algorithm random polling has long been known to be very efficient for these problems in practice. For any Ɛ 0, we prove that its parallel execution time is at most (1+Ɛ)Tseq/P+O(Tatomic+h(1/Ɛ+Trout+ Tsplit)) with high probability, where Trout, Tsplit and Tatomic bound the time for sending a message, splitting a subproblem and finishing a small unsplittable subproblem respectively. The maximum splitting depth h is related to the depth of the computation tree. Previous work did not prove efficiency close to one and used less accurate models. In particular, our machine model allows asynchronous communication with nonconstant message delays and does not assume that communication takes place in rounds. This model is compatible with the LogP model.