On Thu, Mar 31, 2016 at 1:27 PM, H.J. Lu wrote:
> On Wed, Mar 30, 2016 at 5:11 AM, Bin.Cheng wrote:
>> On Wed, Mar 30, 2016 at 9:09 AM, Richard Biener
>> wrote:
>>> On Thu, Mar 24, 2016 at 6:26 PM, Bin Cheng wrote:
Hi,
Quite lot of time is used when IVOPT computes cost for pairs.
>
On Wed, Mar 30, 2016 at 5:11 AM, Bin.Cheng wrote:
> On Wed, Mar 30, 2016 at 9:09 AM, Richard Biener
> wrote:
>> On Thu, Mar 24, 2016 at 6:26 PM, Bin Cheng wrote:
>>> Hi,
>>> Quite lot of time is used when IVOPT computes cost for pairs.
>>> As a matter of fact, some pairs are very similar to e
On Wed, Mar 30, 2016 at 9:09 AM, Richard Biener
wrote:
> On Thu, Mar 24, 2016 at 6:26 PM, Bin Cheng wrote:
>> Hi,
>> Quite lot of time is used when IVOPT computes cost for pairs.
>> As a matter of fact, some pairs are very similar to each other, and we can
>> abstract and compute cost only on
On Thu, Mar 24, 2016 at 6:26 PM, Bin Cheng wrote:
> Hi,
> Quite lot of time is used when IVOPT computes cost for pairs. As
> a matter of fact, some pairs are very similar to each other, and we can
> abstract and compute cost only once for these pairs. This is a patch doing
> so, the idea is
Hi,
Quite lot of time is used when IVOPT computes cost for pairs. As a
matter of fact, some pairs are very similar to each other, and we can abstract
and compute cost only once for these pairs. This is a patch doing so, the idea
is skipping cost computation for sub-uses in each group, of cour