Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Load Balancing in a Network of Transputers
Proceedings of the 2nd International Workshop on Distributed Algorithms
Dynamic tree embeddings in butterflies and hypercubes
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Optimal speedup for backtrack search on a butterfly network
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Branch-and-bound and backtrack search on mesh-connected arrays of processors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
An atomic model for message-passing
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Space-efficient scheduling of multithreaded computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Taking random walks to grow trees in hypercubes
Journal of the ACM (JACM)
Randomized parallel algorithms for backtrack search and branch-and-bound computation
Journal of the ACM (JACM)
Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Tight analyses of two local load balancing algorithms
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Scheduling threads for low space requirement and good locality
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
A Design Methodology for Data-Parallel Applications
IEEE Transactions on Software Engineering - Special issue on architecture-independent languages and software tools parallel processing
The data locality of work stealing
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Random Seeking: A General, Efficient, and Informed Randomized Scheme for Dynamic Load Balancing
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Architecture independent parallel selection with applications to parallel priority queues
Theoretical Computer Science
Adaptive work stealing with parallelism feedback
Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Decentralized load balancing for highly irregular search problems
Microprocessors & Microsystems
Adaptive work-stealing with parallelism feedback
ACM Transactions on Computer Systems (TOCS)
Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees
Journal of Parallel and Distributed Computing
High performance subgraph mining in molecular compounds
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Evaluations of hash distributed A* in optimal sequence alignment
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
We present a universal randomized method called Local Best-First Search for parallelizing sequential branch-and-bound algorithms. The method executes on a message-passing multiprocessor system, and requires no global data structures or complex communication protocols. We show that, uniformly on all instances, the execution time of the method is unlikely to exceed a certain inherent lower bound by more than a constant factor.