Back To Schedule
Monday, May 20 • 4:00pm - 4:20pm
Low-latency Job Scheduling with Preemption for the Development of Deep Learning

Sign up or log in to save this to your schedule, view media, leave feedback and see who's attending!

Efficient job scheduling of trial-and-error (TE) jobs is a challenging problem in deep learning projects. Unfortunately, existing job schedulers to date do not feature well-balanced scheduling for the mixture of TE and best-effort (BE) jobs, or they can handle the mixture in limited situations at most. To fill in this niche, we present an algorithm that efficiently schedules both TE and BE jobs by selectively preempting the BE jobs that can be, when the time comes, resumed without much delay. In our simulation study with synthetic workloads, we were able to reduce the 95th percentile of the slowdown rates for the TE jobs in the standard FIFO strategy by 96.6% while compromising the median of the BE slowdown rates by only 18.0% and the 95th percentile by only 23.9%.


Hidehito Yabuuchi

The University of Tokyo

Daisuke Taniwaki

Preferred Networks, Inc.

Shingo Omura

Preferred Networks, Inc.

Monday May 20, 2019 4:00pm - 4:20pm PDT
Lawrence/San Tomas/Lafayette Rooms

Attendees (7)