On Tue, Oct 29, 2013 at 4:08 PM, John Peterson <jwpeterson@gmail.com> wrote: 

Ben, it looks like we currently base our partitioning algorithm choice solely on the number of partitions...  Do you recall if PartGraphKway is any more memory efficient than the PartGraphRecursive algorithm?  If so, perhaps we could base our algorithm choice on the size of the mesh requested as well as the number of partitions... I might experiment with this a bit as well.

Testing the PartGraphKway algorithm now, will report back with results...

Memory usage for PartGraphKway is basically identical to that for PartGraphRecursive.

I guess it makes sense if we are allocating most of the memory up front ourselves and not much is actually being allocated by Metis itself...