Runtime ranking
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.
Papers
Showing 1–2 of 2 papers