Adaptive Scheduling of Data Paths using Uppaal Tiga
Israa AlAttili (Radboud University Nijmegen), Fred Houben (Radboud, University Nijmegen), Georgeta Igna (Radboud University Nijmegen), Steffen, Michels (Radboud University Nijmegen), Feng Zhu (Radboud University, Nijmegen), Frits Vaandrager (Radboud University Nijmegen)

TL;DR
This paper demonstrates the use of Uppaal Tiga to automatically generate adaptive scheduling strategies for an industrial image processing pipeline, addressing uncertainty in job arrivals with timed automata technology.
Contribution
First application of timed automata-based adaptive scheduling to an industrial problem with uncertain job arrivals.
Findings
Successfully computed adaptive schedules for the printer pipeline
Demonstrated the effectiveness of Uppaal Tiga in handling uncertainty
Pioneered the use of timed automata in industrial scheduling
Abstract
We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a printer. As far as we know, this is the first application of timed automata technology to an industrial scheduling problem with uncertainty in job arrivals.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Formal Methods in Verification · Optimization and Search Problems
