Login / Signup
Dynamic workload balancing deques for branch and bound algorithms in the message passing interface.
Stefano Drimon Kurz Mor
Nicolas Maillard
Published in:
Int. J. High Perform. Syst. Archit. (2011)
Keyphrases
</>
branch and bound algorithm
lower bound
branch and bound
message passing interface
set covering problem
haplotype inference
np hard
parallel algorithm
high performance computing
optimal solution
upper bound
response time
query processing
combinatorial optimization
parallel implementation
massively parallel