Re: handling several substacks ?

[Bill Allombert <allomber@math.u-bordeaux.fr>]

On Wed, Feb 05, 2014 at 12:20:04PM +0100, Karim Belabas wrote:
> * Bill Allombert [2014-02-05 11:49]:
> > On Wed, Feb 05, 2014 at 10:52:13AM +0100, Pascal Molin wrote:
> > > I have to deal with the following kind of loops:
> > >   {
> > >     /* main loop */
> > >     pari_sp av1 = avma, lim1 = stack_lim(avma, 1);
> > >     long n;
> > >     for (n = 1; n <= N; ++n)
> > >     {
> > >         long i, j, k;
> > >         i = random_Fl(L)+1;
> > >         j = random_Fl(L)+1;
> > >           for (k = 1; k <= K; ++k)
> > >           {
> > >             gel(gel(a, i), k) = gmul( gel(gel(a, j), k), gel(gel(m, i), k));
> > >             if (avma > lim1)
> > >               a = gerepilecopy(av1, a);
> [...]
> > Try the new C file in attachment.
> > 
> > ? gploop()
> > time = 2,280 ms.
> > %4 = 0
> > ? cloop()
> > time = 1,028 ms.
> > %5 = 0
> 
> To compare with Bill's implementation of the recommanded approach,
> here's the complete version using clones (cloop2).
> 
> (12:00) gp > cloop(50000,1000,8)
> time = 15,912 ms.
> 
> (12:00) gp > cloop2(50000,1000,8)
> time = 23,688 ms.
> 
> (12:00) gp > gploop(50000,1000,8)
> time = 35,580 ms.
> 
> So the recommanded way is a clear winner in ordinary situations. As expected,
> clones are less efficient (here we use them in the simplest
> possible way, and do little useful work, so their overhead is large).
> 
> But thay have a much better worse case behaviour: in "desperation mode,
> when too little memory was available to start with, low_stack will be
> triggered frequently; in the worse case, each scalar operation triggers
> a gerepilecopy of the full array...

But this assumes there is extra memory available for the clone,
in which case it would be possible to use a larger stack.

Cheers,
Bill.