Graph500

Algorithm

Version {reference}

  • Asynchronous BFS
  • 1-d partition.
Profiling
  • 
    

Version x

  • Level-synchronized BFS.
  • Use 1-d partiton to distribute the graph.
  • Convert CSR to CSC.
  • Synchronize each level using All-to-all.
  • Implementation is based on MPI.
Profiling
  • 
    

Version y

  • Level-synchronized bottom-up BFS.
  • Use CSR.
  • Bitmap tracking global frontier.
  • Filter duplicated edges.
Profiling
  • 
    

Code

Implementation goes in graph500-2.1.4\mpi\src.