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.

中文翻译：

---

具有预测的合同调度

合同调度是一种通用技术，它允许设计具有可中断功能的系统，前提是算法不一定是可中断的。以前有关该主题的工作在很大程度上假设中断是最坏情况的截止日期，调度程序不知道该截止日期。在这项工作中，我们研究了有关中断的潜在错误预测的设置。具体而言，我们考虑预测描述描述中断发生时间的设置，以及获取预测作为对单个或多个二进制查询的响应的设置。对于这两种设置，我们都研究了鲁棒性（即，在进行对抗性预测的情况下的最坏情况下的性能）和一致性（即在进行无错误预测的性能下）之间的权衡，