arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.2291cs.DScs.SYeess.SY
收藏

一种用于在线调度刚截止任务自动竞争分析的框架

A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks

IST Austria (Institute of Science and Technology Austria)(奥地利科学技术研究所);Vienna University of Technology(维也纳工业大学)

Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid

AI总结:

本文提出基于多目标图的灵活框架,用于自动分析在线调度算法的竞争比,通过比较不同算法在不同任务集上的表现,揭示无一算法普遍最优的结论。

摘要:

我们提出一种灵活的框架,用于基于多目标图的在线调度算法的自动竞争分析:给定一个任务集和一个指定为标记转移系统的在线调度算法,以及一些可选的安全性、活性和/或极限平均约束,我们自动计算该算法相对于clairvoyant调度器的竞争比。我们通过比较几种过去提出的在线算法(包括$D^{over}$)在不同任务集上的竞争比,展示了该方法的灵活性和强大性。我们的实验结果揭示,这些算法在某些任务集上并非最优,其他调度器能提供更好的性能。因此,该框架成为选择给定应用最优算法的有用设计工具。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑