{"status":"public","year":"2014","publisher":"IST Austria","page":"14","day":"29","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"date_published":"2014-07-29T00:00:00Z","oa":1,"file_date_updated":"2020-07-14T12:46:50Z","department":[{"_id":"KrCh"}],"citation":{"short":"K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria, 2014.","mla":"Chatterjee, Krishnendu, et al. <i>A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-300-v1-1\">10.15479/AT:IST-2014-300-v1-1</a>.","ama":"Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. <i>A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-300-v1-1\">10.15479/AT:IST-2014-300-v1-1</a>","ieee":"K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, <i>A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks</i>. IST Austria, 2014.","chicago":"Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich Schmid. <i>A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-300-v1-1\">https://doi.org/10.15479/AT:IST-2014-300-v1-1</a>.","ista":"Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria, 14p.","apa":"Chatterjee, K., Kössler, A., Pavlogiannis, A., &#38; Schmid, U. (2014). <i>A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-300-v1-1\">https://doi.org/10.15479/AT:IST-2014-300-v1-1</a>"},"month":"07","date_created":"2018-12-12T11:39:15Z","_id":"5423","doi":"10.15479/AT:IST-2014-300-v1-1","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Kössler","full_name":"Kössler, Alexander","first_name":"Alexander"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ulrich","full_name":"Schmid, Ulrich","last_name":"Schmid"}],"alternative_title":["IST Austria Technical Report"],"title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","related_material":{"record":[{"id":"1714","status":"public","relation":"later_version"}]},"publication_status":"published","abstract":[{"text":"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. ","lang":"eng"}],"oa_version":"Published Version","date_updated":"2023-02-23T10:11:15Z","type":"technical_report","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"file":[{"file_size":1270021,"content_type":"application/pdf","creator":"system","file_id":"5514","date_updated":"2020-07-14T12:46:50Z","date_created":"2018-12-12T11:53:53Z","checksum":"4b8fde4d9ef6653837f6803921d83032","access_level":"open_access","file_name":"IST-2014-300-v1+1_main.pdf","relation":"main_file"}],"pubrep_id":"300","language":[{"iso":"eng"}]}