[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Help-glpk] GLPK re-endrant

From: xypron
Subject: Re: [Help-glpk] GLPK re-endrant
Date: Fri, 3 Jul 2009 12:31:41 -0700 (PDT)

Hello Andrew,

my understanding is that the ILOG claim of >= 1.7 times faster for
is on multicore CPUs. I suppose the majority of PCs nowadays has 2 to 4

A much more radical possibility for parallelization is offered by using the 
Graphic processor of the computer with its single instruction multiple data

For libraries see

For implementations see:

The idea here was to handle  identification of the next column/row to enter
the base using the CPU and the matrix multiplications using the GPU.

Best regards


Andrew Makhorin wrote:
>> I see two fields of applications for threading in GLPK.
>> ILOG describes that many MIPs can be solved >= 1.7 times
>> faster using multiple threads and shared memory.
> Probably if a machine has more than one cpu. However, it is a brute
> force approach. (It would help if the machine has 2^n processors, where
> n is the number of binary variables :) Try to solve gesa2 or gesa3
> from miplib without and with mir cuts. That what's I mean.

View this message in context:
Sent from the Gnu - GLPK - Help mailing list archive at

reply via email to

[Prev in Thread] Current Thread [Next in Thread]