How to parallel run the GAP command ConjugacyClassesSubgroups(g);?

Question

I want to find the subgroups of a finite group. When the group is getting larger, the amount of time is increasing. So I want to put in a supercomputer to get the result and run it in parallel.

The command is just ConjugacyClassesSubgroups(g);

Answer 1

There is no parallel implementation of this, and the multithreaded version of GAP is still in the experimental state. When it will appear, it would provide a platform to develop such implementations, but they still would have to appear. So if you need the result today or tomorrow, you need to think about other approaches.

To start with, look at "How do I get the subgroups of my group?" from the GAP F.A.Q. Some of the questions to consider:

• Is the most appropriate function being used? Quite often GAP users assume that AllSubgroups is what they need, but (as its documentation says) it is only suitable for small examples used mainly for teaching purposes (see also this answer. Instead, one should use ConjugacyClassesSubgroups, or even more restrictive functions to look only for e.g. maximal subgroups or normal subgroups - see the GAP F.A.Q. for further hints.

• What is the representation of your group? Some groups first have to be converted to an isomorphic permutation group using IsomorphismPermGroup or to a pc group using IsomorphismPcGroup, and then GAP may be able to handle them much faster.

---

Wrote an answer based on my earlier comments to remove this from the unanswered queue