Ragnarok : RAndom Graphs Never ARe OK

@inproceedings{Jablin2010RagnarokR,
  title={Ragnarok : RAndom Graphs Never ARe OK},
  author={James A. Jablin and Maurice Herlihy},
  year={2010}
}
Many researchers test graph scheduling algorithms on “random” graphs. We show that many of the random graphs used in the literature are not representative of actual programs by comparing random graphs to graphs derived from the SPECINT2000 benchmarks. We introduce Ragnarok (RAndom Graphs Never ARe OK), a new graph benchmark suite embodying characteristics of SPECINT2000 programs. We hope this benchmark suite will be used instead of random graphs.