Fundamentals of algorithmics
Performances of parallel branch and bound algorithms with best-first search
Discrete Applied Mathematics
Better Algorithms for Parallel Backtracking
IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Extending software component models with the master-worker paradigm
Parallel Computing
A parallel branch-and-cut approach for detailed placement
ACM Transactions on Design Automation of Electronic Systems (TODAES)
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Hi-index | 0.00 |
In this paper we develop and implement a parallel algorithm for a real-world application: finding optimal designs for multiproduct batch plants. We describe two parallelization strategies - for systems with shared-memory and distributed-memory - based on the branch-and-bound paradigm and implement them using OpenMP (Open Multi-Processing) and MPI (Message Passing Interface), correspondingly. Experimental results demonstrate that our approach provides competitive speedup on modern clusters of multi-core processors.