Runtime ranking
1 benchmarks0 papers
Ranking of computational graph configurations by their runtime. The task assumes a set of computational graphs, each having a set of node and/or edge configurations and corresponding scalar execution runtimes. The task is to rank the configurations by their runtime for each graph individually.