Open zheng-da opened 10 years ago
we haven't done anything for this task yet. I think this task is still interesting. it's trying to reorder the vertices in the graph to reduce random I/O access and memory access. i think this direction has some potentials.
we should use some lightweight (linear or near linear) graph clustering algorithm to increase data locality when converting a graph to the FlashGraph format.