Lenfers, Johannes; Spehr, Sven; Dieckmann, Justus; Jansen, Johannes; Lücke, Martin Paul; Gorlatch, Sergei
Research article in edited proceedings (conference) | Peer reviewedThis paper introduces Schedgehammer, a general-purpose auto-scheduling framework that optimizes program execution across diverse compiler infrastructures. Unlike existing auto-schedulers that are tightly coupled to specific intermediate representations or rely on template-based search, Schedgehammer provides a generic, reusable framework for optimization schedules by modeling them as graph-structured objects. This approach captures dependencies among transformations and parameters across compilers, enabling systematic mutation and validation. We demonstrate Schedgehammer’s flexibility on TVM and TACO, showing that it effectively optimizes dense and sparse computations. Across benchmarks, it achieves performance comparable to specialized auto-schedulers such as Ansor, highlighting that a unified, extensible abstraction can generalize scheduling beyond individual compiler ecosystems.
| Gorlatch, Sergei | Professorship of Practical Comupter Science (Prof. Gorlatch) Institute of Computer Science |
| Lenfers, Johannes | Institute of Computer Science Professorship of Practical Comupter Science (Prof. Gorlatch) |
| Lücke, Martin | Institute of Computer Science |