pith. sign in

arxiv: 2109.00665 · v1 · pith:35HPAZDOnew · submitted 2021-09-02 · 💻 cs.AR

Agon: A Scalable Competitive Scheduler for Large Heterogeneous Systems

classification 💻 cs.AR
keywords performanceagonschedulerschedulersschedulingaveragecompetitiveheterogeneous
0
0 comments X
read the original abstract

This work proposes a competitive scheduling approach, designed to scale to large heterogeneous multicore systems. This scheduler overcomes the challenges of (1) the high computation overhead of near-optimal schedulers, and (2) the error introduced by inaccurate performance predictions. This paper presents Agon, a neural network-based classifier that selects from a range of schedulers, from simple to very accurate, and learns which scheduler provides the right balance of accuracy and overhead for each scheduling interval. Agon also employs a de-noising frontend allowing the individual schedulers to be tolerant towards noise in performance predictions, producing better overall schedules. By avoiding expensive scheduling overheads, Agon improves average system performance by 6\% on average, approaching the performance of an oracular scheduler (99.1% of oracle performance).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.