[Coin-discuss] Cbc's great parallel performance

[Ted Ralphs]

Not to rain on Cbc's parade :), but I just wanted to make everyone
aware that there are actually a number of solvers in COIN that support
parallelism.

 * SYMPHONY is an MILP solver framework that supports multi-core,
shared, and distributed memory parallelism for relatively small
numbers of processors through OpenMP and PVM
(https://projects.coin-or.org/SYMPHONY).
 * BLIS is an MILP solver framework that is part the COIN High
Performance Parallel Search (CHiPPS) project. It is targeted towards
relatively large-scale parallelism through MPI, but we are working on
supporting multi-core and shared-memory parallelism
(https://projects.coin-or.org/CHiPPS).
 * BCP is a framework for implementing branch, cut, and price
algorithms that supports distributed memory parallelism on a
relatively small scale through MPI (https://projects.coin-or.org/Bcp).

Happy computing!

Ted

On Fri, May 8, 2009 at 5:01 PM, Sebastian Nowozin <nowozin at gmail.com> wrote:
>
> Hello everybody,
>
> there is a new MILP benchmark result at Hans Mittelmann's benchmark page,
>
>    http://plato.asu.edu/ftp/milpf.html
>
> He compares Cbc 2.3 with 1/2/4 CPUs and for most models this improves
> the solution speed quite noticably.
>
>    Good job, Cbc developers!
>
> It seems Cbc is one of the very few opensource MILP solvers which
> support parallelism, and it does a good job at it.
>
> Sebastian
>
> _______________________________________________
> Coin-discuss mailing list
> Coin-discuss at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/coin-discuss
>



-- 
Dr. Ted Ralphs
Associate Professor, Lehigh University (permanent)
Visiting Professor, University of Newcastle (current)
(610) 628-1280
ted 'at' lehigh 'dot' edu
coral.ie.lehigh.edu/~ted

Sent from Newcastle, Nsw, Australia