PREMA: A Predictive Multi-Task Scheduling Algorithm For Preemptible Neural Processing Units
Authors:
- 1 February 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 220-233
Abstract
To amortize cost, cloud vendors providing DNN acceleration as a service to end-users employ consolidation and virtualization to share the underlying resources among multiple DNN service requests. This paper makes a case for a "preemptible" neural processing unit (NPU) and a "predictive" multi-task scheduler to meet the latency demands of high-priority inference while maintaining high throughput. We evaluate both the mechanisms that enable NPUs to be preemptible and the policies that utilize them to meet scheduling objectives. We show that preemptive NPU multi-tasking can achieve an average 7.8×, 1.4×, and 4.8× improvement in latency, throughput, and SLA satisfaction, respectively.Keywords
All Related Versions
This publication has 36 references indexed in Scilit:
- CambriconACM SIGARCH Computer Architecture News, 2016
- EyerissACM SIGARCH Computer Architecture News, 2016
- NeurocubeACM SIGARCH Computer Architecture News, 2016
- EIEACM SIGARCH Computer Architecture News, 2016
- BaymaxACM SIGARCH Computer Architecture News, 2016
- TABLA: A unified template-based framework for accelerating statistical machine learning2016
- Going deeper with convolutions2015
- DaDianNao: A Machine-Learning Supercomputer2014
- Enabling preemptive multiprogramming on GPUs2014
- DianNaoACM SIGPLAN Notices, 2014