Contract scheduling is a general technique that allows to design a system with interruptible capabilities, given an algorithm that is not necessarily interruptible. Previous work on this topic has largely assumed that the interruption is a worst-case deadline that is unknown to the scheduler. In this work, we study the setting in which there is a potentially erroneous prediction concerning the interruption. Specifically, we consider the setting in which the prediction describes the time that the interruption occurs, as well as the setting in which the prediction is obtained as a response to a single or multiple binary queries. For both settings, we investigate tradeoffs between the robustness (i.e., the worst-case performance assuming adversarial prediction) and the consistency (i.e, the performance assuming that the prediction is error-free), both from the side of positive and negative results.

翻译：合同时间安排是一种一般技术,它允许设计一个具有中断能力的系统,因为算法不一定可以中断。以前关于这个专题的工作基本上假定中断是一个最坏的最后期限,排程者不知道。在这个工作中,我们研究了对中断作出可能错误的预测的背景。具体地说,我们考虑了预测描述中断发生时间的背景,以及作为单一或多个二进制查询的响应而获得预测的环境。在这两种情况下,我们从正反两方面对立预测的角度,对稳健性(即假设对抗性预测的最坏的性能)和一致性(即假设预测是无误的性能)之间的权衡进行了研究。