Randomized parallel branch-and-bound algorithm
Technical Report
·
OSTI ID:6140398
A new technique for the parallel execution of branch-and-bound algorithms using randomization is proposed. The algorithm requires relatively little inter-processor communication, while achieving good speedups over the uniprocessor execution times; in precisely those cases where the problem size becomes very large, randomization is found to be extremely successful in achieving very good speedups. A probabilistic model was devised to explore the effectiveness of this technique, and to estimate the expected speedups that could be obtained. The model was validated by extensive simulation work on a multiprocessor simulator. Besides being very simple to implement, the technique also ensures high reliability, flexibility, and fault tolerance.
- Research Organization:
- North Carolina State Univ., Raleigh (USA)
- OSTI ID:
- 6140398
- Report Number(s):
- AD-A-204860/1/XAB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Randomized algorithms for parallel backtracking and branch-and-bound
A randomized parallel branch-and-bound algorithm
On partitioning of algorithms for parallel execution on VLSI circuit architectures
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5173640
A randomized parallel branch-and-bound algorithm
Journal Article
·
Wed Jun 01 00:00:00 EDT 1988
· International Journal of Parallel Programming; (USA)
·
OSTI ID:5503393
On partitioning of algorithms for parallel execution on VLSI circuit architectures
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6930573