Home/ Questions/Q 904493
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-15T16:03:36+00:00

I’m looking to implement ‘branch and bound’ over a cluster (like Amazon’s say), as

  • 0

I’m looking to implement ‘branch and bound’ over a cluster (like Amazon’s say), as I want it to be horizontally scalable, not limited to a single CPU. There’s a paper “Task Pool Teams: A Hybrid Programming Environment for Irregular Algorithms on SMP Clusters” by Judith Hippold and Gudula Runger. It’s basically a bottom-up, task-stealing framework like Intel’s TBB, except for ad-hoc networks instead of shared memory. If this library was available I’d use it (replacing the local, threaded part with TBB). Unfortunately they don’t seem to have made it available for download anywhere that I could find, so I wonder are there other implementations, or similar libraries out there?

It doesn’t look like Microsoft’s Task Parallel Library has the equivalent, either, to steal from.

(I tried to make a tag ‘taskpool’ after ‘threadpool’, the most-used variant (before ‘thread-pool’) but, didn’t have enough points. Anyone heavy enough think it’s worth adding?)

edit:

I haven’t tried it yet, but it PEBBL (under here: software.sandia.gov/trac/acro/wiki/Packages) claims to scale really high. The paper that the answerer mentions from the Wiley book ‘Parallel Branch-and-Bound Algorithms’, Crainic, Le Cun and Roucairol, 2006, from “Parallel Combinatorial Optimization”, 2006 edited by El-Ghazali Talbi was where I found it, and there are other libraries listed; some may be better, I reserve the right to update this :). Funny that Google didn’t find these libs, either my Googling was weak or Google itself fails to be magic sometimes.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    When you say “over a cluster” it sounds like you mean distributed memory, and parallelizing branch and bound is a notoriously difficult problem for distributed memory – at least in a way that guarantees scalability. The seminal paper on this topic is available here, and there’s an excerpt from a Wiley book on the topic here.

    Shared memory branch is bound is an easier problem because you can implement a global task queue. A good high level description of how to do both shared memory and message passing implementations is available here. If nothing else, the references section is worth purusing for ideas and existing implementations.

    • 0