--- res: bibo_abstract: - '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. a clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including D(over), that have been proposed in the past, for various tasksets. Our experimental results reveal that none of these algorithms is universally optimal, in the sense that there are tasksets where other schedulers provide better performance. Our framework is hence a very useful design tool for selecting optimal algorithms for a given application. @eng' bibo_authorlist: - foaf_Person: foaf_givenName: Krishnendu foaf_name: Chatterjee, Krishnendu foaf_surname: Chatterjee foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-4561-241X - foaf_Person: foaf_givenName: Alexander foaf_name: Kössler, Alexander foaf_surname: Kössler - foaf_Person: foaf_givenName: Andreas foaf_name: Pavlogiannis, Andreas foaf_surname: Pavlogiannis foaf_workInfoHomepage: http://www.librecat.org/personId=49704004-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-8943-0722 - foaf_Person: foaf_givenName: Ulrich foaf_name: Schmid, Ulrich foaf_surname: Schmid bibo_doi: 10.15479/AT:IST-2014-300-v1-1 dct_date: 2014^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/2664-1690 dct_language: eng dct_publisher: IST Austria@ dct_title: A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks@ ...