arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.11291cs.DScs.AI
收藏

多问题求解的可中断算法

Interruptible Algorithms for Multiproblem Solving

Sorbonne Université(索邦大学);CNRS(法国国家科学研究中心);Laboratoire d’informatique de Paris 6(巴黎第六大学计算机实验室)

Spyros Angelopoulos, Alejandro Lopez-Ortiz

摘要:

在本文中,我们解决的问题,设计一个可中断的系统中的设置,其中$n$问题的实例,都同样重要,必须同时解决。该系统涉及调度执行合同算法(它提供了允许的计算时间和解决方案的质量之间的权衡)在m个相同的并行处理器。发生中断时,系统必须向每个$n$问题实例报告解决方案。然后,将该输出的质量与最佳可能算法进行比较,该最佳可能算法具有中断时间的预知,并且同样必须产生所有$n$问题实例的解决方案。这扩展了在中断时只查询一个问题实例的经过充分研究的设置。在这项工作中,我们首先介绍了新的措施,在这种情况下,可中断系统的性能评估。特别是,我们提出的不足之处的时间表作为性能指标,满足手头的问题的要求。然后,我们提出了一个时间表,其性能,我们证明是在一个小的因素,从最佳的一般,多处理器设置。我们还展示了几个下界的不足,在一个单一的处理器上的时间表。更确切地说,我们证明了一般的下界(n+1)/n,两个问题设置(n=2)的改进的下界,和严格的下界类的循环调度。我们的技术也可以产生一个更简单的,替代证明的主要结果[伯恩斯坦等人,IJCAI 2003]关于多处理器环境中的循环调度的性能。

英文摘要:

In this paper we address the problem of designing an interruptible system in a setting in which $n$ problem instances, all equally important, must be solved concurrently. The system involves scheduling executions of contract algorithms (which offer a trade-off between allowable computation time and quality of the solution) in m identical parallel processors. When an interruption occurs, the system must report a solution to each of the $n$ problem instances. The quality of this output is then compared to the best-possible algorithm that has foreknowledge of the interruption time and must, likewise, produce solutions to all $n$ problem instances. This extends the well-studied setting in which only one problem instance is queried at interruption time. In this work we first introduce new measures for evaluating the performance of interruptible systems in this setting. In particular, we propose the deficiency of a schedule as a performance measure that meets the requirements of the problem at hand. We then present a schedule whose performance we prove that is within a small factor from optimal in the general, multiprocessor setting. We also show several lower bounds on the deficiency of schedules on a single processor. More precisely, we prove a general lower bound of (n+1)/n, an improved lower bound for the two-problem setting (n=2), and a tight lower bound for the class of round-robin schedules. Our techniques can also yield a simpler, alternative proof of the main result of [Bernstein et al, IJCAI 2003] concerning the performance of cyclic schedules in multiprocessor environments.

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

↑