Motivated by recent work on scheduling with predicted job sizes, we consider the performance of scheduling algorithms with minimal advice, namely a single bit. Besides demonstrating the power of very limited advice, such schemes are quite natural. In the prediction setting, one bit of advice can be used to model a simple prediction as to whether a job is "large" or "small"; that is, whether a job is above or below a given threshold. Further, one-bit advice schemes can correspond to mechanisms that tell whether to put a job at the front or the back for the queue, a limitation which may be useful in many implementation settings. Finally, queues with a single bit of advice have a simple enough state that they can be analyzed in the limiting mean-field analysis framework for the power of two choices. Our work follows in the path of recent work by showing that even small amounts of even possibly inaccurate information can greatly improve scheduling performance.

中文翻译：

---

带有小建议的队列

受最近关于预测作业大小的调度工作的启发，我们考虑了具有最少建议（即单个位）的调度算法的性能。除了展示非常有限的建议的力量之外，这样的计划是很自然的。在预测设置中，可以使用一点建议来对工作是“大”还是“小”的简单预测进行建模；也就是说，工作是否高于或低于给定的阈值。此外，一位建议方案可以对应于告知是将作业放在队列的前面还是后面的机制，这一限制在许多实现设置中可能很有用。最后，带有一点建议的队列有一个足够简单的状态，可以在限制平均场分析框架中分析它们的两种选择的幂。