“Scalable Verification of GNN-Based Job Schedulers” by Haoze Wu, Clark Barrett, Mahmood Sharif, Nina Narodytska, and Gagandeep Singh. Proceedings of the ACM on Programming Languages, vol. 6, no. OOPSLA2, Oct. 2022, pp. 1036-1065.
Recently, Graph Neural Networks (GNNs) have been applied for scheduling jobs over clusters, achieving better performance than hand-crafted heuristics. Despite their impressive performance, concerns remain over whether these GNN-based job schedulers meet users' expectations about other important properties, such as strategy-proofness, sharing incentive, and stability. In this work, we consider formal verification of GNN-based job schedulers. We address several domain-specific challenges such as networks that are deeper and specifications that are richer than those encountered when verifying image and NLP classifiers. We develop vegas, the first general framework for verifying both single-step and multi-step properties of these schedulers based on carefully designed algorithms that combine abstractions, refinements, solvers, and proof transfer. Our experimental results show that vegas achieves significant speed-up when verifying important properties of a state-of-the-art GNN-based scheduler compared to previous methods.
BibTeX entry:
@article{WBS+22,
author = {Haoze Wu and Clark Barrett and Mahmood Sharif and Nina
Narodytska and Gagandeep Singh},
title = {Scalable Verification of {GNN}-Based Job Schedulers},
journal = {Proceedings of the ACM on Programming Languages},
volume = {6},
number = {OOPSLA2},
pages = {1036--1065},
month = oct,
year = {2022},
doi = {10.1145/3563325},
url = {http://theory.stanford.edu/~barrett/pubs/WBS+22.pdf}
}
(This webpage was created with bibtex2web.)