SOTAVerified

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 12 of 2 papers

TitleStatusHype
Graph neural networks with configuration cross-attention for tensor compilersCode1
TpuGraphs: A Performance Prediction Dataset on Large Tensor Computational GraphsCode1
Show:102550

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1TGraphKendall's Tau0.67Unverified
2TpuGraphsKendall's Tau0.3Unverified