Papers with Code · CC BY-SA 4.0

Runtime ranking

2 평가 기록 1 datasets

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.

데이터셋

1개