Working on scaling test
Need to fix missing node lists in domain (when loaded from disk
Just need to write out the O and R by rank
Metis domain properly constructing O_by_rank and R_by_rank
Clean test
Updated norms in spmv test to compute subset per proc
Fixed bug in norms
Fixed norms for spmv test
Scaling test ready for CPU scaling
Cleanup
Using a simpler interface to boost graph for undirected adjacency graphs. Hopefully it will perform better (this was a bottleneck in previous versions)
Previous fix on adjacency_matrix resulted in a dense matrix. This fix (adjacency_list) uses a sparse representation and enforces the undirected property
awk '$0="line"NR": "NF' metis_stencils.graph | sort -n -k 2 | head  (or
tail) to get the least and most connected nodes in the graph. For 1M
nodes on a regular grid I get ~166 as the highest degree of
connectivity.