English

PREMA: A Predictive Multi-task Scheduling Algorithm For Preemptible Neural Processing Units

Distributed, Parallel, and Cluster Computing 2019-09-11 v1 Machine Learning Neural and Evolutionary Computing

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.8x, 1.4x, and 4.8x improvement in latency, throughput, and SLA satisfaction, respectively.

Keywords

Cite

@article{arxiv.1909.04548,
  title  = {PREMA: A Predictive Multi-task Scheduling Algorithm For Preemptible Neural Processing Units},
  author = {Yujeong Choi and Minsoo Rhu},
  journal= {arXiv preprint arXiv:1909.04548},
  year   = {2019}
}
R2 v1 2026-06-23T11:11:13.750Z