>
>
> In https://trac.sagemath.org/ticket/27444 we are exposing the parallel
> versions (using OpenMP) of
> fflas-ffpack routines used in SageMath. This is only about multicore
> parallelism, based on OpenMP.
>
> +1 to having multicore linear algebra in Sage. I have hacked together some
On Thursday, 21 March 2019 22:48:08 UTC-6, Kwankyu Lee wrote:
>
>
>
> On Friday, March 22, 2019 at 12:56:58 AM UTC+9, Andrey Novoseltsev wrote:
>>
>> "languages" for SageMathCell are very different from kernels for Jupyter.
>> SageMathCell keeps a bunch of preforked kernels (all are the same)
>>
On Fri, 22 Mar 2019, Ai Bo wrote:
> With 12, I can't write to a file, it is at least 1500G. I can write to a
> file up to around 300G at most.
> That is why I am thinking how to divide the output of "geng 12". So
> far, I don't have any idea. Any suggestion?
You can (and should) use A/B
On Friday, March 22, 2019 at 3:00:54 AM UTC-7, Dima Pasechnik wrote:
>
>
> I would not mind to see not loading abs_integrate by default, and
> modifications to examples and tests
> to explicitly load abs_integrate before running affected examples...
>
> See:
It is very true that I am not familiar with geng, nor sagemath. I just
installed on my machine a few days ago.
The reason I want to modify geng.c is I don't have a way to partition the
output of "geng 12". I have finished up to "geng 11" so far, mostly with
manual work. I know how many "geng
Thank you!
I have resolved for up to "geng 11". It is the 12 that I need a solution. I
am aware how many graphs it generates.
I used multi-core manually, i.e., I launched multiple(24) geng program on a
24-core machine.
There is no doubt that geng is much faster than using sagemath's
PS: an example of use of Parallelism() is
http://doc.sagemath.org/html/en/reference/manifolds/sage/manifolds/differentiable/affine_connection.html#sage.manifolds.differentiable.affine_connection.AffineConnection.riemann
Le vendredi 22 mars 2019 14:36:10 UTC+1, Eric Gourgoulhon a écrit :
>
> Hi,
>
Hi,
Regarding your question 3:
Le vendredi 22 mars 2019 11:15:04 UTC+1, Clement Pernet a écrit :
>
> 3. What interface do we want for the sage user who wants to
>
>3a switch between sequential and parallel,
>
>3b specify the number of cores to be used ?
>
> Should there be some kind
On Thu, 21 Mar 2019, Simon King wrote:
> Does either of you plan to open a ticket and make the functionality
> available, that according to Jori is present in nauty but according
> to Ai isn't wrapped in Sage?
At least I do not.
--
Jori Mäntysalo
Tampereen yliopisto - Ihminen ratkaisee
--
Hi,
May be what openblas is doing could be inspiring.
Openblas (I hope it did not changed, I have tested this sometime ago)
allows to use the number of thread defined for open_mp (by setting an
environment variable or by program), and also to specify the number of
threads for openblas. This is
Hi,
In https://trac.sagemath.org/ticket/27444 we are exposing the parallel versions (using OpenMP) of
fflas-ffpack routines used in SageMath. This is only about multicore parallelism, based on OpenMP.
We would like to discuss on the best design to expose them to the end user:
1. Should the
On Wed, Mar 20, 2019 at 1:37 PM Dima Pasechnik wrote:
>
> On Wed, Mar 20, 2019 at 1:27 PM mmarco wrote:
> >
> > So the bug is really in the abs_integrate package for maxima? In that case:
> > is it really worth it to import it by default?
>
> removing it makes 7 tests fail in
Great!! My schedule is finally flexible enough this year!
Looking forward to the dates. Is there going to be funding avaialble for
students, postdoc from ODK?
Best,
J-P
Le dimanche 17 mars 2019 09:02:05 UTC+1, Nicolas M. Thiéry a écrit :
>
>Hello,
>
> I am planning to organize this
OK, more explanation.
* * *
First I compare time for generating graphs in Nauty and in Sage. As plain
graphs(n) uses nauty, I have test.sage containing
print(sum(1 for _ in graphs(9)))
It takes about 11½ seconds to run. I tested this with
time ./sage test.sage
Then,
./local/bin/geng 9 >
Hi David,
On 2019-03-22, David Coudert wrote:
> Our interface to nauty geng is in Python, but the difficulty is not here.
>
>- It takes time to build graphs from graph6 strings, and also to build
>Sandpiles (12 for each graph)
>- The number of biconnected graphs with 12 nodes is
On Thu, 21 Mar 2019 at 18:42, Ai Bo wrote:
> I found it. Thank you.
> I also tried the command listed above.
> I am confused. Where is this "I]~~w"?
> Is it a file? How did Graph load this?
>
> In my program, my code looks like this:
> i=12
> for G in graphs.nauty_geng(str(i) + " -C"):
>
Thu 2019-03-21 18:47:37 UTC, Dima Pasechnik:
>
> Ideally one should create a fast interface from Python
> to geng, probably using Cython, if it is not already done.
PyNauty is discussed at
- Sage Trac ticket 25506:
Nauty interface for isomorphism checking and automorphism group computing
If you want to use the command that Jori gave in Sage, you can use the fact
that nauty_geng just runs geng and appends the option string after the
command. So if you want to generate the last three graphs that are returned
by geng for biconnected graphs on 10 vertices you can do this:
for g in
Why would you want to modify geng.c? From your previous comments I get the
impression that you are not familiar with the algorithm that geng uses.
You're not even familiar with the way geng encodes graphs. In that case it
is almost guaranteed that you will break something if you modify it.
So
Our interface to nauty geng is in Python, but the difficulty is not here.
- It takes time to build graphs from graph6 strings, and also to build
Sandpiles (12 for each graph)
- The number of biconnected graphs with 12 nodes is huge: 153.620.333.545
See https://oeis.org/A002218
20 matches
Mail list logo
