no code implementations • 8 Sep 2014 • Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid
We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a taskset and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w. r. t.
Data Structures and Algorithms Systems and Control
