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.
几个研究得很好的在线资源分配问题可以用无穷的、递增的正值序列来表示,其中每个元素都与相应的分配值相关联。例子包括诸如在线投标、在无界线上搜索隐藏目标以及基于重复执行设计可中断算法等问题。在线算法的性能,在这些问题中的每一个,是衡量的竞争比,它描述了乘法的性能损失,由于缺乏充分的信息的情况下的实例。我们研究这样的竞争性排序问题的设置中,在线算法有一些(潜在的)错误的信息,表示为一个$k$位的建议字符串,对于一些给定的$k$。我们首先考虑[Angelopoulos et al,ITCS 2020]的不可信建议设置,其中目标是考虑两个极端来量化性能:建议是无错误的,或者它是由(恶意)对手生成的。在这里,我们展示了一个帕累托最优的解决方案,使用一种新的方法来应用基于函数的下限技术,由于[Gal,以色列数学杂志。1972]。接下来,我们研究一个新生的噪声建议设置,其中许多建议位可能是错误的;在线算法不知道确切的错误,它只能获得悲观估计(即,此错误的上限)。我们给出了改进的上界,但也在此设置中的在线问题的竞争比的第一个下界。为此,我们结合了强大的基于查询的数组搜索和容错合同调度的想法。最后,我们演示了如何将上述技术应用于鲁棒优化而无需预测,并讨论了它们如何适用于更一般的在线问题。