search

olexandr-konovalov / gnu

Crowdsourcing project for the database of numbers of isomorphism types of finite groups
MIT License
11 stars 4 forks source link

Adding time-consuming cubefree orders n>50000 to the database #30

Open olexandr-konovalov opened 8 years ago

olexandr-konovalov commented 8 years ago

Starting from n > 50000, we can notice that some cube-free orders may require substantial runtime (see http://www.gap-system.org/Manuals/pkg/cubefree/htm/CHAP002.htm#SECT002 explaining the details).

After #14 will be implemented, we could start to identify time-consuming cube-free cases and save gnu(n) for them in a new data file data/cubefree.g (could be auto-generated, and this process could be parallelised with SCSCP master-worker skeleton).

olexandr-konovalov commented 8 years ago

As I wrote in http://math.stackexchange.com/questions/1761566/, this is feasible. I've calculated this for 1 <= n <= 10^5 using ParListWithSCSCP (see here) with one master and 48 workers. This is an embarrassingly parallel calculation, and it took about half an hour on a 64-core Linux server with AMD Opteron 6375 1400MHz CPUs.

olexandr-konovalov commented 8 years ago

We may even have data/cubefree.g with numbers of cubrefree groups for [1..50000] as well, but computed with different approaches (see http://www.gap-system.org/Manuals/pkg/cubefree/htm/CHAP002.htm) - many ideas for cross-checks for cube-free groups are coming from here.