在云端的机器上进行经济高效的调度
Cost-efficient Scheduling on Machines from the Cloud
摘要:
我们考虑一个调度问题,机器需要从云租用,以处理工作。有两种类型的机器可供租用的机器类型依赖的价格和任意的持续时间。然而,在机器可用于加工之前,需要依赖于机器类型的设置时间。工作随着时间的推移而在线,具有机器类型依赖的大小,并且具有单独的截止日期。我们的目标是租用机器和安排工作,以满足所有的最后期限,同时最大限度地减少租赁成本。由于我们观察到的松弛的工作竞争力有一个根本性的影响,我们研究的模型时,实例参数化的(最小)松弛。对于所有作业,如果作业的发布时间与作业需要启动的最后时间点之间的差值至少为$β$,则调用实例以使其具有$β$的松弛时间。虽然对于$β< s$没有有限的竞争力是可能的,我们的主要结果是一个$O(\frac{c}{\varepsilon} + \frac{1}{\varepsilon^3})$竞争的在线算法$β= (1+\varepsilon)s$与$\frac{1}{s} \leq \varepsilon \leq 1$,其中$s$和$c$表示最大的设置时间和成本比的机器类型,分别。它由$Ω(\frac{c}{\varepsilon})$的下界补充。
英文摘要:
We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $β$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $β$. While for $β< s$ no finite competitiveness is possible, our main result is an $O(\frac{c}{\varepsilon} + \frac{1}{\varepsilon^3})$-competitive online algorithm for $β= (1+\varepsilon)s$ with $\frac{1}{s} \leq \varepsilon \leq 1$, where $s$ and $c$ denotes the largest setup time and the cost ratio of the machine-types, respectively. It is complemented by a lower bound of $Ω(\frac{c}{\varepsilon})$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。