Graph Partition Halo Storage (GPHS)
Summary
Many ideas for performance improvements of sparse matrix vector products are based on a graph representation of the involved matrix. Partitions of this graph can help gaining performance by adapting the calculation strategy to the internal structure of the matrix. In such cases it is useful to also know the neighbors of the partitions, their halos. We want to develop a format for efficient storage and usage of the partition and halo information.
Current people
- Robert Strzodka (co-PI)