Symphony: Optimized DNN Model Serving using Deferred Batch Scheduling
Not on the map. Why?
Abstract (arXiv)
Having large batch sizes is one of the most critical aspects of increasing the accelerator efficiency and the performance of DNN model inference. However, existing model serving systems cannot achieve adequate batch sizes while meeting latency objectives as these systems eagerly dispatch requests to accelerators to minimize the accelerator idle time. We propose Symphony, a DNN serving system that explores deferred batch scheduling to optimize system efficiency and throughput. Further, unlike other prior systems, Symphony's GPU usage is load-proportional: it consolidates workloads on the appropriate number of GPUs and works smoothly with cluster auto-scaling tools. Symphony consists of two core design points. First, Symphony defines a schedulable window in which a batch of inference requests can be dispatched. This window is computed in order to improve accelerator efficiency while meeting the request's SLO. Second, Symphony implements a scalable, low-latency, fine-grained coordination scheme across accelerators to dispatch and execute requests in the schedulable window. Through extensive scheduler-only benchmarks, we demonstrate that Symphony can schedule millions of requests per second and coordinate thousands of GPUs while also enabling robust autoscaling that adapts to workload changes. Symphony outperforms prior systems by achieving 5x higher goodput when given the same number of GPUs and 60% reduction in GPUs when given the same workload.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 27 of its 50 references that are in the map. First posted on arXiv 14 Aug 2023.
Builds on
27 of 50 references.
References · 27
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
- 2015SSD: Single Shot MultiBox Detectorcited by 3,130
- 2016Xception: Deep Learning with Depthwise Separable Convolutionscited by 2,332
- 2019Searching for MobileNetV3cited by 1,994
15 more
- 2016Identity Mappings in Deep Residual Networkscited by 1,965
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
- 2016Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learningcited by 1,512
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
- 2021EfficientNetV2: Smaller Models and Faster Trainingcited by 1,135
- 2017Learning Transferable Architectures for Scalable Image Recognitioncited by 1,101
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 906
- 2016Clipper: A Low-Latency Online Prediction Serving Systemcited by 191
- 2020Serving DNNs like Clockwork: Performance Predictability from the Bottom Upcited by 120
- 2017TensorFlow-Serving: Flexible, High-Performance ML Servingcited by 85
- 2018PRETZEL: Opening the Black Box of Machine Learning Prediction Serving Systemscited by 22
- 2021Llama: A Heterogeneous & Serverless Framework for Auto-Tuning Video Analytics Pipelinescited by 16
- 2019Perseus: Characterizing Performance and Cost of Multi-Tenant Serving for CNN Modelscited by 5
- 2019DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Cachingcited by 2
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.