arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.01374cs.PFcs.DS
收藏

提高过载实时的系统中的奖励

Improving rewards in overloaded real-time systems

Sathish Gopalakrishnan

摘要:

在线算法的竞争分析通常被应用于理解实时的【形】系统在过载条件下的行为。虽然竞争分析提供了对某些算法的行为的洞察,但很难对这些算法在实践中的性能做出推断。其他处理过载的方法诉诸于似乎表现良好但很难证明是好的方法。此外,在实时的【形】系统中处理过载的大多数工作不考虑使用关于作业的到达率和执行时间的分布的信息来做出调度决策。我们提出了一个调度策略(通过随机近似,并使用有关的工作量的信息),以处理在实时的【形】系统过载,并提高收入时,每个成功的工作完成的结果在收入应计。我们证明,我们概述的政策确实会导致增加收入相比,一类的调度政策,使静态资源分配到不同的服务类别。我们还使用经验证据来强调这样一个事实,即这种政策比其他各种调度政策表现更好。所提出的思想可以应用到几个软实时的【形】系统,特别是多服务类的系统。

英文摘要:

Competitive analysis of online algorithms has commonly been applied to understand the behaviour of real-time systems during overload conditions. While competitive analysis provides insight into the behaviour of certain algorithms, it is hard to make inferences about the performance of those algorithms in practice. Other approaches to dealing with overload resort to heuristics that seem to perform well but are hard to prove as being good. Further, most work on handling overload in real-time systems does not consider using information regarding the distribution of arrival rates of jobs and execution times to make scheduling decisions. We present an scheduling policy (obtained through stochastic approximation, and using information about the workload) to handle overload in real-time systems and improve the revenue earned when each successful job completion results in revenue accrual. We prove that the policy we outline does lead to increased revenue when compared to a class of scheduling policies that make static resource allocations to different service classes. We also use empirical evidence to underscore the fact that this policy performs better than a variety of other scheduling policies. The ideas presented can be applied to several soft real-time systems, specifically systems with multiple service classes.

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

↑