We used to do this, and Daniel noticed that it wasn't really threadsafe. I don't know the current status of this. At some point he said it didn't make any difference after he got the delayed insertion working.
I didn't check carefully, but maybe he stores it in the final heap location now. But I'm not sure. I'll ask him when I get a chance. [2] [2] https://github.com/wbhart/flint2/blob/trunk/mpoly.h (lines 582 ff.) On Tuesday, 26 September 2017 10:12:23 UTC+2, parisse wrote: > > I found a way to get better timings by caching the index of the insertion > chain of the previous monomial. But now multi-threaded execution is slower > than 1 thread execution most certainly because of locks during insertion... > I will probably force 1 thread sparse multiplication. > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
