Setting default algorithm to discover the communication graph

[JordiManyer]

The current default algorithm to discover non-symmetric communication graphs is based on a gather-scatter algorithm. This works great for small communicators, but becomes prohibitive for large problems. The other available algorithm works great, and greatly reduces the amount of memory needed on the master processor.

Although there is technically a way to choose which algorithm you are using, it is extremely tedious and you have to go very low-level to actually be able to change it.
The option I've been using is to overwrite the default_find_rcv_ids function on my packages, but this breaks precompilation and is nothing more than a hack.

Due to this, I propose adding a compile-time preference through the Julia-standard Preferences.jl package. This changes the default behaviour of PartitionedArrays and sets the other algorithm as default.

The changes have zero impact on performance, since everything is done at compile time by using @static if-else statements.

Let me know what you think @fverdugo

[fverdugo]

Hi @JordiManyer,

Is is going to generate a Preferences.Toml file if a user does nothing?

[JordiManyer]

Hi @fverdugo , not at all. The local file only gets created if the defaults get changed, like for MPI.jl. Otherwise the package bahaviour is unchanged and the user does not notice.

[fverdugo]

Good!

Can you then fix the documentation? It is failing to build.

[JordiManyer]

Yes, Ill do some final changes if you are happy with the overall concept. Some questions:

• Any comments/preferences on the function names?

• Do you want to keep this like it is in a separate file? Where do I put the documentation?