Pith. sign in

REVIEW

Agon: A Scalable Competitive Scheduler for Large Heterogeneous Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.00665 v1 pith:35HPAZDO submitted 2021-09-02 cs.AR

classification cs.AR
keywords performanceagonschedulerschedulersschedulingaveragecompetitiveheterogeneous
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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).

Discussion (0). Continue with ORCID to comment.

Pith tools