SoD$^2$: Statically Optimizing Dynamic Deep Neural Network
<|reference_start|>SoD$^2$: Statically Optimizing Dynamic Deep Neural Network: Though many compilation and runtime systems have been developed for DNNs in recent years, the focus has largely been on static DNNs. Dynamic DNNs, where tensor shapes and sizes and even the set of operators used are dependent upon the input and/or execution, are becoming common. This paper presents SoD$^2$, a comprehensive framework for optimizing Dynamic DNNs. The basis of our approach is a classification of common operators that form DNNs, and the use of this classification towards a Rank and Dimension Propagation (RDP) method. This framework statically determines the shapes of operators as known constants, symbolic constants, or operations on these. Next, using RDP we enable a series of optimizations, like fused code generation, execution (order) planning, and even runtime memory allocation plan generation. By evaluating the framework on 10 emerging Dynamic DNNs and comparing it against several existing systems, we demonstrate both reductions in execution latency and memory requirements, with RDP-enabled key optimizations responsible for much of the gains. Our evaluation results show that SoD$^2$ runs up to $3.9\times$ faster than these systems while saving up to $88\%$ peak memory consumption.<|reference_end|>
@article{niu2024sod$^2$:,
    title={SoD$^2$: Statically Optimizing Dynamic Deep Neural Network},
    author={Wei Niu, Gagan Agrawal, Bin Ren},
    journal={arXiv preprint arXiv:2403.00176},
    year={2024},
    doi={10.1145/3617232.3624869},
    archivePrefix={arXiv},
    eprint={2403.00176},
    primaryClass={cs.LG cs.AI cs.PL}
}